LRU replacement policy

LRU replacement policy 解释了s3c44b0x cache的行替换策略 • each bit represents one branch point in a binary decision tree • let 1 represent that the left side has been referenced more recently than the right side, and 0 vice-versa are all 4 lines valid? / \ yes no, use an invalid line | | | bit_0 == 0? state | replace ref to | next state / \ ------+-------- -------+----------- y n 00x | line_0 line_0 | 11_ / \ 01x | line_1 line_1 | 10_