virtual memory 4
play

virtual memory 4 1 Zoom logistics recommend: exit full screen - PowerPoint PPT Presentation

Feb 05, 2023 •275 likes •1.7k views

virtual memory 4 1 Zoom logistics recommend: exit full screen open chat + participants window participants window has non-verbal feedback features I will try to monitor the chat window I can take questions via raise hand + turn on your

  1. least recently used (the good case) 3 choose to replace A D last accessed in 2 time units ago B last accessed in 1 time unit ago A last accessed in 3 time units ago choose to replace C C last accessed 3 time units ago B last accessed 1 time unit ago A last accessed 2 time units ago time referenced (virtual) pages: page# phys. D C B A 2 C A 1 B C B D A D B A C B 23

  2. least recently used (the good case) 3 choose to replace A D last accessed in 2 time units ago B last accessed in 1 time unit ago A last accessed in 3 time units ago choose to replace C C last accessed 3 time units ago B last accessed 1 time unit ago A last accessed 2 time units ago time referenced (virtual) pages: page# phys. D C B A 2 C A 1 B C B D A D B A C B 23

  3. least recently used (the good case) 3 choose to replace A D last accessed in 2 time units ago B last accessed in 1 time unit ago A last accessed in 3 time units ago choose to replace C C last accessed 3 time units ago B last accessed 1 time unit ago A last accessed 2 time units ago time referenced (virtual) pages: page# phys. D C B A 2 C A 1 B C B D A D B A C B 23

  4. least recently used (the good case) 3 choose to replace A D last accessed in 2 time units ago B last accessed in 1 time unit ago A last accessed in 3 time units ago choose to replace C C last accessed 3 time units ago B last accessed 1 time unit ago A last accessed 2 time units ago time referenced (virtual) pages: page# phys. D C B A 2 C A 1 B C B D A D B A C B 23

  5. least recently used (the good case) 3 choose to replace A D last accessed in 2 time units ago B last accessed in 1 time unit ago A last accessed in 3 time units ago choose to replace C C last accessed 3 time units ago B last accessed 1 time unit ago A last accessed 2 time units ago time referenced (virtual) pages: page# phys. D C B A 2 C A 1 B C B D A D B A C B 23

  6. least recently used (the worst case) A C B A phys. page# time 1 B C 2 B C 3 C D 8 replacements with LRU versus 3 replacements with MIN: 3 D A A B C D A B C D B A C 1 A D C B 2 B 24

  7. least recently used (the worst case) A C B A phys. page# time 1 B C 2 B C 3 C D 8 replacements with LRU versus 3 replacements with MIN: 3 D A A B C D A B C D B A C 1 A D C B 2 B 24

  8. least recently used (exercise) [intro] A B A D C B D B C D A 1 2 3 25

  9. least recently used (exercise) A D 3 B B B 2 A A A 1 A A D C B D B C D A B 26

  10. least recently used (exercise) (2) A D D 3 C B B B 2 A A A A A 1 A D C B D B C D A B 28

  11. least recently used (exercise) (3) C B B B C C C C C B 3 D D D D D D D 2 B A D B A D C B D B C A B 1 A A A A A B B 30

  12. least recently used (exercise) (4) C B B B C C C C C C A 3 D D D D D D D D 2 B A D B A D C B D B C A B 1 A A A A A B B B 32

  13. pure LRU implementation implementing LRU in software maintain doubly-linked list of all physical pages whenever a page is accessed: remove page from linked list, then add page to head of list whenever a page needs to replaced: remove a page from the tail of the linked list, then evict that page from all page tables (and anything else) and use that page for whatever needs to be loaded need to run code on every access probably 100+x slowdown? 33

  14. pure LRU implementation implementing LRU in software maintain doubly-linked list of all physical pages remove page from linked list, then add page to head of list whenever a page needs to replaced: remove a page from the tail of the linked list, then evict that page from all page tables (and anything else) and use that page for whatever needs to be loaded need to run code on every access probably 100+x slowdown? 33 whenever a page is accessed:

  15. so, what’s practical probably won’t implement LRU — too slow what can we practically do? 34

  16. tools for tracking accesses approximating LRU = “was this accessed recently”? don’t need to detect all accesses, only one recent one “was this accessed since we started looking a few seconds ago?” ways to detect accesses AKA references: mark page invalid, if page fault happens make valid and record ‘accessed/referenced’ ‘accessed’ or ‘referenced’ bit set by HW 35

  17. tools for tracking accesses approximating LRU = “was this accessed recently”? don’t need to detect all accesses, only one recent one “was this accessed since we started looking a few seconds ago?” ways to detect accesses AKA references: mark page invalid, if page fault happens make valid and record ‘accessed/referenced’ ‘accessed’ or ‘referenced’ bit set by HW 35

  18. tools for tracking accesses approximating LRU = “was this accessed recently”? don’t need to detect all accesses, only one recent one “was this accessed since we started looking a few seconds ago?” ways to detect accesses AKA references: mark page invalid, if page fault happens make valid and record ‘accessed/referenced’ ‘accessed’ or ‘referenced’ bit set by HW 35

  19. tools for tracking accesses approximating LRU = “was this accessed recently”? don’t need to detect all accesses, only one recent one “was this accessed since we started looking a few seconds ago?” ways to detect accesses AKA references: mark page invalid, if page fault happens make valid and record ‘accessed/referenced’ ‘accessed’ or ‘referenced’ bit set by HW 35

  20. recording accesses goal: “check is this physical page still being used?” software support: temporarily mark page table invalid use resulting page fault to detect “yes” hardware support: accessed bits in page tables hardware sets to 1 when accessed 36

  21. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 (never) … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 0 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  22. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 (never) … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 0 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  23. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 1 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  24. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 1 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  25. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 1 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  26. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 1 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  27. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 0 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  28. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time X … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 0 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  29. temporarily invalid PTE (software support) … … … … page table for program 1 PPN last known access? … … … … 0x04442 at time Y … … … … OS page info processor does lookup oops! page fault update page info + mark present processor does lookup no page fault, not recorded in OS info OS clears present bit to check for next access processor does lookup oops! page fault update page info + mark present … 0x4442 mov 0x123 456, %ecx … mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN present? PPN 0x00000 0 --- … … 0 1 0x00123 … … … … --- --- … --- 0 0x00001 37 writable? …

  30. accessed bit usage (hardware support) … … … … 0x00123 1 0 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  31. accessed bit usage (hardware support) … … … … 0x00123 1 0 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  32. accessed bit usage (hardware support) … … … … 0x00123 1 1 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  33. accessed bit usage (hardware support) … … … … 0x00123 1 1 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  34. accessed bit usage (hardware support) … … … … 0x00123 1 1 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  35. accessed bit usage (hardware support) … … … … 0x00123 1 1 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  36. accessed bit usage (hardware support) … … … … 0x00123 1 0 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  37. accessed bit usage (hardware support) … … … … 0x00123 1 0 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  38. accessed bit usage (hardware support) … … … … 0x00123 1 1 0 … 0x4442 … … … … … … page table for program 1 processor does lookup sets accessed bit to 1 processor does lookup keeps access bit set to 1 OS reads + records + clears access bit processor does lookup sets accessed bit to 1 (again) … … mov 0x123 456, %ecx present? mov 0x123 789, %ecx … … mov 0x123 300, %ecx program 1 … (OS exception’s handler) … the kernel VPN PPN --- 0x00000 0 --- --- … --- 0x00001 0 --- --- … 38 accessed? writable? …

  39. accessed bits: multiple processes --- … … … --- … --- 0 … 0x00001 --- … --- --- 0 … … PPN … for the physical page all accessed bits OS needs to clear+check page table for program 2 … … … 0x00483 … … 0x4442 … 0 1 1 0x00000 present? VPN --- --- … --- --- 0 0x00001 … … --- --- 0 0x00000 PPN present? … … … … VPN page table for program 1 … … … … … 0x4442 … 0 0 1 0x00123 … … 39 accessed? writable? … accessed? writable? …

  40. dirty bits “was this part of the mmap’d fjle changed?” “is the old swapped copy still up to date?” software support: temporarily mark read-only hardware support: dirty bit set by hardware same idea as accessed bit, but only changed on writes 40

  41. x86-32 accessed and dirty bit A: acccessed — processor sets to 1 when PTE used used = for read or write or execute likely implementation: part of loading PTE into TLB D: dirty — processor sets to 1 when PTE is used for write 41

  42. approximating LRU: second chance ordered list of physical pages ‘referenced’ bit set? “new” pages start at top of list yes, reset referenced bit and put back on list no, evict this page page made it to the bottom was it referenced in that time? yes — give a second chance page made it to the bottom was it referenced in that time? no — good choice to evict 42

  43. approximating LRU: second chance ordered list of physical pages ‘referenced’ bit set? “new” pages start at top of list yes, reset referenced bit and put back on list no, evict this page page made it to the bottom was it referenced in that time? yes — give a second chance page made it to the bottom was it referenced in that time? no — good choice to evict 42

  44. approximating LRU: second chance ordered list of physical pages ‘referenced’ bit set? “new” pages start at top of list yes, reset referenced bit and put back on list no, evict this page page made it to the bottom was it referenced in that time? yes — give a second chance page made it to the bottom was it referenced in that time? no — good choice to evict 42

  45. second chance example (0) becomes referenced 2R 2R 1R 1R place A in physical page 1 accessed right after place B in physical page 2 1R accessed right after becomes referenced future slides: going to skip writing these intermediate steps (just for space) 1R 43 A C B C 1 A 2 B 3 page list — *1R 2NR *2R 3NR *3R last added 3NR 1NR 2NR 3NR 3NR end of list 1NR 2NR 2NR 3NR 3NR

  46. second chance example (0) A (just for space) these intermediate steps going to skip writing future slides: becomes referenced accessed right after place B in physical page 2 place A in physical page 1 1R 1R 2R 2R 1R 1R 43 — 3 B C 1 A 2 B C *3R page list *1R 2NR *2R 3NR accessed right after → becomes referenced last added 3NR 1NR 2NR 3NR 3NR end of list 1NR 2NR 2NR 3NR 3NR

  47. second chance example (0) A (just for space) these intermediate steps going to skip writing future slides: place B in physical page 2 becomes referenced accessed right after place A in physical page 1 1R 1R 2R 2R 1R 1R 43 — 3 B C 1 A 2 B C *3R page list *1R 2NR *2R 3NR accessed right after → becomes referenced last added 3NR 1NR 2NR 3NR 3NR end of list 1NR 2NR 2NR 3NR 3NR

  48. second chance example (0) becomes referenced 2R 2R 1R 1R place A in physical page 1 accessed right after place B in physical page 2 1R accessed right after becomes referenced future slides: going to skip writing these intermediate steps (just for space) 1R 43 A C B C 1 A 2 B 3 page list — *1R 2NR *2R 3NR *3R last added 3NR 1NR 2NR 3NR 3NR end of list 1NR 2NR 2NR 3NR 3NR

  49. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  50. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  51. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  52. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  53. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  54. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  55. second chance example (1) not referenced on return from page fault handler 1R 2R 3R 1R 2R 3R 1NR 2NR *2R place A in page 1 immediately referenced by program when page fault handler returns A page 2 was at bottom of list is not referenced okay to use page 1 was at bottom of list reference — give second chance moves to top of list clear referenced bit eventually page 1 gets to bottom of list again but now not referenced — use B referenced — fmips referenced bit 3NR — 1R 2 B C D — — — B 1 A D B *1R 3 C C page list last added *1R *2R *3R 44 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  56. second chance example: exercise (1) 2R *3R *1R 1R — 3NR 1R 3R A 1R 2R 3R 1NR 2NR *2R exercise: What does this access to A replace? (D, B, or C?) what is at end of list after? (PP 1, 2, or 3?) *2R *1R last added page list B C D — — — B A 1 A D 2 B 3 C C 45 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  57. second chance example: exercise (2) 3R *3R *1R 1R 2NR *3R — 3NR 1R 2R 1R A 2NR 1R 2R 3R 1NR 2NR *2R 3NR 1R exercise: What does this access to C replace? (D, B, or A?) what is at end of list after? (PP 1, 2, or 3?) *2R *1R last added page list B C D — — — B A — C 1 46 A D ? 2 B ? 3 C C A ? 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  58. second chance example: exercise (2) 3R *3R *1R 1R 2NR *3R — 3NR 1R 2R 1R A 2NR 1R 2R 3R 1NR 2NR *2R 3NR 1R exercise: What does this access to C replace? (D, B, or A?) what is at end of list after? (PP 1, 2, or 3?) *2R *1R last added page list B C D — — — B A — C 1 46 A D ? 2 B ? 3 C C A ? 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  59. second chance example (2) 1R 1R 2NR *3R 1NR *2R — 3NR 1R 2R 3R 2NR A 3R 1NR 1R 2R 3R 1NR 2NR *2R 3NR 1R 2NR 3R *1R 48 *3R 1 B C D — — — B A — C — A *2R D 2 B C 3 C C A page list last added *1R 1NR 2NR 3NR 1NR 2NR 3NR 3NR end of list 2NR 3NR

  60. second chance cons performs poorly with big memories… may need to scan through lots of pages to fjnd unaccessed likely to count accesses from a long time ago want some variation to tune its sensitivity one idea: smaller list of pages to scan for accesses 49

  61. second chance cons performs poorly with big memories… may need to scan through lots of pages to fjnd unaccessed likely to count accesses from a long time ago want some variation to tune its sensitivity one idea: smaller list of pages to scan for accesses 49

  62. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  63. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  64. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  65. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  66. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  67. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  68. approximating LRU: SEQ know: not referenced ‘recently’ extra details needed: how big is the inactive list? this is current Linux algorithm for non-fjle pages or mark invalid + get fault scan reference bits detecting references? “new” pages start in active list evict page at bottom of inactive list active list move to active list not really inactive inactive page referenced? is really inactive page guess: oldest active page inactive list 50

  69. tracking usage: CLOCK (view 1) ordered list add to top of list clear reference bit for next pass record current referenced bit take page from bottom of list periodically: of physical pages page #3: last referenced bits: Y Y N… page #4: last referenced bits: Y Y Y… page #2: last referenced bits: N N N… page #1: last referenced bits: Y Y Y… page #8: last referenced bits: Y Y N… page #7: last referenced bits: Y N Y… page #6: last referenced bits: N Y Y… page #5: last referenced bits: N N N… 51

  70. tracking usage: CLOCK (view 2) last ref. bits: Y Y N… last ref. bits: Y Y N… page #8: last ref. bits: N N N… page #7: last ref. bits: Y Y Y… page #6: page #5: page #1: last ref. bits: Y N Y… page #4: last ref. bits: N Y Y… page #3: last ref. bits: N N N… page #2: last ref. bits: Y Y Y… 52

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated

Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated

Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated Virtual Memory Illustrated virtual physical backing executable memory memory file storage (big) (small) header text pageout/eviction text

