537 beyond physical memory
play

[537] Beyond Physical Memory Chapters 21-22 Tyler Harter 9/29/14 - PowerPoint PPT Presentation

May 27, 2023 •173 likes •1.12k views

[537] Beyond Physical Memory Chapters 21-22 Tyler Harter 9/29/14 Problem 1: PT Size page directory PFN: 0101 PFN: 0110 PFN:1111 PFN valid PFN valid PFN valid PFN valid 0101 1 0000 1 1001 1

  1. [537] Beyond Physical Memory Chapters 21-22 Tyler Harter 9/29/14

  2. Problem 1: PT Size

  3. page directory PFN: 0101 PFN: 0110 PFN:1111 PFN 
 valid 
 PFN 
 valid 
 PFN 
 valid 
 PFN 
 valid 
 0101 
 1 
 0000 
 1 
 1001 
 1 
 - 
 0 
 1111 
 1 
 1010 
 1 
 - 
 0 
 - 
 0 
 - 
 0 
 - 
 0 
 - 
 0 
 - 
 0 
 0110 1 
 - 
 0 
 - 
 0 
 1011 
 1 
 Problem 2 (worksheet) � assume 12-bit 
 virtual addrs

  4. Virtual Memory code data Program �

  5. Virtual Memory create code code 
 data data Program � heap � � � � � � � � � � � � stack Process 1

  6. Virtual Memory create code code 
 data data Program � heap � � � � � � � � � � � � stack Process 1 what’s in code?

  7. 
 Virtual Memory create � LibA LibB LibA LibB � � LibC Prog � LibC Prog � data data heap Program � � � � � � � � � stack Process 1 many large libraries, some of which are rarely/never used

  8. How to avoid wasting physical pages to back rarely used virtual pages?

  9. 
 Virtual Memory LibA LibB � � LibA LibB LibC Prog � data LibC Prog � heap � data � � � Program � � � � � � Phys Memory stack Process 1 LibC Prog

  10. 
 Virtual Memory LibA LibB � � LibA LibB LibC Prog � data LibC Prog � heap � data � � � Program � � � � � � Phys Memory stack Process 1 LibC Prog

  11. 
 Virtual Memory LibA LibB � � LibA LibB LibC Prog � access LibB data LibC Prog � heap � data � � � Program � � � � � � Phys Memory stack Process 1 LibC Prog

  12. 
 Virtual Memory LibA LibB � copy (or move) � LibA LibB LibC Prog � data to RAM LibC Prog � heap � data � � � Program � � � � � � Phys Memory stack Process 1 LibC Prog LibB

  13. 
 Virtual Memory LibA LibB � called “ swapping ” � LibA LibB LibC Prog � or “ paging ” in data LibC Prog � heap � data � � � Program � � � � � � Phys Memory stack Process 1 LibC Prog LibB

  14. How to know where a page lives?

  15. Present Bit PFN valid prot 10 1 r-x - 0 - 23 1 rw- - 0 - - 0 - - 0 - - 0 - - 0 - - 0 - - 0 - - 0 - - 0 - 28 1 rw- 4 1 rw-

  16. Present Bit PFN valid prot present 10 1 r-x 1 - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - - 0 - - - 0 - - - 0 - - - 0 - - 28 1 rw- 0 4 1 rw- 1

  17. Present Bit Disk PFN valid prot present 10 1 r-x 1 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - 28 1 rw- 0 4 1 rw- 1

  18. Present Bit Disk PFN valid prot present 10 1 r-x 1 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 28 1 rw- 0 4 1 rw- 1

  19. Present Bit Disk PFN valid prot present 10 1 r-x 1 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 15 1 rw- 1 4 1 rw- 1

  20. What if no RAM is left?

  21. Present Bit Disk PFN valid prot present 10 1 r-x 1 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - FULL - 0 - - 28 1 rw- 0 4 1 rw- 1

  22. Present Bit Disk PFN valid prot present 10 1 r-x 1 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - FULL - 0 - - access 28 1 rw- 0 4 1 rw- 1

  23. Present Bit Disk PFN valid prot present 10 1 r-x 1 evict � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - FULL - 0 - - access 28 1 rw- 0 4 1 rw- 1

  24. Present Bit Disk PFN valid prot present 25 1 r-x 0 evict � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 28 1 rw- 0 4 1 rw- 1

  25. Present Bit called “ swapping ” or “ paging ” out Disk PFN valid prot present 25 1 r-x 0 evict � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 28 1 rw- 0 4 1 rw- 1

  26. Present Bit Disk PFN valid prot present 25 1 r-x 0 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 28 1 rw- 0 4 1 rw- 1

  27. Present Bit Disk PFN valid prot present 25 1 r-x 0 � - 0 - - 23 1 rw- 0 - 0 - - - 0 - - - 0 - - - 0 - - Phys Memory - 0 - - - 0 - - - 0 - - - 0 - - access 10 1 rw- 1 4 1 rw- 1

  28. Why not leave page on disk?

  29. Performance: RAM vs. Disk How long does it take to access a 4-byte int ? RAM: 5ns to 40ns per int (depending on TLB hit) Disk: 15ms per int

  30. Performance: RAM vs. Disk How long does it take to access a 4-byte int ? RAM: 5ns to 40ns per int (depending on TLB hit) Disk: 15ms per int 
 - because of high fixed costs 
 - reading 4KB of ints: 15us per int 
 - reading many megabytes of ints: 30ns per int

  31. Average Memory Access Time (AMAT) Hit % = portion of accesses that go straight to RAM Miss % = portion of accesses that go to disk first T m = time for memory access T d = time for disk access � AMAT = (Hit % * T m ) + (Miss % * T d ) �

  32. Average Memory Access Time (AMAT) Hit % = portion of accesses that go straight to RAM Miss % = portion of accesses that go to disk first T m = time for memory access T d = time for disk access � AMAT = (Hit % * T m ) + (Miss % * T d ) � Problem 3

  33. Who should do swapping? H/W or OS ?

  34. H/W CPU: A A A B Disk: A A 0 20 40 60 80

  35. OS CPU: A B A B A B Disk: A A 0 20 40 60 80

  36. OS CPU: A B A B A B Disk: A A 0 20 40 60 80 context switch to other process while swapping in

  37. 
 Translation Steps H/W: for each mem reference: 
 extract VPN from VA 
 check TLB for VPN 
 TLB hit: 
 build PA from PFN and offset 
 fetch PA from memory 
 TLB miss: 
 fetch PTE 
 if (!valid) : exception [segfault] 
 else if (!present) : exception [page fault, or page miss] 
 else : extract PFN , insert in TLB , retry

  38. 
 Translation Steps H/W: for each mem reference: 
 which steps are extract VPN from VA 
 expensive? check TLB for VPN 
 TLB hit: 
 build PA from PFN and offset 
 fetch PA from memory 
 TLB miss: 
 fetch PTE 
 if (!valid) : exception [segfault] 
 else if (!present) : exception [page fault, or page miss] 
 else : extract PFN , insert in TLB , retry

  39. 
 Translation Steps H/W: for each mem reference: 
 which steps are extract VPN from VA 
 (cheap) expensive? check TLB for VPN 
 (cheap) TLB hit: 
 build PA from PFN and offset 
 (cheap) fetch PA from memory 
 (expensive) TLB miss: 
 fetch PTE 
 (expensive) if (!valid) : exception [segfault] 
 (expensive) else if (!present) : exception [page fault, or page miss] 
 (expensive) else : extract PFN , insert in TLB , retry (cheap)

  40. 
 Translation Steps H/W: for each mem reference: 
 which steps are extract VPN from VA 
 (cheap) expensive? check TLB for VPN 
 (cheap) TLB hit: 
 build PA from PFN and offset 
 (cheap) fetch PA from memory 
 (expensive) TLB miss: 
 fetch PTE 
 (expensive) if (!valid) : exception [segfault] 
 (expensive) else if (!present) : exception [page fault, or page miss] 
 (expensive) else : extract PFN , insert in TLB , retry (cheap)

  41. Page-Fault Handler (OS) PFN = FindFreePage() 
 if ( PFN == -1) 
 PFN = EvictPage() 
 DiskRead( PTE .DiskAddr, PFN ) 
 PTE .present = 1 
 PTE . PFN = PFN 
 retry instruction

  42. Page-Fault Handler (OS) which steps are PFN = FindFreePage() 
 expensive? if ( PFN == -1) 
 PFN = EvictPage() 
 DiskRead( PTE .DiskAddr, PFN ) 
 PTE .present = 1 
 PTE . PFN = PFN 
 retry instruction

  43. Page-Fault Handler (OS) which steps are PFN = FindFreePage() 
 (cheap) expensive? if ( PFN == -1) 
 (cheap) PFN = EvictPage() 
 (depends) DiskRead( PTE .DiskAddr, PFN ) 
 (expensive) PTE .present = 1 
 (cheap) PTE . PFN = PFN 
 (cheap) retry instruction (cheap)

  44. Page-Fault Handler (OS) PFN = FindFreePage() 
 (cheap) if ( PFN == -1) 
 (cheap) PFN = EvictPage() 
 what to evict? 
 (depends) what to read? DiskRead( PTE .DiskAddr, PFN ) 
 (expensive) (policy) PTE .present = 1 
 (cheap) PTE . PFN = PFN 
 (cheap) retry instruction (cheap)

  45. Caching Policy Workload : series of loads/stores to virtual pages Cache : chooses what to prefetch/evict Metric : hit rate, AMAT Cache “algebra”, given 2 variables, find the 3rd: f( W , C ) = M

