A comparative analysis of disk scheduling policies

DOI10.1145/361268.361278zbMath0232.68017OpenAlexW1996218716MaRDI QIDQ5640727

Toby J. Teorey, Tad B. Pinkerton

Publication date: 1972

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361268.361278

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

The generalized Banach match-box problem: Application in disc storage management ⋮ Polling and greedy servers on a line ⋮ Estimating disk head movement in batched searching ⋮ SIMPLE: An optimal disk system with two restricted heads ⋮ A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy ⋮ Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN ⋮ A stochastic analysis of hard disk drives ⋮ Modelling a disc I/0 system ⋮ An adversarial queueing model for online server routing

This page was built for publication: A comparative analysis of disk scheduling policies