Placement algorithm - computer architecture:

Different strategies can be taken as to how space is allocated to processes:

• First fit: Allocate the first hole that is large enough. Searching may begin either at the starting of the set of holes or where the previous first-fit search ended.
• Best fit: Allocate the shortest hole that is large enough. The whole list of holes must be searched unless it is sorted by size. This strategy generated the smallest leftover hole.
• Worst fit: Allocate the biggest hole. On the contrary, this strategy aims to generate the largest leftover hole, which can be large enough to hold another process. Experiments have shown that first fit and best fit both are better than worst fit in terms of storage utilization and decreasing time