No Detail Found!

Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

Author(s)
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,Pakistan
Kamlesh Kumar Department of Software Engineering, Sindh Madressatul Islam University,Karachi,Pakistan
Imtiaz Ali Halepoto Department of Software Engineering,QUEST Nawabshah, Sindh,Pakistan
Naadiya Mirbahar Department of Computer Science, Sindh Madressatul Islam University, Karachi, Pakistan; 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,Pakistan
Abstract
This review paper compares the various disk scheduling algorithms used to schedule processes in a queue, such as FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK, OTHDSA and Zone Base Disk Scheduling. It then applies all of these techniques using two data sets of I/O requests to assess the performance of each algorithm. The comparison includes total seek time to locate the requested I/O, the overall throughput of jobs done per unit, and the fairness of each request to be serviced. The comparison results also supported the statement that all disk scheduling techniques offer a good performance. The comparison shows that among all disk scheduling algorithms, OTHDSA has excellent performance and takes 175 seek times and 139 seek times to complete all I/O requests of both example lists, respectively.
Publication Details
Page(s) 51-58
Published Journal: Quaid-e-Awam University Research Journal of Engineering, Science and Technology, Volume: 19, Issue: 1, Year: 2021

Request the full text from PASTIC

Keywords
scan, FCFS, SSTF, Zone-Based, Modification Over C-LOOK, OTHDSA, Disk Scheduling, C-SCAN, C-LOOK
0

Citations

0

Downloads

69

Views