Scribd
Upload
2K views

Cache Memory-Associative Mapping

- Associative mapping allows a memory block to be loaded into any line of cache. The memory address is interpreted as a tag and word. - Set associative mapping divides the cache into sets, with each set containing multiple lines. A given block can map to any line within its set. - Replacement algorithms for set associative caches include least recently used (LRU), first in first out (FIFO), and least frequently used. Random replacement is also possible.

Uploaded by

Eswin Angel
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2K views

Cache Memory-Associative Mapping

- Associative mapping allows a memory block to be loaded into any line of cache. The memory address is interpreted as a tag and word. - Set associative mapping divides the cache into sets, with each set containing multiple lines. A given block can map to any line within its set. - Replacement algorithms for set associative caches include least recently used (LRU), first in first out (FIFO), and least frequently used. Random replacement is also possible.

Uploaded by

Eswin Angel
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Associative Mapping

A main memory block can load into any line of cache Memory address is interpreted as tag and word Tag uniquely identifies block of memory Every lines tag is examined for a match Cache searching gets expensive

Fully Associative Cache Organization

Associative Mapping Example

Associative Mapping Address Structure


Tag 22 bit
Word 2 bit

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 identify which 16 bit word is required from 32 bit data block e.g.

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

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

Set Associative Mapping Example


13 bit set number Block number in main memory is modulo 213 000000, 00A000, 00B000, 00C000 map to same set

Two Way Set Associative Cache Organization

Set Associative Mapping Address Structure


Tag 9 bit Set 13 bit

Word 2 bit

Use set field to determine cache set to look in Compare tag field to see if we have a hit e.g
Address number 1FF 7FFC 001 7FFC Tag Data Set

1FF 001

12345678 11223344

1FFF 1FFF

Two Way Set Associative Mapping Example

Set 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 = 2d 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

Replacement Algorithms (1) Direct mapping


No choice Each block only maps to one line Replace that line

Replacement Algorithms (2) Associative & Set Associative


Hardware implemented algorithm (speed) Least Recently used (LRU) e.g. in 2 way set associative
Which of the 2 block is lru?

First in first out (FIFO)


replace block that has been in cache longest

Least frequently used


replace block which has had fewest hits

Random

Write Policy
Must not overwrite a cache block unless main memory is up to date Multiple CPUs may have individual caches I/O may address main memory directly

Write through
All writes 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!

Write back
Updates initially 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

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 4 L1 caches
8k bytes 64 byte lines four way set associative

L2 cache
Feeding both L1 caches 256k 128 byte lines

Pentium 4 Diagram (Simplified)

Pentium 4 Core Processor


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

Pentium 4 Design Reasoning


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

Power PC Cache Organization


601 single 32kb 8 way set associative 603 16kb (2 x 8kb) two way set associative 604 32kb 610 64kb G3 & G4
64kb L1 cache
8 way set associative

256k, 512k or 1M L2 cache


two way set associative

PowerPC G4

Comparison of Cache Sizes

You might also like