A fast storage allocator
From MaRDI portal
Publication:5337562
DOI10.1145/365628.365655zbMath0129.10301OpenAlexW1996027765MaRDI QIDQ5337562
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
Related Items (14)
Online Tree Node Assignment with Resource Augmentation ⋮ Worst case performance analysis of the two dimensional binary buddy system∗ ⋮ Statistical investigation of three storage allocation algorithms ⋮ Constant-competitive tree node assignment ⋮ Exact formulas for the buddy system ⋮ Online tree node assignment with resource augmentation ⋮ An on-line algorithm to optimize file layout in a dynamic environment ⋮ A note on weighted buddy systems for dynamic storage allocation ⋮ Dynamic processor allocation in scalable multiprocessors using boolean algebra* ⋮ Fast allocation and deallocation with an improved buddy system ⋮ Analytical Modeling of Address Allocation Protocols in Wireless Ad Hoc Networks ⋮ A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting ⋮ On the worst case performance of buddy systems ⋮ Unnamed Item
This page was built for publication: A fast storage allocator
