Disk Scheduling

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

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 6 of 6 algorithms


FCFS	1979	$O(n)$	$O(1)$
SSTF	1979	$O(n \log n)$ with binary tree	$O(n)$
SCAN	1979	$O(n \log n)$	$O(n)$
LOOK	1979	$O(n \log n)$	$O(n)$
C-SCAN	1979	$O(n \log n)$	$O(n)$
C-LOOK	1979	$O(n \log n)$	$O(n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms