This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS-418 Operating Systems Professor: Van Horn Homework 4 1. Given the following memory configuration (with shaded areas assigned to running processes) 100 KB 500 KB 200 KB 300KB 600 KB Assume that arriving processes (in order) are 212KB, 417KB, 112KB, and 426KB Show how you would allocate memory to the arriving processes using the following allocation algorithms. a. First-fit b. Best Fit c. Worst fit d. For each algorithm, calculate the external fragmentation left at the end. e. Which allocation algorithm is best for this set of processes? Explain. 2. Consider a paging system with the page table stored in memory. a. If a memory reference takes 200 ns, how long does a paged memory reference take? b. If we add a TLB, and we get a hit ratio of 75%, what is the effective memory access time? (Assume that e (epsilon) is 0.) 3. Consider the following process, page table, and physical memory: Assume that the page and frame size are each 2KB. What are the physical addresses of these decimal logical addresses? a. b. 2048 50 - c. 3420 - ...
View Full Document
- Spring '12
- Operating Systems