480 views • 12 slides
Lecture 19: Virtual Memory Virtual Memory concept, Virtual- physical translation, page table,

Lecture 19: Virtual Memory Virtual Memory concept, Virtual- physical translation, page table,

Lecture 19: Virtual Memory Virtual Memory concept, Virtual- physical translation, page table, TLB, Alpha 21264 memory hierarchy 1 Adapted from UC Berkeley CS252 S01 Virtual Memory Virtual memory (VM) allows programs to have the illusion of a

711 views • 23 slides
Virtual Memory Questions? ! What is virtual memory and when is it useful? CSCI [4|6] 730 ! What is

Virtual Memory Questions? ! What is virtual memory and when is it useful? CSCI [4|6] 730 ! What is

Virtual Memory Questions? ! What is virtual memory and when is it useful? CSCI [4|6] 730 ! What is demand paging? Operating Systems ! What pages should be resident in memory, and which should be replaced? Virtual Memory ! What is the

231 views • 9 slides
Lecture 23: Virtual Memory, Multiprocessors Todays topics: Virtual memory

Lecture 23: Virtual Memory, Multiprocessors Todays topics: Virtual memory

Lecture 23: Virtual Memory, Multiprocessors Todays topics: Virtual memory Multiprocessors, cache coherence 1 Virtual Memory Processes deal with virtual memory they have the illusion that a very large address space is

