Disk Scheduling: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 33: | Line 33: | ||
[[File:Disk Scheduling - Time.png|1000px]] | [[File:Disk Scheduling - Time.png|1000px]] | ||
Latest revision as of 09:09, 28 April 2023
Description
When disk requests arrive at the disk device, they are queued for service and a disk scheduling algorithm is used to decide which of a waiting queue of disk requests to serve next.
Parameters
$n$: number of requests
Table of Algorithms
Name | Year | Time | Space | Approximation Factor | Model | Reference |
---|---|---|---|---|---|---|
FCFS | 1979 | $O(n)$ | $O({1})$ | Exact | Deterministic | |
SSTF | 1979 | $O(n \log n)$ with binary tree | $O(n)$ | Exact | Deterministic | Space |
SCAN | 1979 | $O(n \log n)$ | $O(n)$ | Exact | Deterministic | Space |
LOOK | 1979 | $O(n \log n)$ | $O(n)$ | Exact | Deterministic | |
C-SCAN | 1979 | $O(n \log n)$ | $O(n)$ | Exact | Deterministic | |
C-LOOK | 1979 | $O(n \log n)$ | $O(n)$ | Exact | Deterministic |
Time Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination