Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

  • Mustafa Ali Bamboat Department of Computer Science, Sindh Madressatul Islam University, Karachi, Pakistan.
  • Mansoor Ahmed Khuhro Department of Computer Science, Sindh Madressatul Islam University, Karachi
  • Kamlesh Kumar Department of Software Engineering, Sindh Madressatul Islam University, Karachi.
  • Imtiaz Ali Halepoto Department of Software Engineering, QUEST Nawabshah, Sindh Pakistan
  • Naadia Mirbahar Research Lab of Information Security and AI, Benazir Bhutto Shaheed University, Karachi, Pakistan
  • Ghulam Sarfaraz Khan Department of Computer Science, Sindh Madressatul Islam University, Karachi.
Keywords: Disk Scheduling, Modification Over C-LOOK, OTHDSA, Zone-Based, FCFS, SSTF, SCAN, C-SCAN, C-LOOK

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.

Published
2021-06-30
How to Cite
Bamboat, M., Khuhro, M. A., Kumar, K., Halepoto, I. A., Mirbahar, N., & Khan, G. S. (2021). Analysis of Traditional Hard Disk Scheduling Algorithms: A Review. Quaid-E-Awam University Research Journal of Engineering, Science & Technology, Nawabshah., 19(1), 51-58. https://doi.org/10.52584/QRJ.1901.07

Most read articles by the same author(s)