Chap.7 Memory system.ppt

Chap.7 Memory system Jen-Chang Liu, Spring 2006 Big Ideas so far 15 weeks to learn big ideas in CSE Principle of abstraction, used to build systems as layers Pliable Data: a program determines what it is Stored program concept: instructions just data Greater performance by exploiting parallelism (pipeline) Principle of Locality, exploited via a memory hierarchy (cache) Principles/Pitfalls of Performance Measurement Five components of computer Input, output, memory, datapath, control Outline Introduction Basics of caches Measuring cache performance Set associative cache Multilevel cache Virtual memory Introduction Programmer’s view about memory Unlimited amount of fast memory How to create the above illusion? Principle of locality Program access a relatively small portion of their address space at any instant of time Temporal locality If an item is referenced, it will tend to be referenced again soon Spatial locality If an item is referenced, items whose address are close by will tend to be referenced soon Cost and performance of memory How to build a memory system from the above memory technologies? Memory hierarchy 記憶體階層 Operation in memory hierarchy Outline Introduction Basics of caches Measuring cache performance Set associative cache Multilevel cache Virtual memory Cache Cache: a safe place for hiding or storing things. Cache Memory hierarchy between CPU and main memory Any storage managed to take advantage of locality of access What does a cache do? Problem to design a cache Cache contains part of the data in memory of disk Q1: How do we know if a data item is in the cache? Direct mapped cache (Fig 7.5) Ex. (block address) modulo (no. of cache blocks in the cache) Direct mapped cache (cont.) Many memory words one location in cache Q: Which memory word in the cache? Use tag to identify Q: Whether the memory block is valid? Ex. Initially, the cache is empty Use valid bit to identify Cache access (Fig 7.7) Ex. Calculate bits in a cache How ma