Record allocation for minimizing seek delay

DOI10.1016/0304-3975(81)90101-8zbMath0468.68077OpenAlexW2039125930MaRDI QIDQ1156493

S. H. Smith

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90101-8

zbMATH Keywords

performance boundsvariable length recordsaccess probabilitiesexpected seek timelinear storage device

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Related Items (1)

Record allocation for minimizing seek delay

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Record allocation for minimizing seek delay
• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Placement of Records on a Secondary Storage Device to Minimize Access Time

This page was built for publication: Record allocation for minimizing seek delay