You are on page 1of 1

In Heap-based memory allocation-Memory is allocated from a large poll of

unused memory. This pool is called the heap.

Heap Fragmentation: When the available memory is broken into small,


noncontiguous blocks, this is known as heap fragmentation. When heap fragmentation occurs, memory allocation may fail, even though there is sufficient memory in the heap to satisfy the request. This behavior occurs because no one block of memory is large enough to satisfy the allocation request. For programs that have low memory requirements, the standard heap is sufficient. Typically, heap fragmentation does not cause allocation failure. However, if the program allocates memory frequently, and if the program uses a variety of allocation sizes, memory allocation may fail because of heap fragmentation.

Contiguous
Immediately adjacent. For example, contiguous sectors on a disk are sectors that come one after the other. Frequently, a file stored on disk can become fragmented, which means that it is stored on non-contiguous sectors.

You might also like