Record allocation for minimizing seek delay

DOI10.1016/0304-3975(81)90101-8MaRDI QIDQ1156493zbMATH OpenOpenAlexFDO

Authors 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

access probabilitiesexpected seek timelinear storage deviceperformance boundsvariable length records

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3014822 (Why is no real title available?)
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Placement of Records on a Secondary Storage Device to Minimize Access Time
• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• Record allocation for minimizing seek delay

Cited in

(1)

• Record allocation for minimizing seek delay

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156493)