International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 93 - Number 18 |
Year of Publication: 2014 |
Authors: Nidhi, Dayashankar Singh |
10.5120/16433-6046 |
Nidhi, Dayashankar Singh . A New Optimized Real-Time Disk Scheduling Algorithm. International Journal of Computer Applications. 93, 18 ( May 2014), 7-12. DOI=10.5120/16433-6046
In this paper, a new approach of disk scheduling has been proposed to improve the throughput of modern storage device. After the invention of disk with movable head, researchers are making efforts continuously to improve the I/O performance by implementing many intelligent scheduling algorithms of disk accesses. Speeds of processor and memory capacity have been increased several times than the speed of the disk. Due to this difference in the speed of processor and the disk, I/O performance of disk has become an important bottleneck. Therefore, it is needed to develop some advanced methods for using disk more efficiently. Management of disk performance is an important aspect of operating system research and development. In this paper, a new disk scheduling algorithm has been developed and implemented to reduce the number of head movements. Experiment has been carried out to compare the performance of proposed algorithm with the performance of all six classical disk scheduling algorithms. Experiment shows that the numbers of head movements in existing classical disk scheduling algorithms such as FCFS, SSTF, SCAN, C-SCAN, LOOK and C-LOOK are high. But in proposed new optimized real-time disk scheduling algorithm, head movements are reduced and hence it maximizes the throughput for the modern storage devices.