Optimized Two Head Disk Scheduling Algorithm (OTHDSA)

In this paper, we proposed a new disk scheduling algorithm for improving the performance of modern storage devices in terms of throughput. Since the invention of disk with movable heads, many researchers tried to improve the I/O performance by using intelligent algorithms for disk scheduling. Memory capacity and speed of the processor are increasing several times than the speed of disk. This disparity shows that this cannot supply data to processor as fast as it requires. As soon as data is received by the processor from disk, data is processed immediately and then processor waits for next data from disk. Hence disk I/O performance becomes a bottleneck. Some advanced methods and scheduling algorithms are required for increasing disk I/O performance and using the disk efficiently. We can improve the performance of disk by reducing total number of head movements needed to serve requests. In this paper, we proposed and implemented an optimized two head disk scheduling algorithm (OTHDSA) which reduces total number of head movements. Experimental analysis has been carried out and it is observed that this proposed algorithm requires less number of head movements than many existing disk scheduling algorithms and hence it maximizes the throughput.