The document discusses the buddy memory allocation technique, which divides memory into partitions to try to satisfy memory requests. It allocates memory in blocks that can be split in half to form "buddy" blocks of the same size that are stored adjacently, allowing the blocks to be merged later. The buddy system provides benefits like less external fragmentation and cheaper searches compared to best-fit allocation, but has disadvantages like internal fragmentation and unpredictable time to fragment and coalesce blocks.

1. Presented By:
Kumod Shah
Roll no. 14

2.  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.
 It is interesting compromise of fixed and
dynamic partitioning.

3.  The buddy system(binary) allows a single
allocation block to be split, to form two blocks
half the size of the parent block. These two
blocks are known as 'buddies.
 The buddy of block (say A)must be the same
size as B, and must be adjacent in memory (so
that they can be merged later).

4.  Binary buddy system
 Fibonacci buddy system
 Weighted buddy system
 Tertiary buddy system

13.  Less external fragmentation.
 Search for a block of the right size is cheaper
than, best fit
 Merging adjacent free blocks is easy.
 Cost to allocate and free a block of memory is
low compared to that of best-fit or first-fit
algorithms.

14.  Internal fragmentation.
 Unpredictable and inefficient.
 time required to fragment and coalesce blocks.

15. ThankYou!!!
Any Questions