part 3 Cache Memory 5

来源:互联网 发布:linux修改权限命令 编辑:程序博客网 时间:2024/05/16 17:40

Fully associative


cache structure

detailed relationships on cache address structure.

Following is the different of direct map and 8-set associative


Address Bit Partitioning



TAG
INDEX
OFFSET
18
17
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1
0
Compare Bits
Set Select Bits
Byte Select Bits



 Memory size = 528KB = 219
Block size = 32Bytes = 25

Number of blocks in cache = Cache size/Block size = 64KB/32B = 214/25 = 211

Number of bits in Tag = Total bits - Index bits - Offset bits = 19-11-5 = 3

TAG
INDEX
OFFSET
18
17
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1
0
Compare Bits
Set Select Bits
Byte Select Bits



The Compare Bits are compared with the corresponding Tag Bits in the Cache Directory.
The Set Select Bits are used to select a particular Set in the Cache.
The Byte Select Bits are used to select a particular byte in the accessed block.Memory size = 528KB = 219
Block size = 32Bytes = 25

Number of sets in cache = Cache size/(Set size * Block size) = 64KB/(8 blocks * 32B) = 214/(23 * 25) = 28

Number of bits in Tag = Total bits - Index bits - Offset bits = 19-8-5 = 6


原创粉丝点击