Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Buddy memory allocation
open-in-new
<p> The buddy memory allocation technique is a <a href="/facts/Memory_allocation/vthLkUpz">memory allocation</a> algorithm that divides memory into partitions to try to satisfy a memory request as suitably as possible. This system makes use of splitting memory into halves to try to give a best fit. According to <a href="/facts/Donald_Knuth/GozNzDM6">Donald Knuth</a>, the buddy system was invented in 1963 by <a href="/facts/Harry_Markowitz/IbJSA0Sf">Harry Markowitz</a>, and was first described by <a href="/facts/Ken_Knowlton/FSjwexwv">Kenneth C. Knowlton</a> (published 1965). The Buddy memory allocation is relatively easy to implement. It supports limited but efficient splitting and <a href="/facts/Coalescing_(computer_science)/zpX2lMK1">coalescing of memory blocks</a>. </p>