Category: Disk scheduling algorithms

Completely Fair Queuing (CFQ) is an I/O scheduler for the Linux kernel which was written in 2003 by Jens Axboe.

The elevator algorithm (also SCAN) is a disk-scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests. This algorithm is named after the behavior of

N-Step-SCAN (also referred to as N-Step LOOK) is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.It segments the request queue into

Shortest seek first (or shortest seek time first) is a secondary storage scheduling algorithm to determine the motion of the disk read-and-write head in servicing read and write requests.

The NOOP scheduler is the simplest I/O scheduler for the Linux kernel. This scheduler was developed by Jens Axboe.

LOOK is a disk scheduling algorithm used to determine the order in which new disk read and write requests are processed.

Anticipatory scheduling is an algorithm for scheduling hard disk input/output (I/O scheduling). It seeks to increase the efficiency of disk utilization by "anticipating" future synchronous read operat

The deadline scheduler is an I/O scheduler for the Linux kernel which was written in 2002 by Jens Axboe.

FSCAN is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.It uses two sub-queues. During the scan, all of the requests are in the fir