388 views • 18 slides
Lecture 24: Virtual Memory, Multiprocessors Todays topics: Virtual memory

Lecture 24: Virtual Memory, Multiprocessors Todays topics: Virtual memory

Lecture 24: Virtual Memory, Multiprocessors Todays topics: Virtual memory Multiprocessors, cache coherence 1 Virtual Memory Processes deal with virtual memory they have the illusion that a very large address space is

573 views • 21 slides
Shared Memory OS Lecture 9 UdS/TUKL WS 2015 MPI-SWS 1 Review: Virtual Memory How is virtual

Shared Memory OS Lecture 9 UdS/TUKL WS 2015 MPI-SWS 1 Review: Virtual Memory How is virtual

Shared Memory OS Lecture 9 UdS/TUKL WS 2015 MPI-SWS 1 Review: Virtual Memory How is virtual memory realized? 1. Segmentation : linear virtual physical address translation with base & bounds registers 2. Paging : arbitrary virtual

733 views • 30 slides
Virtual Memory Virtual Memory - The games we play with addresses and the memory behind them

Virtual Memory Virtual Memory - The games we play with addresses and the memory behind them

Virtual Memory Virtual Memory - The games we play with addresses and the memory behind them Address translation - decouple the names of memory locations and their physical locations - arrays that have space to grow without pre-allocating

