A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
This paper aims to discuss the functioning of a disk and the comparative procedure involved in the retrieval of data on a direct access storage device by different algorithms. Efficiency of the different Disk Scheduling algorithms such as First Come First Serve (FCFS), Shortest Seek Time First (SSTF), Scan, Circular Scan (C-Scan) Scheduling algorithm. Disk requests execution and their pros and cons are also provided in this paper in order to make contrasts and comparisons of performance of thefatcat:4p7chjmtmzduvdqamr2o5e6veu