What are dynamic allocation algorithms?
Search for hole
- First-Fit: Take the first hole that is large enough
- Best-Fit: Find the smallest hole that is large enough
- Worst-Fit: Find the largest hole
Split hole: Space occupied & left over space
- Merge with adjacent hole if possible
- Move occupied partitions to create consolidate holes (Expensive operation)