A fast storage allocator

DOI10.1145/365628.365655MaRDI QIDQ5337562zbMATH OpenOpenAlexFDO

Authors K. C. Knowlton

Publication date 1965

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

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

zbMATH Keywords

numerical analysis

Cited in

(14)

• Constant-competitive tree node assignment
• Online tree node assignment with resource augmentation
• An on-line algorithm to optimize file layout in a dynamic environment
• Fast allocation and deallocation with an improved buddy system
• Statistical investigation of three storage allocation algorithms
• A new sparse LDL^T solver using a posteriori threshold pivoting
• Exact formulas for the buddy system
• A note on weighted buddy systems for dynamic storage allocation
• scientific article; zbMATH DE number 3509716 (Why is no real title available?)
• On the worst case performance of buddy systems
• Analytical modeling of address allocation protocols in wireless ad hoc networks (Invited paper)
• Dynamic processor allocation in scalable multiprocessors using boolean algebra^*
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Online Tree Node Assignment with Resource Augmentation

This page was built for publication: A fast storage allocator

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