671 views • 21 slides
Virtual Memory Questions? What is virtual memory and when is it useful? CSCI [4|6] 730

Virtual Memory Questions? What is virtual memory and when is it useful? CSCI [4|6] 730

Virtual Memory Questions? What is virtual memory and when is it useful? CSCI [4|6] 730 What is demand paging? What pages should : Operating Systems Persist in memory, and and which should be replaced ? What is trashing and

986 views • 14 slides
Virtual Memory: Demand Paging and Replacment Virtual Memory Illustrated virtual physical

Virtual Memory: Demand Paging and Replacment Virtual Memory Illustrated virtual physical

Virtual Memory: Demand Paging and Replacment Virtual Memory Illustrated virtual physical backing executable memory memory storage file (big) (small) header text pageout/eviction text data data idata data BSS wdata symbol user

356 views • 17 slides
Lecture 21: Virtual Memory, I/O Basics Todays topics: Virtual memory I/O overview

Lecture 21: Virtual Memory, I/O Basics Todays topics: Virtual memory I/O overview

Lecture 21: Virtual Memory, I/O Basics Todays topics: Virtual memory I/O overview Reminder: Assignment 8 due Tue 11/21 1 Virtual Memory Processes deal with virtual memory they have the illusion that a very large

416 views • 16 slides
Virtual Memory Goals for Today Virtual memory Mechanism Mechanism How does it

