Partitioning
- Each one requires more resources
Fixed partitioning
<aside>
π Dividing memory into non-overlapping sizes that are fixed
</aside>
- A process may be loaded into a partition of equal or greater size and is confined to its allocated position
- Small processes are loaded into the same partition as bigger processes, as all partitions are the SAME SIZE
- Internal fragmentation - the unoccupied space
- Results in occupied partitions with lots of unoccupied space
Variable partitioning
<aside>
π Dividing memory into non-overlapping BUT variable sizes
</aside>
- Matching the size with the space that we have got, thus small processes are allocated to small partitions and large processes allocated to larger partitions
Dynamic partitioning
<aside>
π Making partitions during run-time according to processβs need instead of partitioning during system configuration
</aside>
- Problem: requires more resources, RAM etc.
Buffering
<aside>
π The temporary storage of data during input, output or internal transfer of data in a computer system
</aside>
Single buffering
- A buffer - a small block of memory in decides where the current data is being held
- Another way of managing the CPU - i.e. when something is sent to print, the data goes to the buffer in the printer so that it can be held until the printer is ready, freeing up the CPU