Divide and Conquer Andreas Klappenecker [based on slides by Prof. Welch]
Caching III Andreas Klappenecker CPSC321 Computer Architecture.
15
Caching III Andreas Klappenecker CPSC321 Computer Architecture
-
date post
21-Dec-2015 -
Category
Documents
-
view
222 -
download
1
Transcript of Caching III Andreas Klappenecker CPSC321 Computer Architecture.
Cache Block Mapping Direct mapped cache
a block goes in exactly one place in the cache
Fully associative a block can go anywhere in the cache difficult to find a block parallel comparison to speed-up
search
Cache Block Mapping Set associative
Each block maps to a unique set, and the block can be placed into any element of that set
Position is given by (Block number) modulo (# of sets in cache) If the sets contain n elements, then the
cache is called n-way set associative