Buddy memory allocation is relatively easy to implement.

Typically the buddy memory allocation system is implemented with the use of a binary tree to represent used or unused split memory blocks.

The buddy memory allocation technique allocates memory in powers of 2, i.e 2x, where x is an integer.

SIMSCRIPT (I) included the Buddy memory allocation method, which was also developed by Markowitz.

The buddy memory allocation technique is a memory allocation algorithm that divides memory into partitions to try to satisfy a memory request as suitably as possible.

Because of the way the buddy memory allocation technique works, a program that requests 66K of memory would be allocated 128K, which results in a waste of 62K of memory.