Dynamic Partition Scheme Report
Dynamic Partition Scheme Report
For both fixed and dynamic memory allocation schemes, the operating system must keep lists of each
memory location noting which are free and which are busy. Then as new jobs come into the system, the
free partitions must be allocated.
The first-fit method keeps the free/busy lists organized by memory locations, low-order memory to
high-order memory.
The best-fit allocation method keeps the free/busy lists in order by size, smallest to largest.
Each has advantages depending on the needs of the particular allocation scheme— best-fit usually
makes the best use of memory space; first-fit is faster in making the allocation.
These partitions may be allocated on the basis of first-fit memory allocation (first partition fitting the
requirements) or best-fit memory allocation (least wasted space, the smallest partition fitting the
requirements). For both schemes, the Memory Manager organizes the memory lists of the free and used
partitions (free/busy) either by size or by location.