Management of disk scheduling is a very important aspect of operating system. Performance of the disk scheduling completely depends on how efficient is the scheduling algorithm to allocate services to the requests in a better manner. Many scheduling algorithms such as FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK are developed in recent years to optimised the system disk I/O performance. By reducing the number of head movement, we can improve the performance of disk I/O operation. In this paper, a new algorithm has been proposed to reduce the number of head movement. The proposed algorithm is designed from SSTF and SCAN algorithms. The existing scheduling algorithms and our proposed algorithm are applied to two different queues of disk I/O requests. The results show that, our algorithm and LOOK give the least head movement values in the case of first queue of disk I/O requests, but it gives the least head movement value in the second queue of disk I/O of requests. Conclusively, HDSA (Hybridized Disk Scheduling Algorithm) has reduced the head movement as compared to the existing Disk Scheduling Algorithms. it therefore maximizes the throughput for modern storage devices.
Akanmu, T. A., Aadegoke, B. O. and Oladoye, S. F. (2019); An Hybridized Disk Scheduling Algorithm (HDSA); International Journal of Scientific and Research Publications (IJSRP)
9(3) (ISSN: 2250-3153), DOI: http://dx.doi.org/10.29322/IJSRP.9.03.2019.p8789