An Improved Approach to Maximize the Performance of Disk Scheduling Algorithm by Minimizing the Head Movement and Seek Time Using Sort Mid Current Comparison (SMCC) Algorithm

One of the main goal of the operating system for the disk drives is to use the hardware efficiently. we can meet this goal using fast access time and large disk bandwidth that depends on the relative positions of the read-write head and the requested data. Since memory management allows multiprogramming so that operating system keeps several read/write request in the memory. In order to service these requests, hardware (disk drive and controller) must be used efficiently. To support this in disk drive, the hardware must be available to service the request. if the hardware is busy, we can’t service the request immediately and the new request will be placed in the queue of pending requests. Several disk scheduling algorithms are available to service the pending requests. among these disk scheduling algorithms, the algorithm that yields less number of head movement will remain has an efficient algorithm.In this research paper, we propose a new disk scheduling algorithm that will reduce the number of movement of head thereby reducing the seek time and it improves the disk bandwidth for modern storage devices. Our results and calculations show that, proposed disk scheduling algorithm will improve the performance of disk i/o by reducing average seek time compared to the existing disk scheduling algorithm. For few requests, the seek time and the total number of head movement is equal to SSTF or LOOK scheduling.