Virtual Memory Goals for Today Virtual memory Mechanism Mechanism How does it

Virtual Memory Goals for Today Virtual memory Mechanism Mechanism How does it work? Policy What to replace? How much to fetch? 2 What is virtual memory? Each process has illusion of large address space

569 views • 31 slides
Last class: Virtual Memory Today: Virtual Memory Uses Efficient Use of Physical

Last class: Virtual Memory Today: Virtual Memory Uses Efficient Use of Physical

Last class: Virtual Memory Today: Virtual Memory Uses Efficient Use of Physical Memory Through virtual memory N 2 32 -sized address spaces All isolated by default Uses for memory Make a new process Address

516 views • 22 slides
Virtual Memory Logical address space can therefore be much larger than physical address

Virtual Memory Logical address space can therefore be much larger than physical address

CSC 4103 - Operating Systems Background Spring 2007 Virtual memory separation of user logical memory from physical memory. Only part of the program needs to be in memory for Lecture - XIII execution. Virtual Memory Logical

309 views • 7 slides
Last class: Paging Today: Virtual Memory Virtual Memory What if programs

Last class: Paging Today: Virtual Memory Virtual Memory What if programs

Last class: Paging Today: Virtual Memory Virtual Memory What if programs require more memory than available physical memory? Use overlays Difficult to program though! Virtual Memory. Supports programs that are

703 views • 39 slides
Chapter 9: Virtual Memory Chapter 9: Virtual Memory Background Demand Paging

