Placement Algorithms for Dynamic Partitioning
First-fit and next-fit can allocate faster than best-fit and worst-fit (no need to scan the complete list).
First-fit favors allocation near the beginning and tends to create less fragmentation then next-fit.
Worst-fit is the worst method both in terms of fragmentation and in allocation speed.
There is no clear winner between first-fit and best-fit in terms of external fragmentation.
How do we know all that? Usually, by running simulations. But this may have a problem - what are the base assumptions?