We propose several modifications to the binary buddy system for managing dynamic
allocation of memory blocks whose sizes are powers of two. The standard buddy system
allocates and deallocates blocks in Θ(\lgn) time in the worst case (and on an amortized
basis), where n is the size of the memory. We present three schemes that improve the
running time to O (1) time, where the time bound for deallocation is amortized for the first two
schemes. The first scheme uses just one more word of memory than the standard buddy …

We propose several modifications to the binary buddy system for managing dynamic
allocation of memory blocks whose sizes are powers of two. The standard buddy system
allocates and deallocates blocks in Θ (lg n) time in the worst case (and on an amortized
basis), where n is the size of the memory. We present two schemes that improve the running
time to O (1) time, where the time bound for deallocation is amortized. The first scheme uses
one word of extra storage compared to the standard buddy system, but may fragment …