Buddy memory allocation
Memory allocation algorithm
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. This system makes use of splitting memory into halves to try to give a best fit.
Nº Q1001112 ★
Common · Knowledge
Buddy memory allocation
Memory allocation algorithm
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. This system makes use of splitting memory into halves to try to give a best fit.
From Wikipedia
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. This system makes use of splitting memory into halves to try to give a best fit. According to Donald Knuth, the buddy system was invented in 1963 by Harry Markowitz, and was first described by Kenneth C. Knowlton (published 1965). The Buddy memory allocation is relatively easy to implement. It supports limited but efficient splitting and coalescing of memory blocks.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Quicksort
Divide and conquer sorting algorithm
Nº Q486598 ★★★★
Not listed
-
Hungarian algorithm
Combinatorial optimization algorithm for the assignment problem
Nº Q281922 ★★
Not listed
-
Little Man Computer
Instructional model of a computer
Nº Q6652737 ★★
Not listed
-
L
Lattice multiplication
Multiplication algorithm
Nº Q3516846 ★
Not listed
-
Binary GCD algorithm
Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
Nº Q622328 ★
Not listed
-
S
Slab allocation
Memory management mechanism for same-size objects
Nº Q438458 ★
Not listed