Dynamic storage allocation with limited compaction - complexity and some practical implications

DOI10.1016/0166-218X(85)90046-0zbMath0564.68020DBLPjournals/dam/BlazewiczN85OpenAlexW2035105893WikidataQ57387930 ScholiaQ57387930MaRDI QIDQ1058288

Jacek Błażewicz, Jerzy R. Nawrocki

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90046-0

zbMATH Keywords

approximation algorithmscomplexity of algorithmsdynamic memory allocationcontiguous segments

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (1)

Reallocation problems in scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on compacting garbage collection
• A time- and space-efficient garbage compaction algorithm
• A Compaction Procedure for Variable-Length Storage Elements

This page was built for publication: Dynamic storage allocation with limited compaction - complexity and some practical implications