Chapter 9: Virtual Memory Chapter 9: Virtual Memory Background Demand Paging

Chapter 9: Virtual Memory Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other

1.44k views • 78 slides
LECTURE 12 Virtual Memory VIRTUAL MEMORY Just as a cache can provide fast, easy access to

LECTURE 12 Virtual Memory VIRTUAL MEMORY Just as a cache can provide fast, easy access to

LECTURE 12 Virtual Memory VIRTUAL MEMORY Just as a cache can provide fast, easy access to recently-used code and data, main memory acts as a cache for magnetic disk. The mechanism by which this is accomplished is known as virtual memory

974 views • 34 slides
External Sort Database Systems: The Complete Book Ch. 15.4 1 Operator Memory Needed Project

External Sort Database Systems: The Complete Book Ch. 15.4 1 Operator Memory Needed Project

External Sort Database Systems: The Complete Book Ch. 15.4 1 Operator Memory Needed Project O(1) Select O(1) Bag Union O(1) Join O(1) or O( |R|+|S| ) Group O( |G| ) Distinct O( |R| ) Sort O( |R| ) 2 You can get away with almost

235 views • 20 slides
Page Replacement (2) Summer 2016 Cornell University Today Algorithm that approximates the

Page Replacement (2) Summer 2016 Cornell University Today Algorithm that approximates the

CS 4410 Operating Systems Page Replacement (2) Summer 2016 Cornell University Today Algorithm that approximates the OPT replacement algorithm. 2 Least Recently Used (LRU) Page Replacement A recently used page is likely to be used

218 views • 21 slides
A Well-Oiled Content Deployment Machine James McBryan Drupal 5+ years Enterprise

A Well-Oiled Content Deployment Machine James McBryan Drupal 5+ years Enterprise

A Well-Oiled Content Deployment Machine James McBryan Drupal 5+ years Enterprise Drupal Consultant San Francisco Bay Area Ran a 6 person agency Started 3 tech startups, 2 failed Started 1 dance venue What is Content

784 views • 52 slides
Project Presentations, C Kickoff Rose-Hulman Institute of Technology Computer Science and

Project Presentations, C Kickoff Rose-Hulman Institute of Technology Computer Science and

Project Presentations, C Kickoff Rose-Hulman Institute of Technology Computer Science and Software Engineering Todays Plan Hand in take-home quizzes (questions about the first two videos) Project presentations Exam 2 Review

424 views • 7 slides
Laplace Transforms Circuit Analysis Example 1: Circuit Analysis We can use the Laplace transform

Laplace Transforms Circuit Analysis Example 1: Circuit Analysis We can use the Laplace transform

Laplace Transforms Circuit Analysis Example 1: Circuit Analysis We can use the Laplace transform for circuit analysis if we can define Passive element equivalents the circuit behavior in terms of a linear ODE. Review of ECE 221 methods in

305 views • 12 slides
Workflow Initiative Dick Olsson | @dickolsson | dixon_ #DrupalDeploy Agenda Background &

Workflow Initiative Dick Olsson | @dickolsson | dixon_ #DrupalDeploy Agenda Background &

Workflow Initiative Dick Olsson | @dickolsson | dixon_ #DrupalDeploy Agenda Background & goals Plan overview Lessons learned More details Q & A #DrupalDeploy Funded team Tim Millwood timmillwood Andrei

807 views • 33 slides
An IDE Whose Time Has Come Michael Lonski Allegro AllegroConsultants.com Why Im Talking

An IDE Whose Time Has Come Michael Lonski Allegro AllegroConsultants.com Why Im Talking

An IDE Whose Time Has Come Michael Lonski Allegro AllegroConsultants.com Why Im Talking Co-founder and President of Allegro Breaking Progress since 1986 (version 3) Author and international speaker President of VAPUG and

162 views • 15 slides
Configuration Space II Sung-Eui Yoon ( ) Course URL:

Configuration Space II Sung-Eui Yoon ( ) Course URL:

Configuration Space II Sung-Eui Yoon ( ) Course URL: http://sglab.kaist.ac.kr/~sungeui/MPA Class Objectives Configuration space Definitions and examples Obstacles Paths Metrics 2 Configuration Space

618 views • 30 slides

More recommend