Memory Placement Strategies
• Strategies to place new incoming processes
• Best-fit strategy
• Process placed in hole that leaves least unused space around it
• More execution-time overhead
• First-fit strategy
• Process placed in first hole of sufficient size found
• Simple, low execution-time overhead
• Not so efficient
• Next-fit strategy
• Same as First-fit but begin the search from location of the previous placement.
• Worst-fit strategy
• Process placed in hole that leaves most unused space around it
• Leaves another large hole, making it more likely that another process can fit in the hole
• Requires defragmentation