Definition: A memory allocation strategy which recursively divides allocatable blocks of memory into pairs of adjacent equal-sized blocks called "buddies".
Note: This term is included to minimize confusion with a buddy tree. After LK.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 24 August 2017.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "buddy system", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 24 August 2017. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/buddysystem.html