DescriptionQ1071
Q1071ArchGoogleASIC interview problem
Compare true LRU with tree PLRU
TechniquesArchitectureCacheLRUReplacement policy
DifficultyMedium
TopicComputer Architecture
LanguageSystemVerilog
Format4 choices
01
Problem
A four-way cache can use exact least-recently-used replacement or a three-bit binary-tree pseudo-LRU policy. Which statement is guaranteed?
02
