Analysis of Scanning Policies for Reducing Disk Seek Times

DOI10.1137/0201018zbMath0248.68012OpenAlexW2088682925MaRDI QIDQ5661134

Lawrence A. Klimko, Barbara F. Ryan, Edward G. jun. Coffman

Publication date: 1972

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0201018

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (5)

Hardware design of a new genetic based disk scheduling method ⋮ 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 ⋮ Some notes on the queueing analysis of the SCAN policy of the walking server

This page was built for publication: Analysis of Scanning Policies for Reducing Disk Seek Times