Content deleted Content added
m Adding or correcting wikilink |
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. |
||
Line 63:
=== Disadvantages ===
* The placement policy is slow as it takes time to iterate through all the lines.{{Disputed inline|talk=Talk:Cache placement policies#Advantages/disadvantages of the fully associative cache wrong?|date=June 2022}}
* The placement policy is power hungry as it has to iterate over entire cache set to locate a block.
* The most expensive of all methods, due to the high cost of associative-comparison hardware.
| |||