Disk Scheduling: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Problem Description== File systems must be accessed in an efficient manner, especially with hard drives, which are the slowest part of a computer. As a computer deals with multiple processes over a period of time, a list of requests to access the disk builds up. For efficiency purposes, all requests (from all processes) are aggregated together. The technique that the operating system uses to determine which requests to satisfy first is called disk scheduling. == Bou...") |
No edit summary |
||
| Line 1: | Line 1: | ||
== | {{DISPLAYTITLE:Disk Scheduling (Disk Scheduling)}} | ||
== 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 == | ||
<pre>n: number of requests</pre> | |||
== | == Table of Algorithms == | ||
{| class="wikitable" style="text-align:center;" width="100%" | |||
{| class="wikitable sortable" style="text-align:center;" width="100%" | |||
| | ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference | ||
| | |||
| | |- | ||
| [[FCFS (Disk Scheduling Disk Scheduling)|FCFS]] || 1979 || $O(n)$ || $O({1})$ auxiliary || Exact || Deterministic || | |||
|- | |||
| [[SSTF (Disk Scheduling Disk Scheduling)|SSTF]] || 1979 || $O(n*log n)$ with binary tree || $O(n)$ auxiliary || Exact || Deterministic || [https://www.geeksforgeeks.org/program-for-sstf-disk-scheduling-algorithm/?ref=lbp Space] | |||
|- | |- | ||
| | | [[SCAN (Disk Scheduling Disk Scheduling)|SCAN]] || 1979 || $O(n*log n)$ || $O(n)$ auxiliary || Exact || Deterministic || [https://www.geeksforgeeks.org/scan-elevator-disk-scheduling-algorithms/?ref=lbp Space] | ||
| | |||
| | |||
|- | |- | ||
| | | [[LOOK (Disk Scheduling Disk Scheduling)|LOOK]] || 1979 || $O(n*log n)$ || $O(n)$ auxiliary || Exact || Deterministic || | ||
| | |||
| | |||
|- | |- | ||
| | | [[C-SCAN (Disk Scheduling Disk Scheduling)|C-SCAN]] || 1979 || $O(n*log n)$ || $O(n)$ auxiliary || Exact || Deterministic || | ||
| | |||
| | |||
|- | |- | ||
| | | [[C-LOOK (Disk Scheduling Disk Scheduling)|C-LOOK]] || 1979 || $O(n*log n)$ || $O(n)$ auxiliary || Exact || Deterministic || | ||
| | |||
| | |||
|- | |- | ||
| | |} | ||
== Time Complexity graph == | |||
[ | [[File:Disk Scheduling - Time.png|1000px]] | ||
== Space Complexity graph == | |||
[ | [[File:Disk Scheduling - Space.png|1000px]] | ||
== Pareto Decades graph == | |||
[ | [[File:Disk Scheduling - Pareto Frontier.png|1000px]] | ||
Revision as of 10:23, 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 Decades graph
