Dynamic placement of records and the classical occupancy problem

DOI10.1016/0898-1221(81)90117-6MaRDI QIDQ1145997zbMATH OpenOpenAlexFDO

Authors Mátyás Arató, András A. Benczúr

Publication date 1980

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(81)90117-6

zbMATH Keywords

dynamic allocationoccupancy problemdynamic placement of recordsfilinglinear storage

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3718539 (Why is no real title available?)
• scientific article; zbMATH DE number 3537218 (Why is no real title available?)
• scientific article; zbMATH DE number 3568008 (Why is no real title available?)
• scientific article; zbMATH DE number 3344917 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• Dynamic Placement of Records in Linear Storage
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• On the Optimality of the Probability Ranking Scheme in Storage Applications
• Placement of Records on a Secondary Storage Device to Minimize Access Time

Cited in

(2)

• Refined large deviation asymptotics for the classical occupancy problem
• Measures of distinctness for random partitions and compositions of an integer

This page was built for publication: Dynamic placement of records and the classical occupancy problem

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