15 213 The course that gives CMU its Zip Virtual Memory Oct 29 2002 Topics class19 ppt Motivations for VM Address translation Accelerating translation with TLBs Motivations for Virtual Memory Use Physical DRAM as a Cache for the Disk Address space of a process can exceed physical memory size Sum of address spaces of multiple processes can exceed physical memory Simplify Memory Management Multiple processes resident in main memory Each process with its own address space Only active code and data is actually in memory Allocate more memory to process as needed Provide Protection One process can t interfere with another because they operate in different address spaces User process cannot access privileged information different sections of address spaces have different permissions 2 15 213 F 02 Motivation 1 DRAM a Cache for Disk Full address space is quite large 32 bit addresses 4 000 000 000 4 billion bytes 64 bit addresses 16 000 000 000 000 000 000 16 quintillion bytes Disk storage is 300X cheaper than DRAM storage 80 GB of DRAM 33 000 80 GB of disk 110 To access large amounts of data in a cost effective manner the bulk of the data must be stored on disk 4 MB 500 SRAM 3 1GB 200 DRAM 80 GB 110 Disk 15 213 F 02 Levels in Memory Hierarchy cache CPU CPU regs regs Register size speed Mbyte line size 32 B 1 ns 8B 8B C a c h e 32 B Cache 32 KB 4MB 2 ns 125 MB 32 B virtual memory Memory Memory Memory 1024 MB 30 ns 0 20 MB 4 KB 4 KB disk disk Disk Memory 100 GB 8 ms 0 001 MB larger slower cheaper 4 15 213 F 02 DRAM vs SRAM as a Cache DRAM vs disk is more extreme than SRAM vs DRAM Access latencies DRAM 10X slower than SRAM Disk 100 000X slower than DRAM Importance of exploiting spatial locality First byte is 100 000X slower than successive bytes on disk vs 4X improvement for page mode vs regular accesses to DRAM Bottom line Design decisions made for DRAM caches driven by enormous cost of misses SRAM 5 DRAM Disk 15 213 F 02 Impact of Properties on Design If DRAM was to be organized similar to an SRAM cache how would we set the following design parameters Line size Large since disk better at transferring large blocks Associativity High to mimimize miss rate Write through or write back Write back since can t afford to perform small writes to disk What would the impact of these choices be on miss rate Extremely low 1 hit time Must match cache DRAM performance miss latency Very high 20ms tag storage overhead Low relative to block size 6 15 213 F 02 Locating an Object in a Cache SRAM Cache Tag stored with cache line Maps from cache block to memory blocks From cached to uncached form Save a few bits by only storing tag No tag for block not in cache Hardware retrieves information can quickly match against multiple tags Object Name X X Tag Data 0 D 243 1 X J 17 105 N 1 7 Cache 15 213 F 02 Locating an Object in Cache cont DRAM Cache Each allocated page of virtual memory has entry in page table Mapping from virtual pages to physical pages From uncached form to cached form Page table entry even if page not in memory Specifies disk address Only way to indicate where to find page OS retrieves information Page Table Cache Location Data Object Name D 0 0 243 X J On Disk 1 17 105 8 X 1 N 1 15 213 F 02 A System with Physical Memory Only Examples most Cray machines early PCs nearly all embedded systems etc Memory Physical Addresses 0 1 CPU N 1 9 Addresses generated by the CPU correspond directly to bytes in physical memory 15 213 F 02 A System with Virtual Memory Examples Memory workstations servers modern PCs etc Virtual Addresses 0 1 Page Table 0 1 Physical Addresses CPU P 1 N 1 Disk Address Translation Hardware converts virtual addresses to physical addresses via OS managed lookup table page table 10 15 213 F 02 Page Faults like Cache Misses What if an object is on disk rather than in memory Page table entry indicates virtual address not in memory OS exception handler invoked to move data from disk into memory current process suspends others can resume OS has full control over placement etc Before fault Virtual Addresses Page Table Physical Addresses CPU Memory Page Table Virtual Addresses Physical Addresses CPU Disk 11 After fault Memory Disk 15 213 F 02 Servicing a Page Fault Processor Signals Controller Read block of length P starting at disk address X and store starting at memory address Y Read Occurs Direct Memory Access DMA Under control of I O controller I O Controller Signals Completion Interrupt processor OS resumes suspended process 12 1 Initiate Block Read Processor Processor Reg 3 Read Done Cache Cache Memory I O Memory I Obus bus 2 DMA Transfer I O I O controller controller Memory Memory disk Disk disk Disk 15 213 F 02 Motivation 2 Memory Management Multiple processes can reside in physical memory How do we resolve address conflicts what if two processes access something at the same address kernel virtual memory stack esp Memory mapped region forshared libraries Linux x86 process memory image 13 memory invisible to user code runtime heap via malloc 0 the brk ptr uninitialized data bss initialized data data program text text forbidden 15 213 F 02 Solution Separate Virt Addr Spaces Virtual and physical address spaces divided into equal sized blocks blocks are called pages both virtual and physical Each process has its own virtual address space operating system controls how virtual pages as assigned to physical memory Virtual Address Space for Process 1 Virtual Address Space for Process 2 14 0 Address Translation 0 VP 1 VP 2 PP 2 N 1 PP 7 0 VP 1 VP 2 N 1 Physical Address Space DRAM e g read only library code PP 10 M 1 15 213 F 02 Contrast Macintosh Memory Model MAC OS 1 9 Does not use traditional virtual memory P1 Pointer Table Process P1 Shared Address Space A B Handles Process P2 P2 Pointer Table C D E All program objects accessed through handles Indirect reference through pointer table Objects stored in shared global address space 15 15 213 F 02 Macintosh Memory Management Allocation Deallocation Similar to free list management of malloc free Compaction Can move any object and just update the unique pointer in pointer table P1 Pointer Table Shared Address Space B Process P1 A Handles P2 Pointer Table Process P2 C D 16 E 15 213 F 02 Mac vs VM Based Memory Mgmt Allocating deallocating and moving memory can be accomplished by both techniques Block sizes Mac variable sized may be very small or very large VM fixed size size is equal to one page 4KB on x86 Linux systems Allocating contiguous chunks
View Full Document
Unlocking...