Space overhead bounds for dynamic memory management with partial compaction

DOI10.1145/1926385.1926441zbMath1284.68084OpenAlexW4234874701MaRDI QIDQ5408567

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

memory managementcompactionstorage 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)

Related Items (1)

Reallocation problems in scheduling

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