What is the Best Fit Algorithm for Memory Partitions?

  • Thread starter Thread starter whitehorsey
  • Start date Start date
  • Tags Tags
    Fit partitions
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
2 replies · 2K views
whitehorsey
Messages
188
Reaction score
0
1. If you had 10, 50, 20, 30, and 60 KB in order and wanted to work with these incoming processes 21, 47, 5, 45 KB find the best fit.


3. I know how to do 21 and 5 but for 47 and 45 I'm confused. Best fit says to produce the smallest left over hole. So, would I put 47 in 60 because it's smaller than 45 in 60?
(21 would go into 30 and 5 would go into 10)
 
Physics news on Phys.org
Best fit operates on the incoming processes one at at time, in the incoming order. There's no look ahead involved. For each process, best fit means to choose the smallest memory partition that the process will fit into.
 
rcgldr said:
Best fit operates on the incoming processes one at at time, in the incoming order. There's no look ahead involved. For each process, best fit means to choose the smallest memory partition that the process will fit into.

Thank You!