A New Heuristic Disk Scheduling Algorithm

Abstract- Since the invention of the movable head disk people have improved IO performance by intelligent scheduling of disk accesses. Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk IO performance will become an important bottleneck .Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. Disk performance management is an increasingly important aspect of operating system research and development. In this paper a new disk scheduling algorithm has been proposed to reduce the number of movement of head. It is observed that in existing scheduling algorithms the number of head movement is high. But we proposed a new real-time disk scheduling algorithm that reduces the head movement therefore it maximizes throughput for modern storage devices.