Recommend

Virtual Memory Programmer can assume he/she has infinite amount of physical memory

Virtual Memory Programmer can assume he/she has infinite amount of physical memory

4/27/17 Virtual Memory Idea: Give the programmer the illusion of a large address space while having a small physical memory So that the programmer does not worry about managing physical memory Virtual Memory Programmer can assume

817 views • 12 slides
A Few Problems with Physical Addressing Main memory 0: 1: Physical address 2: Virtual Memory

A Few Problems with Physical Addressing Main memory 0: 1: Physical address 2: Virtual Memory

A Few Problems with Physical Addressing Main memory 0: 1: Physical address 2: Virtual Memory 3: (PA) CPU 4: 4 5: Process Abstraction, Part 2: Private Address Space 6: 7: 8: ... M-1: Motivation : why not direct physical memory

376 views • 6 slides
lecture 16 virtual vs. physical memory - types of physical memory - paging Wed. March 9,

lecture 16 virtual vs. physical memory - types of physical memory - paging Wed. March 9,

lecture 16 virtual vs. physical memory - types of physical memory - paging Wed. March 9, 2016 MIPS Memory next three lectures virtual address physical address 514 - 398 - 3740 cell tower

311 views • 27 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: Memory Management Allocating memory to processes Limited physical memory,

