A Comparative Analysis of Disk Scheduling Algorithms
In an operating system, disk scheduling is the process of managing the I/O request to the secondary storage devices such as hard disk. The speed of the processor and primary memory has increased in a rapid way than the secondary storage. Seek time is the important factor in an operating system to get the best access time. For the better performance, speedy servicing of I/O request for secondary memory is very important. The goal of the disk-scheduling algorithm is to minimize the response time and maximize throughput of the system.
This work analyzed and compared various basic disk scheduling techniques like First Come First Serve (FCFS), Shortest Seek Time First (SSTF), SCAN, LOOK, Circular SCAN (C-SCAN) and Circular LOOK (C-LOOK) along with the corresponding seek time. From the comparative analysis, the result show that C-LOOK algorithm give the least head movement and seek time in different cases as compared to other algorithm. Therefore, it maximizes the throughput for the storage devices.
T. Singh, “A Comparative Study of Disk Scheduling Algorithms,” vol. 4, no. 1, pp. 29–32, 2016.
T. J. Teorey and T. B. Pinkerton, “A comparative analysis of disk scheduling policies,” ACM SIGOPS Oper. Syst. Rev., vol. 6, no. 1/2, p. 114, 2004.
R. Geist and R. Geist, “A Continuum of Disk Scheduling Algorithms,” no. May, 2014.
M. K. M. R and R. R. B, “An Improved Approach to Maximize the Performance of Disk Scheduling Algorithm by Minimizing the Head Movement and Seek Time using Sort Mid Current Comparison ( SMCC ) Algorithm,” Procedia - Procedia Comput. Sci., vol. 57, pp. 222–231, 2015.
D. Singh, “A New Optimized Real-Time Disk Scheduling Algorithm,” vol. 93, no. 18, pp. 7–12, 2014.
C. S. Spring and K. Zhang, “Disk Scheduling Algorithms,” pp. 1–12, 2015.
P. Pandey, G. Joshi, and K. K. Gola, “A ZONE BASED IMPROVED DISK,” pp. 1–5, 2016.
C. Mallikarjuna and P. C. Babu, “Performance Analysis of Disk Scheduling Algorithms,” no. 05, pp. 180–184, 2016.
H. Paida, “Disk Scheduling,” vol. 1, no. 2, pp. 6–9, 2013.
J. Celis, D. Gonzales, E. Lagda, and L. R. Jr, “A Comprehensive Review for Disk Scheduling Algorithms,” Int. J. Comput. Sci. Issues, vol. 11, no. 1, pp. 74–79, 2014.
A. T.A., A. B.O., and O. S.F., “An Hybridized Disk Scheduling Algorithm (HDSA),” Int. J. Sci. Res. Publ., vol. 9, no. 3, p. p8789, 2019.
S. Suranauwarat, “A Disk Scheduling Algorithm Simulator,” vol. 8, no. 3, pp. 1–9, 2017.
S. Saha, N. Akhter, and M. A. Kashem, “A New Heuristic Disk Scheduling Algorithm,” vol. 2, no. 1, 2013.
C. M. arjuna, K. S. Babu, and D. P. C. Babu, “Priority Based Disk Scheduling Algorithm,” Int. J. Innov. Res. Sci. Eng. Technol., vol. 03, no. 09, pp. 15954–15959, 2014.
M. K. Mishra, “Major Half Served First ( MHSF ) Disk Scheduling Algorithm,” vol. II, no. I, pp. 31–35, 2013.
S. Kumar Bhoi, S. Kumar Panda, and I. Hossain Faruk, “Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA),” Int. J. Comput. Appl., vol. 40, no. 11, pp. 28–35, 2012.
M. KumarMishra, “An Improved FCFS (IFCFS) Disk Scheduling Algorithm,” Int. J. Comput. Appl., vol. 47, no. 13, pp. 20–24, 2012.
M. R. M. Kumar and B. R. Rajendra, “An Improved Approach to Maximize the Performance of Disk Scheduling Algorithm by Minimizing the Head Movement and Seek Time Using Sort Mid Current Comparison (SMCC) Algorithm,” Procedia Comput. Sci., vol. 57, pp. 222–231, 2015.
J. R. Celis, D. Gonzales, E. Lagda, and L. R. Jr, “A Comprehensive Review for Disk Scheduling Algorithms,” vol. 11, no. 1, pp. 74–79, 2014.
M. Y. Javed and I. U. Khan, “Simulation and performance comparison of four disk scheduling algorithms,” pp. 10–15, 2002.
M. C. Waveguides, N. Osman, M. Koshiba, S. Member, and R. Kdji, “A Comprehensive Analysis of,” vol. 12, no. 5, pp. 0–5, 1994.
Copyright (c) 2021 International Journal for Research in Applied Sciences and Biotechnology
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.