Dynamic Partitioning Placement Algorithms
One obvious question suggested by dynamic partitioning is "Where do we place
a new process" Three simple algorithms exist:
Memory Configuration Before and After Allocation of 16 Mbyte Block
- First-fit:
-
find the first unused block of memory that can contain the
process, searching from Address 0,
- Best-fit:
-
find the smallest unused block that can contain the process, or
- Next-fit:
-
remember where the last process's memory was allocated (say Address k),
and find the first unused block that can contain the process,
searching from Address k.
CITS2002 Systems Programming, Lecture 13, p7, 11th September 2023.
|
CITS2002