Design and Performance Evaluation of Median Range Scheduling Algorithm

Disk system performance can be dramatically improved by dynamically scheduling, ordering and pending requests. Past analysis of disk scheduling algorithms has to largely experimental with little effort to develop algorithms with measurable performance guarantees. In this paper, the authors propose an algorithm that reduces average seek time. Then the proposed algorithm is compared with conventional scheduling algorithm and measurable evidence is provided for the same. Our results and calculations show that the proposed algorithm will improve the performance of the disk by reducing average seek time and thereby providing a faster disk subsystem