Chapter 8: Memory Management
Chapter 8: Memory Management
Chapter 8: Memory Management
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Example! Given free memory partitions of100K, 500K, 200K, 300K, and 600K(in order), how would each of theFirst-fit, Best-fit, and Worst-fitalgorithms place processes of 212K,417K, 112K, and 426K (in order)? " Which algorithm makes the mostefficient use of memory? "Operating System Concepts!8.24! Silberschatz, Galvin and Gagne ©2005!