What are dynamic allocation algorithms?

  1. 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
  2. Split hole: Space occupied & left over space

  3. Create space

  • Merge with adjacent hole if possible
  • Move occupied partitions to create consolidate holes (Expensive operation)