An efficient Disk Scheduling algorithm using Binary Search Tree

Secondary storage devices are used to store programs and data permanently. A process may request for input / output operation on the disk and the same is serviced by the disk hardware. For a multiprogramming system, many processes waiting for the disk hardware to service the incoming pending request from disk queue. Operating system uses disk scheduling algorithms to schedule the incoming disk requests. The performance of these algorithms depends heavily on read / write head movement, seek time, rotational latency and disk bandwidth. In this paper, an efficient disk scheduling algorithm using binary search tree is proposed. Results show that the performance of the proposed algorithm has significantly improved in terms of consuming less seek time and read / write head movements with reference to conventional disk scheduling algorithms.