1 Virtual Memory Main memory can act as a cache for the secondary storage (disk) Advantages: –illusion of having more physical memory –program relocation –protection Virtual addressPhysical address

2 Q1: Where can a page be placed in main memory. A1: Anywhere with minor restrictions. This means that the placement is fully associative. Recall that a fully associative cache is the most desirable; however, it is also the most difficult to implement. The ratio of miss to hit times for cache is less that 10. For virtual memory it is probably grater than 10,000. Hence, the placement scheme can be implemented by the operating system and can be more complex than a fast hardware placement scheme. Q2: How is data found? A2: Virtual address is translated to a Physical address. Q3: Which page should be replaced? A3: LRU Q4: What happens on a write? A4: Write back (Virtual page is updated only when page in physical memory is replaced). Write through is too expensive in time since this would involve updating page in both physical and virtual memory.

3 Pages: virtual memory blocks Page faults: the data is not in memory, retrieve it from disk –huge miss penalty, thus pages should be fairly large (e.g., 4KB) –reducing page faults is important (LRU is worth the price) –can handle the faults in software instead of hardware –using write-through is too expensive so we use writeback Page size = 2 12 = 4 KB, Number of pages in memory = = 2 18  250K. 4K x 250K  1 GB Virtual address space = 2 32 = 4 GB

4 Page Tables Virtual page #

5 Page Tables Register in processor. Page table in main memory. Physical address

6 Example: Let page size be 4K bytes i.e. 12 bits of address. Let the virtual and physical address be 32 bits /2 12 = 2 20 pages. 32 bits or 4 bytes would be used in each page entry (but not all bits are needed). Therefore, 2 22 bytes of main memory would be required for the page table! Let’s look at one of the ways Intel addressed this problem.

7  One of the many modes available in the Intel IA-32 architecture pages or 2 32 = 4 Gbytes. Can be extended to support 36-bit address.  The Directory Entry and Page-Table Entry are 32 bits = 4 bytes. o Only the upper 20 bits are required to specify the page address. o The lower 12 bits are available for statistical control information. Such as  Present – Page is present. Same as our Valid bit.  Dirty – Indicating that the page has been written to and will have to be written back to disk.  Accessed – Indicating that the page has been accessed. The operating system will occasionally read and reset these bits to gather information to determine which pages should be used for replacement. etc. Note that Page directory and each page table are also pages. Unused pages can reside on hard disk. 4 KB

8 Making Address Translation Fast A cache for address translations: translation lookaside buffer  The TLB is a special cache (internal to the processor).  Stores recent virtual to physical address translations.  Holds only page table mappings.  Tag part contains high bits of virtual address. Data part contains high order physical address bits to specify page physical address

9

10 TLBs and caches

11 Modern Systems Very complicated memory systems:

12

13

14

15 Processor speeds continue to increase very fast — much faster than either DRAM or disk access times Design challenge: dealing with this growing disparity Trends: –synchronous SRAMs (provide a burst of data) –redesign DRAM chips to provide higher bandwidth or processing –restructure code to increase locality –use prefetching (make cache visible to ISA) Some Issues