Content deleted Content added
Guy Harris (talk | contribs) →Disadvantages: Is a fully-associative cache implemented with associative memory? If so, then is iteration needed? Point to the talk page section where somebody argued that it's not needed. |
Guy Harris (talk | contribs) →Example: Somebody asked, on the talk page, whether there's a typo in the last line; point to the section where they ask that. |
||
Line 117:
# Address <code>0x0004</code> (tag - <code>0b000_0000</code>, index – <code>0b0_0001</code>, offset – <code>0b00</code>) corresponds to block 1 of the memory and maps to the set 1 of the cache. The block occupies a cache line in set 1, determined by the replacement policy for the cache.
# Address <code>0x00FF</code> (tag – <code>0b000_0001</code>, index – <code>0b1_1111</code>, offset – <code>0b11</code>) corresponds to block 63 of the memory and maps to the set 31 of the cache. The block occupies a cache line in set 31, determined by the replacement policy for the cache.
# Address <code>0x0100</code> (tag – <code>0b000_0001</code>, index – <code>0b0_0000</code>, offset – <code>0b00</code>) corresponds to block 64 of the memory and maps to the set 0 of the cache. The block occupies a cache line in set 0, determined by the replacement policy for the cache.{{Disputed inline|talk=Talk:Cache placement policies#Typo in the last line of the Example section?n|date=June 2022}}
== Two-way skewed associative cache ==
| |||