Contiguous Allocation
Memory allocation and long-term scheduling
In general, there is at any time a set of holes, of various sizes, scattered throughout memory. When a process arrives and needs memory, we search this set for a hole that is large enough for this process. If the hole is too large it is split into two:
One part is allocated to the arriving process, the other is of memory, which is then placed back in the set of holes.This procedure is a particular instance of the general dynamic storage allocation problem which is hot to satisfy a request of size n from a list of free holes.