A zone based improved disk scheduling algorithm

The main objective of the paper is to propose new disk scheduling to enhance disk performance. Disk performance management is an escalating important facet of operating system research and development. As new types of storage devices are developed, it is necessary to revisit the issue of scheduling to reduce access latency to data on the devices. This work shows the study of various existing disk scheduling algorithms. In these disk scheduling algorithm, we have analyzed that a disk scheduling algorithm with minimum disk access time is best which is totally depend upon it's seek time. So keeping in mind that the seek time has to be minimum, there should be minimum number of disk head movements because seek time is the time entailed by the disk head to move from its current cylinder to the cylinder of the disk request to be fulfilled. Therefore this work proposed a new disk scheduling algorithm that imposes almost no performance penalty over non-real-time optimal schedulers. This paper proposes a new algorithm to improve the seek time. Comparison results has also been compared with the existing algorithms.