1. Virtual Memory Review CSE 121 Spring 2003 Keith Marzullo

2. CSE 121 Spring 2003Review of Concurrency2 Virtual Memory API Most utilization of memory is automatic °Program and data allocation. °Stack management. Some are not °malloc or new routines. °memory mapped files. °shared memory segments.

3. CSE 121 Spring 2003Review of Concurrency3 Virtual memory NMAP physical address virtual address

4. CSE 121 Spring 2003Review of Concurrency4 Segmentation segment offsetbase addresslengthaccessbase addresslengthaccessbase addresslengthaccessbase addresslengthaccessbase addresslengthaccessbase addresslengthaccess  physical address if (offset > length) segment fault

5. CSE 121 Spring 2003Review of Concurrency5 Paging offset  physical address if (!valid) page fault page page framerefaccess dirty page framerefaccess dirty page framerefaccess dirty page framerefaccess dirty valid

6. CSE 121 Spring 2003Review of Concurrency6 IA-32 architecture (simplified) Linear Address Space Linear Address DirTableOffset Code Data Stack Task-State Segment (TSS) Code, Data or Stack Segment Global Descriptor Table (GDT) Segment Sel. TSS Seg. Sel. CR3 Physical Address Linear Address Segment Selector Linear Addr. Page DirectoryPage TablePage Page Dir. Entry Page Tbl. Entry Physical Addr.

7. CSE 121 Spring 2003Review of Concurrency7 SUN UltraSPARC III (simplified)

8. CSE 121 Spring 2003Review of Concurrency8 Demand Paging When a page fault occurs: °Find a free page frame. If none, then choose a page to evict. °Read page from backing store into this frame. °Assign page to this page frame. °Resume process. … which page should be evicted?

9. CSE 121 Spring 2003Review of Concurrency9 Page replacement policies FIFO Easy to implement, but poor performance. Optimal: evict page that will be next referenced farthest in the future. Need ability to predict the future. LRU: using the past to predict the future. Too high overhead. Clock: LRU approximation.

10. CSE 121 Spring 2003Review of Concurrency10 CLOCK Advance CLOCK hand Test and clear use-bit Schedule page for cleaning Replace page Use-bitDirty-bit set clear

11. CSE 121 Spring 2003Review of Concurrency11 Miss ratio for different policies

12. CSE 121 Spring 2003Review of Concurrency12 FIFO miss ratio (detail)

13. CSE 121 Spring 2003Review of Concurrency13 Working set The only reason that virtual memory works at all in practice is because of the amount of locality there is in address references. °The page fault penalty is  10 5 °If page faulted on only 1 out of ten references, then the program would run 10,000 times slower.

14. CSE 121 Spring 2003Review of Concurrency14 Working set, II Define the working set of a process's reference string  at time t for a window  to be the pages  t  t ...  t .  =  1; 2; 3; 4; 5; 4; 5; 4; 5; 4; 5 

15. CSE 121 Spring 2003Review of Concurrency15 Working set, III

16. CSE 121 Spring 2003Review of Concurrency16 Working set policy, I A process can run only if its working set is resident. Example: °UNIX can (temporarily) remove a process from the ready set if the page fault rate is too high. Choose a process that has been sleeping a long time. If none, then choose the longest resident of the four largest processes.

17. CSE 121 Spring 2003Review of Concurrency17 Working set policy, II One can modify CLOCK to approximate a working set policy. °Let PT be the current process time. °Each frame f is examined as usual. If the use bit set, then LR[f] = PT. If the use bit isn't set, then f is replaceable if PT  LR[f] > .