Revision as of 14:16, 5 February 2024 edit Cousteau (talk \| contribs) 389 edits m Undid revision 1202879777 by 161.69.54.47 (talk) - Let's be consistent. If we're using Verilog-style 'b notation for binary we should use it everywhere in the article. Reverting to 0b style. Tag: Undo ← Previous edit		Revision as of 19:39, 18 March 2024 edit undo 2a0d:6fc7:32e:7c9:6125:3c4b:35d6:f017 (talk) →Disadvantages Next edit →
Line 63: === Disadvantages === * The placement policy is power hungry as itthe comparison circuitry has to ~~iterate~~run over the entire cache ~~set~~ to locate a block.▼ * 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.

Cache placement policies: Difference between revisions