Analysis of Traditional Hard Disk Scheduling Algorithms: A Review

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.

A Comparative Analysis of Disk Scheduling Algorithms

In an operating system, disk scheduling is the process of managing the I/O request to the secondary storage devices such as hard disk. The speed of the processor and primary memory has increased in a rapid way than the secondary storage. Seek time is the important factor in an operating system to get the best access time. For the better performance, speedy servicing of I/O request for secondary memory is very important. The goal of the disk-scheduling algorithm is to minimize the response time and maximize throughput of the system. This work analyzed and compared various basic disk scheduling techniques like First Come First Serve (FCFS), Shortest Seek Time First (SSTF), SCAN, LOOK, Circular SCAN (C-SCAN) and Circular LOOK (C-LOOK) along with the corresponding seek time. From the comparative analysis, the result show that C-LOOK algorithm give the least head movement and seek time in different cases as compared to other algorithm. Therefore, it maximizes the throughput for the storage devices.

Performance Enhancement of Cloud Based Storage using Disk Scheduling Technique

Cloud-based high-performance storage techniques are proposed in this article. Primarily, the performance of storage is dependent on seek time of incoming track requests, IOPS(Input/output operations per second), and throughput. The proposed technique is designed to calculate the average seek time of incoming track requests, IOPS and throughput calculation, sorting algorithms and R/W head movement in order to represent the possibility of better performance than existing high performing algorithms.

Performance of Movable Head Disk Storage Devices with Various Disk Scheduling Algorithms

Hard drives are the one which needs to be accessed in an efficient manner so that it is feasible to get better recital of the central processing unit. Now a day’s magnetic disks are capable of providing more input output bandwidth yet a huge amount of this bandwidth is lost due to the access time of the hard disk. This paper discusses an analysis of performance of various disk scheduling algorithms with their merits and demerits