Insertion and Compaction Algorithms in Sequentially Allocated Storage

DOI10.1137/0213037zbMATH Open0545.68063OpenAlexW1977753569MaRDI QIDQ3335008FDOQ3335008

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

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

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)

Cited In (8)

• Algorithms for resolving conflicts in dynamic storage allocation
• Title not available (Why is that?)
• Cost-oblivious storage reallocation
• Space overhead bounds for dynamic memory management with partial compaction
• Title not available (Why is that?)
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Maintaining Arrays of Contiguous Objects
• On bonded sequential and parallel insertion systems

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)