1 / 9

Memory Hierarchy

Memory Hierarchy. CPS 5401 Fall 2013 http://svmoore.pbworks.com/ 1 Shirley Moore, Instructor October 10 Class. Learning Outcomes. After completing this lesson, you will be able to: Describe how memory references are processed by the hardware and the operating system.

hada
Download Presentation

Memory Hierarchy

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Memory Hierarchy CPS 5401 Fall 2013 http://svmoore.pbworks.com/1 Shirley Moore, Instructor October 10 Class

  2. Learning Outcomes • After completing this lesson, you will be able to: • Describe how memory references are processed by the hardware and the operating system. • Calculate how memory blocks are mapped to cache locations. • Discuss implications of memory system design for application performance. • Evaluate ways to change a program to improve use of the cache and memory system.

  3. Processing of Memory References

  4. Virtual Memory • Each process’s address space is partitioned in to fixed size pages (e.g., 4Kbytes). • Pages are loaded from secondary storage (i.e., disk) into memory as needed. • The memory manager keeps track of all pages currently loaded by means of a page table. • A page fault occurs when a process requests a page that is not currently loaded into main memory. • When a page fault occurs and the main memory is full, the memory manager has to decide which page to evict to make room for the new page. • An approximation to Least Recently Used (LRU) is usually used. • A translation lookaside buffer (TLB) is a cache for the page table. • A TLB miss occurs if the desired mapping is not in the TLB.

  5. Simplified Memory Hierarchy

  6. Cache Associativity • Direct mapped • Fully associative • Set-associative • See http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_place.html • Try it! http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_place_applet.html

  7. Block Identification • http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_ident.html • http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_ident_applet.html

  8. Block Replacement • http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_replace.html

  9. Interaction between Cache and Memory • http://www.cs.iastate.edu/~prabhu/Tutorial/CACHE/interac.html

More Related