psudo-LRU(Tree LRU) 的实现

最新推荐文章于 2023-11-11 17:01:36 发布

naclkcl9

最新推荐文章于 2023-11-11 17:01:36 发布

阅读量5k

点赞数

分类专栏： IC Design 文章标签： tree reference encoding branch input cache

本文链接：https://blog.csdn.net/naclkcl9/article/details/5701231

版权

pseudo-LRU

two-way set associative - one bit

   indicates which line of the two has been reference more recently


four-way set associative - three bits

   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_
     bit_1 == 0?    bit_2 =