Record allocation for minimizing seek delay

DOI10.1016/0304-3975(81)90101-8zbMATH Open0468.68077OpenAlexW2039125930MaRDI QIDQ1156493FDOQ1156493

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• Placement of Records on a Secondary Storage Device to Minimize Access Time
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• 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)