Space overhead bounds for dynamic memory management with partial compaction

DOI10.1145/1926385.1926441MaRDI QIDQ5408567zbMATH OpenOpenAlexFDO

Authors Anna Bendersky, Erez Petrank

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926441

zbMATH Keywords

compactionmemory managementstorage allocationruntime systemsdynamic memory allocationpartial compaction

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• scientific article; zbMATH DE number 1305512

Cited in

(3)

• scientific article; zbMATH DE number 1003306 (Why is no real title available?)
• Quantifying and evaluating the space overhead for alternative C++ memory layouts
• Reallocation problems in scheduling

This page was built for publication: Space overhead bounds for dynamic memory management with partial compaction

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