Last Class: Memory Management Allocating memory to processes Limited physical memory,

Last Class: Memory Management Allocating memory to processes Limited physical memory, internal and external fragmentation Paging and segmentation Address translation, efficiency Hardware support (e.g., TLB) Page

513 views • 13 slides
MIPS Memory lecture 16 virtual address physical address

MIPS Memory lecture 16 virtual address physical address

MIPS Memory lecture 16 virtual address physical address virtual vs. physical memory 514 - 398 - 3740 - types of physical memory - paging Wed. March 9, 2016 next three lectures cell tower

460 views • 3 slides
Virtual Memory Concept A mechanism for hiding the details of how much physical memory exists

Virtual Memory Concept A mechanism for hiding the details of how much physical memory exists

1 2 Virtual Memory Concept A mechanism for hiding the details of how much physical memory exists and how its being shared Allows the OS to EE 457 Unit 7c Efficiently share the physical memory between several _______ ___________

380 views • 11 slides
x (Actually, its smaller than that heap Process 3 What goes

x (Actually, its smaller than that heap Process 3 What goes

11/20/15 Virtual Memory Physical Addressing Motivation: why not direct physical memory access? Main memory Address translation with pages 0: 1: Optimizing translation: translation

431 views • 12 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
Memory and I/O buses I/O bus 1880Mbps 1056Mbps Memory CPU Crossbar CPU accesses physical

Memory and I/O buses I/O bus 1880Mbps 1056Mbps Memory CPU Crossbar CPU accesses physical

Memory and I/O buses I/O bus 1880Mbps 1056Mbps Memory CPU Crossbar CPU accesses physical memory over a bus Devices access memory over I/O bus with DMA Devices can appear to be a region of memory 1 / 41 Realistic ~2005 PC

1.54k views • 50 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
The hard work behind large physical memory allocations in the kernel Vlastimil Babka SUSE Labs

The hard work behind large physical memory allocations in the kernel Vlastimil Babka SUSE Labs

The hard work behind large physical memory allocations in the kernel Vlastimil Babka SUSE Labs vbabka@suse.cz Physical Memory Allocator Physical memory is divided into several zones 1+ zone per NUMA node Binary buddy allocator for

537 views • 51 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
Programmed I/O: isolated vs. memory-mapped When we discussed physical addresses of memory, we

Programmed I/O: isolated vs. memory-mapped When we discussed physical addresses of memory, we

COMP 273 20 - memory mapped I/O, polling, DMA Mar. 23, 2016 This lecture we will look at several methods for sending data between an I/O device and either main memory or the CPU. (Recall that we are considering the hard disk to be an I/O

171 views • 6 slides
Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign

Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign

4/12/2017 Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign physical memory to processes 5B. Simple Memory Allocation explicit requests: malloc (sbrk) implicit: program loading, stack

205 views • 8 slides
Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign

Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign

4/14/2018 Memory Management Memory Management 5A. Memory Management and Address Spaces 1. allocate/assign physical memory to processes 5B. Memory Allocation explicit requests: malloc (sbrk) implicit: program loading, stack extension

555 views • 9 slides
UMBC A B M A L T F O U M B C I M Y O R T 1 (12/8/04) I E S R C E O V U

UMBC A B M A L T F O U M B C I M Y O R T 1 (12/8/04) I E S R C E O V U

Advanced VLSI Design Memory CMPE 640 Memory Can be categorized into: Read Write Memory (RWM) Random Access Memory (RAM): static SRAM (faster) verses dynamic DRAM (smaller) structures possible. Access time independent of physical

381 views • 21 slides
EE 457 Unit 7d Virtual Memory 2 Virtual Memory Concept A mechanism for hiding the details of

EE 457 Unit 7d Virtual Memory 2 Virtual Memory Concept A mechanism for hiding the details of

1 EE 457 Unit 7d Virtual Memory 2 Virtual Memory Concept A mechanism for hiding the details of how much physical memory exists and how its being shared Allows the OS to Efficiently share the physical memory between several

821 views • 54 slides
Virtual Memory Separate the concept of: address space (name) from physical memory address

Virtual Memory Separate the concept of: address space (name) from physical memory address

Virtual Memory Separate the concept of: address space (name) from physical memory address (location) Most common example today: wireless (cell) phones Phone number is your id or name Location varies as you move Maintain a Map between name

208 views • 20 slides
Memory Management Address binding Linking, loading Logical vs. physical address

Memory Management Address binding Linking, loading Logical vs. physical address

CPSC 410 / 611 : Operating Systems Memory Management Address binding Linking, loading Logical vs. physical address space Memory partitioning Paging Segmentation Reading: Silberschatz, Chapter 8 Memory

469 views • 12 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
Swapping ! Active processes use more physical memory than system has Address Binding Swap out

Swapping ! Active processes use more physical memory than system has Address Binding Swap out

Swapping ! Active processes use more physical memory than system has Address Binding Swap out can be fixed P1 or relocatable Operating Systems I at runtime P2 Backing Store (Swap Space) OS Virtual Memory Main Memory Swapping

539 views • 8 slides
Operating Systems WT 2019/20 Memory Management Shared Memory Process 1 virtual memory most

Operating Systems WT 2019/20 Memory Management Shared Memory Process 1 virtual memory most

Operating Systems WT 2019/20 Memory Management Shared Memory Process 1 virtual memory most modern OSs provide a way for processes to share Physical memory memory compiler e.g. code pages for image executables Process 2 virtual

511 views • 29 slides
T3-Memory Index Memory management concepts Basic Services Program loading in

T3-Memory Index Memory management concepts Basic Services Program loading in

T3-Memory Index Memory management concepts Basic Services Program loading in memory Dynamic memory HW support To memory assignment To address translation Services to optimize physical memory usage COW

818 views • 56 slides

More recommend