STUDY OF DIFFERENT ALGORITHMS USE FOR DISK SCHEDULING PROCESS

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 s uch 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 performa nce of the said algorithms. This paper also shows the differentiating abilities of the different scheduling algorithms and its effect to storage management, a better analysis of what disk scheduling algorithms do and how these amend the perform ance of serv icing disk requests .