Download to read offline
![Direct Mapping
Address Structure
Tag s-r Line or Slot r Word w
8 14 2
• 24 bit address
• 2 bit word identifier (4 byte block)
• 22 bit block identifier
— 8 bit tag (=22-14) [N.B. the no. of lines in the cache are 214=
16 K lines]
— 14 bit slot or line
• No two blocks in the same line have the same Tag field
• Check contents of cache by finding line and checking Tag](https://image.slidesharecdn.com/04cachememory-cust-240402031259-ed2be432/85/cache-memory-introduction-level-function-30-320.jpg)
![Set Associative Mapping Summary
• If number of sets (v) = number of lines
(m) [i.e. number of lines for each set
k=1], the set associative technique will
convert to direct mapping.
• If k=m, v=1 (set associative will be fully
associative)
• The most common choice (v=m/2 and
k=2).
• Four way set associative means (k= 4 and
v=v/4).](https://image.slidesharecdn.com/04cachememory-cust-240402031259-ed2be432/85/cache-memory-introduction-level-function-47-320.jpg)
![Direct Mapping
Address Structure
Tag s-r Line or Slot r Word w
8 14 2
• 24 bit address
• 2 bit word identifier (4 byte block)
• 22 bit block identifier
— 8 bit tag (=22-14) [N.B. the no. of lines in the cache are 214=
16 K lines]
— 14 bit slot or line
• No two blocks in the same line have the same Tag field
• Check contents of cache by finding line and checking Tag](https://image.slidesharecdn.com/04cachememory-cust-240402031259-ed2be432/75/cache-memory-introduction-level-function-30-2048.jpg)
![Set Associative Mapping Summary
• If number of sets (v) = number of lines
(m) [i.e. number of lines for each set
k=1], the set associative technique will
convert to direct mapping.
• If k=m, v=1 (set associative will be fully
associative)
• The most common choice (v=m/2 and
k=2).
• Four way set associative means (k= 4 and
v=v/4).](https://image.slidesharecdn.com/04cachememory-cust-240402031259-ed2be432/75/cache-memory-introduction-level-function-47-2048.jpg)
More Related Content
Similar to cache memory introduction, level, function
cache memory introduction, level, function
- 1. William Stallings Computer Organization andArchitecture 7th Edition Chapter 4 Cache Memory
- 2. Characteristics • Location • Capacity •Unit of transfer • Access method • Performance • Physical type • Physical characteristics • Organisation
- 3. Location • Whether thememory relative to CPU is —Internal: the main memory, registers and cache all are kind of internal memories —External: peripheral storage device such as disk and tape. They are accessible to CPU via device controller.
- 4. Capacity • Word size —For internal memory, this is expressed in bytes or words. The common word length is 8, 16, 32 or 64 bits —The word is the natural unit of organisation, and is equal to the number of bits to represent instruction (some times there is exceptions for that). • Number of words —or Bytes
- 5. Unit of Transfer •Internal —Usually governed by data bus width • External —Usually a block which is much larger than a word • Addressable unit —Smallest location which can be uniquely addressed —Word internally —Cluster on M$ disks
- 6. Access Methods (1) •Sequential —Start at the beginning and read through in order —Access time depends on location of data and previous location —e.g. tape • Direct —Individual blocks have unique address —Access is by jumping to vicinity plus sequential search —Access time depends on location and previous location —e.g. disk
- 7. Access Methods (2) •Random —Individual addresses identify locations exactly —Access time is independent of location or previous access —e.g. RAM • Associative —Data is located by a comparison with contents of a portion of the store —Access time is independent of location or previous access —e.g. cache
- 8. Memory Hierarchy • Registers —InCPU • Internal or Main memory —May include one or more levels of cache —“RAM” • External memory —Backing store
- 9. Memory Hierarchy -Diagram
- 10. Performance • Access time —Timebetween presenting the address and getting the valid data • Memory Cycle time —Time may be required for the memory to “recover” before next access. —This time allow transient of the line signal to die (damping), or to regenerate data if they read destructively. —Cycle time is access + recovery • Transfer Rate —Rate at which data can be moved
- 11. Physical Types • Semiconductor —RAM •Magnetic —Disk & Tape • Optical —CD & DVD • Others —Bubble —Hologram
- 12. Physical Characteristics • Decay •Volatility • Erasable • Power consumption
- 13. Organisation • Physical arrangementof bits into words • Not always obvious • e.g. interleaved
- 14. The Bottom Line •How much? —Capacity • How fast? —Time is money • How expensive?
- 15. Hierarchy List • Registers •L1 Cache • L2 Cache • Main memory • Disk cache • Disk • Optical • Tape
- 16. So you wantfast? • It is possible to build a computer which uses only static RAM (see later) • This would be very fast • This would need no cache —How can you cache cache? • This would cost a very large amount
- 17. Locality of Reference •During the course of the execution of a program, memory references tend to cluster • e.g. loops
- 18. Cache • Small amountof fast memory to improve the performance with cheap price. • Sits between normal main memory and CPU to keep part of the data and instructions in the main memory. • May be located on CPU chip or module
- 19. Cache • Hit: whenthe processor fetch word and find it in the cache, otherwise Miss occurs. • If miss occurs the block of the required word (consists of fixed number of words) is read from main memory and saved in the cache. • Because of the locality principle, it likely to find the next referenced data or instructions in the cache as result of binging the whole block rather than the required word.
- 20. Cache • Memory ofsize 2n will have n address lines. • The main memory is divided into blocks ,each block consists of k words (i.e. the number of blocks M = 2n/k . • The cache consists of lines C , each has the same size as block and C << M. • At any time the cache will holds some blocks which are involved with processor work at that time. • As the number of C is much less than the number of blocks, each line will have tag to indicate the block it holds.
- 21.
- 22. Cache operation –overview • CPU requests contents of memory location • Check cache for this data • If present, get from cache (fast) • If not present, read required block from main memory to cache • Then deliver from cache to CPU • Cache includes tags to identify which block of main memory is in each cache slot
- 23. Cache Read Operation- Flowchart
- 24. Cache Design • Size •Mapping Function • Replacement Algorithm • Write Policy • Block Size • Number of Caches
- 25. Size does matter •Cost —More cache is more expensive • Speed —More cache is faster (up to a point) —Checking cache for data takes time
- 26.
- 27. Comparison of CacheSizes Processor Type Year of Introduction L1 cachea L2 cache L3 cache IBM 360/85 Mainframe 1968 16 to 32 KB — — PDP-11/70 Minicomputer 1975 1 KB — — VAX 11/780 Minicomputer 1978 16 KB — — IBM 3033 Mainframe 1978 64 KB — — IBM 3090 Mainframe 1985 128 to 256 KB — — Intel 80486 PC 1989 8 KB — — Pentium PC 1993 8 KB/8 KB 256 to 512 KB — PowerPC 601 PC 1993 32 KB — — PowerPC 620 PC 1996 32 KB/32 KB — — PowerPC G4 PC/server 1999 32 KB/32 KB 256 KB to 1 MB 2 MB IBM S/390 G4 Mainframe 1997 32 KB 256 KB 2 MB IBM S/390 G6 Mainframe 1999 256 KB 8 MB — Pentium 4 PC/server 2000 8 KB/8 KB 256 KB — IBM SP High-end server/ supercomputer 2000 64 KB/32 KB 8 MB — CRAY MTAb Supercomputer 2000 8 KB 2 MB — Itanium PC/server 2001 16 KB/16 KB 96 KB 4 MB SGI Origin 2001 High-end server 2001 32 KB/32 KB 4 MB — Itanium 2 PC/server 2002 32 KB 256 KB 6 MB IBM POWER5 High-end server 2003 64 KB 1.9 MB 36 MB CRAY XD-1 Supercomputer 2004 64 KB/64 KB 1MB —
- 28. Mapping Function • Cacheof 64kByte • Cache block of 4 bytes —i.e. cache is 16k (214) lines of 4 bytes • 16MBytes main memory • 24 bit address —(224=16M)
- 29. Direct Mapping • Eachblock of main memory maps to only one cache line —i.e. if a block is in cache, it must be in one specific place • Address is in two parts • Least Significant w bits identify unique word (w depends on the block size) • Most Significant s bits specify one memory block • The MSBs are split into a cache line field r and a tag of s-r (most significant)
- 30. Direct Mapping Address Structure Tags-r Line or Slot r Word w 8 14 2 • 24 bit address • 2 bit word identifier (4 byte block) • 22 bit block identifier — 8 bit tag (=22-14) [N.B. the no. of lines in the cache are 214= 16 K lines] — 14 bit slot or line • No two blocks in the same line have the same Tag field • Check contents of cache by finding line and checking Tag
- 31. Direct Mapping Cache LineTable • Cache line Main Memory blocks held • 0 0, m, 2m, 3m…2s-m • 1 1,m+1, 2m+1…2s-m+1 • m-1 m-1, 2m-1,3m-1…2s-1
- 32. Direct Mapping CacheOrganization
- 33.
- 34. Direct Mapping Summary •Address length = (s + w) bits • Number of addressable units = 2s+w words or bytes • Block size = line size = 2w words or bytes • Number of blocks in main memory=2s+w/2w = 2s • Number of lines in cache = m = 2r • Size of tag = (s – r) bits
- 35. Direct Mapping pros& cons • Simple • Inexpensive • Fixed location for given block —If a program accesses 2 blocks that map to the same line repeatedly, cache misses are very high
- 36. Associative Mapping • Amain memory block can load into any line of cache • Memory address is interpreted as tag and word • Tag uniquely identifies block of memory • Every line’s tag is examined for a match • Cache searching gets expensive
- 37. Fully Associative CacheOrganization
- 38.
- 39. Tag 22 bit Word 2bit Associative Mapping Address Structure • 22 bit tag stored with each 32 bit block of data • Compare tag field with tag entry in cache to check for hit • Least significant 2 bits of address to identify which 8 bit byte number is required from 32 bit data block • e.g. —Address Tag Data Cache line —FFFFFC 3FFFFF 24682468 3FFF
- 40. Associative Mapping Summary •Address length = (s + w) bits • Number of addressable units = 2s+w words or bytes • Block size = line size = 2w words or bytes • Number of blocks in main memory = 2s+w/2w = 2s • Number of lines in cache = undetermined • Size of tag = s bits
- 41. Set Associative Mapping •Cache is divided into a number of sets • Each set contains a number of lines • A given block maps to any line in a given set —e.g. Block B can be in any line of set i • e.g. 2 lines per set —2 way associative mapping —A given block can be in one of 2 lines in only one set
- 42. Set Associative Mapping Example •13 bit set number • Block number in main memory is modulo 213 • 000000, 00A000, 00B000, 00C000 … map to same set
- 43. Two Way SetAssociative Cache Organization
- 44. Set Associative Mapping AddressStructure • Use set field to determine cache set to look in • Compare tag field to see if we have a hit • e.g —Address Tag Data Set number —1FF 7FFC 1FF 12345678 1FFF —001 7FFC 001 11223344 1FFF Tag 9 bit Set 13 bit Word 2 bit
- 45.
- 46. Set Associative MappingSummary • Address length = (s + w) bits • Number of addressable units = 2s+w words or bytes • Block size = line size = 2w words or bytes • Number of blocks in main memory = 2s • Number of lines in set = k • Number of sets = v = 2d • Number of lines in cache = kv = k * 2d • Size of tag = (s – d) bits
- 47. Set Associative MappingSummary • If number of sets (v) = number of lines (m) [i.e. number of lines for each set k=1], the set associative technique will convert to direct mapping. • If k=m, v=1 (set associative will be fully associative) • The most common choice (v=m/2 and k=2). • Four way set associative means (k= 4 and v=v/4).
- 48. Replacement Algorithms (1) Directmapping • No choice • Each block only maps to one line • Replace that line
- 49. Replacement Algorithms (2) Associative& Set Associative • Hardware implemented algorithm (speed) • Least Recently used (LRU): replace the line stayed in memory longest time with no reference. • e.g. in 2 way set associative —Which of the 2 block is LRU? (use bit) • First in first out (FIFO) ( —replace block that has been in cache longest and is implemented as R.R. • Least frequently used —replace block which has had fewest hits • Random (implemented using counter)
- 50. Write Policy • Acache line must not overwritten by a block unless main memory is up to date • Multiple CPUs may have individual caches • I/O may address main memory directly and it may cause inconsistency.
- 51. Write through • Allwrites go to main memory as well as cache • Multiple CPUs can monitor main memory traffic to keep local (to CPU) cache up to date • Lots of traffic • Slows down writes • Remember bogus write through caches!
- 52. Write back • Updatesinitially made in cache only • Update bit for cache slot is set when update occurs • If block is to be replaced, write to main memory only if update bit is set • Other caches get out of sync • I/O must access main memory through cache • N.B. 15% of memory references are writes
- 53. Cache Coherency Many devices(Normally CPU’s) have caches and all are sharing memory Solutions: • Bus watching with write through • Hardware transparency: in which special hardware is used to reflect any modification in cache to memory and all other caches. • Non cacheable memory: a portion in memory only is shared and this is not allowed to be cached. (i.e. all reference to this part is causing Miss). Hardware can identify the non cacheable memory (CS).
- 54. Pentium 4 Cache •80386 – no on chip cache • 80486 – 8k using 16 byte lines and four way set associative organization • Pentium (all versions) – two on chip L1 caches —Data & instructions • Pentium III – L3 cache added off chip • Pentium 4 —L1 caches – 8k bytes – 64 byte lines – four way set associative —L2 cache – Feeding both L1 caches – 256k – 128 byte lines – 8 way set associative —L3 cache on chip
- 55. Line Size As theblock size increases initially the hit ratio will increase until certain point at which the hit ratio is decreasing. • Larger block reduces the number of blocks that fit into cache contents. A small number of blocks results data to be written shortly after they are fetched. • Each additional word in large block will be less likely to be used.
- 56. Number of Caches •Single cache is found initially and with increasing chip density became available some space for on-chip cache. • The system benefits from that by reducing external bus activity (speeds up the execution time). • Because the bus of the on-chip cache is shorter than the system bus as result of few devices are connected to it, the on- chip bus is faster (less delay). • During this period of using on-chip cache the system bus will be avialable for other activities.
- 57. Is still theexternal cache desirable? • Shortly, the answer is yes and this organization is called two level cache. • Internal cache is L1 and the external cache is L2. • With no L2 cache (SRAM), in case of MISS the CPU has to access the RAM or ROM directly through the system bus (slow, and performance decreasing). • Many systems are using separate bus between L2 and the processor to reduce burden on the system bus. • The continuous shrinking of the processor components, many system place L2 on the processor chip (impoving the performance).
- 58. Unified against Splitcache • At start L1 cache is used for both of data and instruction. • Recently become common to split cache into one for data and the one for instructions. —Reason for modified cache are: —For specific size it will have higher Hit rate (as result of balancing data and instructions automatically). —Only one cache has to implemented and design.
- 59. Unified against Splitcache • Split caches, eliminate contention particularly for supper scalar processor (PowerPC and Pentium) which emphasis parallel instruction and pre-fetching of predicted future instructions. This is very important for any design depends on pipelining.
- 60. Intel Cache Evolution ProblemSolution Processor on which feature first appears External memory slower than the system bus. Add external cache using faster memory technology. 386 Increased processor speed results in external bus becoming a bottleneck for cache access. Move external cache on-chip, operating at the same speed as the processor. 486 Internal cache is rather small, due to limited space on chip Add external L2 cache using faster technology than main memory 486 Contention occurs when both the Instruction Prefetcher and the Execution Unit simultaneously require access to the cache. In that case, the Prefetcher is stalled while the Execution Unit’s data access takes place. Create separate data and instruction caches. Pentium Increased processor speed results in external bus becoming a bottleneck for L2 cache access. Create separate back-side bus that runs at higher speed than the main (front-side) external bus. The BSB is dedicated to the L2 cache. Pentium Pro Move L2 cache on to the processor chip. Pentium II Some applications deal with massive databases and must have rapid access to large amounts of data. The on-chip caches are too small. Add external L3 cache. Pentium III Move L3 cache on-chip. Pentium 4
- 61. Pentium 4 BlockDiagram
- 62. Pentium 4 CoreProcessor • Fetch/Decode Unit —Fetches instructions from L2 cache —Decode into micro-ops —Store micro-ops in L1 cache • Out of order execution logic —Schedules micro-ops —Based on data dependence and resources —May speculatively execute • Execution units —Execute micro-ops —Data from L1 cache —Results in registers • Memory subsystem —L2 cache and systems bus
- 63. Pentium 4 DesignReasoning • Decodes instructions into RISC like micro-ops before L1 cache • Micro-ops fixed length — Superscalar pipelining and scheduling • Pentium instructions long & complex • Performance improved by separating decoding from scheduling & pipelining — (More later – ch14) • Data cache is write back — Can be configured to write through • L1 cache controlled by 2 bits in register — CD = cache disable — NW = not write through — 2 instructions to invalidate (flush) cache and write back then invalidate • L2 and L3 8-way set-associative — Line size 128 bytes
- 64. PowerPC Cache Organization •601 – single 32kb 8 way set associative • 603 – 16kb (2 x 8kb) two way set associative • 604 – 32kb • 620 – 64kb • G3 & G4 —64kb L1 cache – 8 way set associative —256k, 512k or 1M L2 cache – two way set associative • G5 —32kB instruction cache —64kB data cache
- 65. PowerPC G5 BlockDiagram
- 66. Internet Sources • Manufacturersites —Intel —IBM/Motorola • Search on cache