scholarly journals Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN

1992 ◽  
Vol 32 (4) ◽  
pp. 546-558 ◽  
Author(s):  
Tung-Shou Chen ◽  
Wei-Pang Yang ◽  
R. C. T. Lee
Keyword(s):  
Scheduling Algorithms ◽  
Disk Scheduling ◽  
Amortized Analysis

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

2019 ◽  
Vol 9 (2S) ◽  
pp. 486-490
Keyword(s):  
Scheduling Algorithms ◽  
Access Time ◽  
Processing Unit ◽  
Disk Scheduling ◽  
Efficient Manner ◽  
Hard Drives ◽  
Storage Devices ◽  
Disk Storage ◽  
Central Processing ◽  
The One

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

Comparing disk scheduling algorithms for VBR data streams

1998 ◽  
Vol 21 (15) ◽  
pp. 1328-1343 ◽  
Author(s):  
Jan Korst ◽  
Verus Pronk ◽  
Pascal Coumans ◽  
Giel van Doren ◽  
Emile Aarts
Keyword(s):  
Data Streams ◽  
Scheduling Algorithms ◽  
Disk Scheduling

Motivational Evaluation of a Virtual Reality Simulator to Teach Disk-Scheduling Algorithms for Solid-State Drives (SSDs)

2020 ◽  
pp. 826-836
Author(s):  
Alex Sandro Rodrigues Ancioto ◽  
Luiz Felipe Santos Freitas ◽  
Diego Roberto Colombo Dias ◽  
Valéria Farinazzo Martins ◽  
Alexandre Fonseca Brandão ◽  
...  
Keyword(s):  
Virtual Reality ◽  
Solid State ◽  
Scheduling Algorithms ◽  
Virtual Reality Simulator ◽  
Disk Scheduling ◽  
Solid State Drives

Optimization of online disk scheduling algorithms

2006 ◽  
Vol 33 (4) ◽  
pp. 42-46 ◽  
Author(s):  
Saman Zarandioon ◽  
Alexander Thomasian
Keyword(s):  
Scheduling Algorithms ◽  
Disk Scheduling

scholarly journals A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads

2014 ◽  
Vol 2014 ◽  
pp. 1-17
Author(s):  
Taeseok Kim ◽  
Hyokyung Bahn ◽  
Youjip Won
Keyword(s):  
Response Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Disk Scheduling ◽  
Best Effort ◽  
Qos Guarantees ◽  
Time Minimization ◽  
On Line ◽  
Manageable Level ◽  
Deadline Constraints

In heterogeneous I/O workload environments, disk scheduling algorithms should support different QoS (Quality-of-Service) for each I/O request. For example, the algorithm should meet the deadlines of real-time requests and at the same time provide reasonable response time for best-effort requests. This paper presents a novel disk scheduling algorithm called G-SCAN (Grouping-SCAN) for handling heterogeneous I/O workloads. To find a schedule that satisfies the deadline constraints and seek time minimization simultaneously, G-SCAN maintains a series of candidate schedules and expands the schedules whenever a new request arrives. Maintaining these candidate schedules requires excessive spatial and temporal overhead, but G-SCAN reduces the overhead to a manageable level via pruning the state space using two heuristics. One is grouping that clusters adjacent best-effort requests into a single scheduling unit and the other is the branch-and-bound strategy that cuts off inefficient or impractical schedules. Experiments with various synthetic and real-world I/O workloads show that G-SCAN outperforms existing disk scheduling algorithms significantly in terms of the average response time, throughput, and QoS-guarantees for heterogeneous I/O workloads. We also show that the overhead of G-SCAN is reasonable for on-line execution.

Sign in / Sign up

Export Citation Format

Share Document