Comparative analysis of an Optimized, NHA, SMCC Disk Scheduling Algorithm

The Disk is one of the crucial Computer resources, which schedules multiple read-write requests. Efficient use of Hardware for disk drives in Operating System depends on fast access of drives and large disk bandwidth. To support multiprogramming, Operating system needs to service several read write requests together. In this paper, we compared the performance of improved approaches of Disk Scheduling i.e. Optimized Disk Scheduling Algorithm, new Heuristic and sort Mid Current Comparison on the basis of seek length and disk bandwidth. Most of the researchers in past worked on various disk scheduling algorithm but no one has determined algorithmic complexity. The goal of this work is to conclude on an improved Disk Scheduling Algorithm which meets the requirement of efficient hardware utilization and increase the serviceable I/O request. This comparative study gives a fair idea to choose an appropriate algorithm when desired.