Analysis of Traditional Hard Disk Scheduling Algorithms: A Review
Abstract
Abstract— This review paper compares the various disk scheduling algorithms that are used to schedule processes in a queue, such as FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK, OTHDSA, and Zone Base Disk Scheduling, and then applies all of these techniques to two data sets to assess the performance of each algorithm. The comparison includes updated and improved techniques that show promising results in collecting data from the digital store. The comparison results were also contrasted with supporting the statement that all disk scheduling algorithms' technique offers much better performance. The comparison shows that among all disk scheduling algorithms, OTHDSA has excellent performance and takes a search time of 250 to complete all requests in a queue.
Copyright (c) This is an open access article published by QUEST Research Journal. QUEST Research Journal holds the rights of all the published articles. Authors are required to transfer copyrights to journal to make sure that the article is solely published in QUEST Research Journal; however, the authors and readers may freely read, download, copy, distribute, print, search, or link to the full texts of the articles without asking prior permission from the publisher or the author.

This work is licensed under a Creative Commons Attribution 4.0 International License.