Algorithms for resolving conflicts in dynamic storage allocation

DOI10.1145/3149.335126MaRDI QIDQ3766837zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker, Dan E. Willard, E. G. jun. Coffman

Publication date 1985

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

garbage collectionbuddy systemfragmentation conflictsfragmentation of storage

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• A provably efficient algorithm for dynamic storage allocation
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Fast allocation and deallocation with an improved buddy system
• Efficient algorithms for dynamic allocation of distributed memory

Cited in

(10)

• Buddy Algorithms
• Finite-size scaling approach to dynamic storage allocation problem
• Fixed-sized blocks optimization
• A provably efficient algorithm for dynamic storage allocation
• Space overhead bounds for dynamic memory management with partial compaction
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
• On the worst case performance of buddy systems
• Maintaining Arrays of Contiguous Objects

This page was built for publication: Algorithms for resolving conflicts in dynamic storage allocation

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