Disk Scheduling: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 30: | Line 30: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Disk Scheduling - Time.png|1000px]] | [[File:Disk Scheduling - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Disk Scheduling - Space.png|1000px]] | [[File:Disk Scheduling - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Disk Scheduling - Pareto Frontier.png|1000px]] | [[File:Disk Scheduling - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 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})$ auxiliary | Exact | Deterministic | |
| SSTF | 1979 | $O(n*log n)$ with binary tree | $O(n)$ auxiliary | Exact | Deterministic | Space |
| SCAN | 1979 | $O(n*log n)$ | $O(n)$ auxiliary | Exact | Deterministic | Space |
| LOOK | 1979 | $O(n*log n)$ | $O(n)$ auxiliary | Exact | Deterministic | |
| C-SCAN | 1979 | $O(n*log n)$ | $O(n)$ auxiliary | Exact | Deterministic | |
| C-LOOK | 1979 | $O(n*log n)$ | $O(n)$ auxiliary | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
