Insertion and Compaction Algorithms in Sequentially Allocated Storage

DOI10.1137/0213037MaRDI QIDQ3335008zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker, E. G. jun. Coffman

Publication date 1984

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

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

zbMATH Keywords

polynomial time algorithmdynamic storage allocationmemory conflictspacking algorithmsby restaurantstorage compaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Algorithms for resolving conflicts in dynamic storage allocation
• A provably efficient algorithm for dynamic storage allocation
• Approximation algorithms for dynamic storage allocation
• scientific article; zbMATH DE number 4043214

Cited in

(8)

• Space overhead bounds for dynamic memory management with partial compaction
• Maintaining Arrays of Contiguous Objects
• Cost-oblivious storage reallocation
• scientific article; zbMATH DE number 4046862 (Why is no real title available?)
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• On bonded sequential and parallel insertion systems
• scientific article; zbMATH DE number 4043214 (Why is no real title available?)
• Algorithms for resolving conflicts in dynamic storage allocation

This page was built for publication: Insertion and Compaction Algorithms in Sequentially Allocated Storage

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