Disk scheduling involves a careful examination of pending requests to determine the most efficient way to service these requests. A disk scheduler examines the positional relationship among waiting requests, then reorders the queue so that the requests will be serviced with minimum seek. The purpose of the study is to obtain the best scheduling algorithm based on the seek time, rotation time and transfer time for moveable head disks. Keeping in view an attempt has been made to design a simulator for optimizing the performance of disk scheduling algorithms using Box-Muller transformation. The input for the simulator has been derived by using an algorithm for generating pseudo random numbers which follows box-muller transformations. Simulator takes access time which is generated using seek time, rotation time and transfer time, as the request of cylinder numbers, current position of read/write head as inputs. On the basis of these inputs, total head movement of each disk scheduling algorithm is calculated under various loads.

How to Cite
P.K. SURI,SUMIT MITTAL, Dr.. Sim_Dsc: Simulator for Optimizing the Performance of Disk Scheduling Algorithms. Global Journal of Computer Science and Technology, [S.l.], dec. 1969. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/827>. Date accessed: 24 jan. 2021.