Buddy Algorithms
D. J. Challab · The Computer Journal · 1987
Algorithms are derived for allocating and deallocating blocks of memory using Binary Buddy, Weighted Buddy and Variant Weighted Buddy partitioning; and transformations are demonstrated for converting recursive into non-recursive forms. Algorithms are given for the relatively difficult computation of the addressed and size of a Buddy slot in the Weighted versions, and complexity and optimisation are also considered.