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

DOI10.1016/0166-218X(85)90046-0MaRDI QIDQ1058288zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jacek Blazewicz, 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)

Recommendations

• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• scientific article; zbMATH DE number 4043214
• Approximation algorithms for dynamic storage allocation
• Algorithms for resolving conflicts in dynamic storage allocation
• A provably efficient algorithm for dynamic storage allocation

Cites work

• scientific article; zbMATH DE number 3483531 (Why is no real title available?)
• scientific article; zbMATH DE number 3483532 (Why is no real title available?)
• scientific article; zbMATH DE number 3488590 (Why is no real title available?)
• scientific article; zbMATH DE number 3633691 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Compaction Procedure for Variable-Length Storage Elements
• A note on compacting garbage collection
• A time- and space-efficient garbage compaction algorithm

Cited in

(14)

• Analysis of space allocation in a generally fragmented linear store
• Dynamic storage allocation with known durations
• Reallocation problems in scheduling
• scientific article; zbMATH DE number 1003306 (Why is no real title available?)
• Space overhead bounds for dynamic memory management with partial compaction
• Maintaining Arrays of Contiguous Objects
• Embedded minimal disks: Proper versus nonproper—global versus local
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• Fixed-sized blocks optimization
• Space defragmentation for packing problems
• scientific article; zbMATH DE number 6399332 (Why is no real title available?)
• scientific article; zbMATH DE number 4043214 (Why is no real title available?)
• Finite-size scaling approach to dynamic storage allocation problem
• Algorithms for resolving conflicts in dynamic storage allocation

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

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