Pseudo-LRU for a locking cache
    32.
    发明授权
    Pseudo-LRU for a locking cache 有权
    锁定缓存的伪LRU

    公开(公告)号:US07055004B2

    公开(公告)日:2006-05-30

    申请号:US10655366

    申请日:2003-09-04

    IPC分类号: G06F12/12

    摘要: The present invention provides for a cache-accessing system employing a binary tree with decision nodes. A cache comprising a plurality of sets is provided. A locking or streaming replacement strategy is employed for individual sets of the cache. A replacement management table is also provided. The replacement management table is employable for managing a replacement policy of information associated with the plurality of sets. A pseudo least recently used function is employed to determine the least recently used set of the cache, for such reasons as set replacement. An override signal line is also provided. The override signal is employable to enable an overwrite of a decision node of the binary tree. A value signal is also provided. The value signal is employable to overwrite the decision node of the binary tree.

    摘要翻译: 本发明提供一种采用具有决策节点的二叉树的高速缓存访​​问系统。 提供包括多个集合的高速缓存。 缓存的单独集合采用锁定或流式替换策略。 还提供了更换管理表。 替换管理表可用于管理与多个集合相关联的信息的替换策略。 由于诸如设置替换的原因,采用伪最近最少使用的功能来确定最近使用的高速缓存集合。 还提供超驰信号线。 覆盖信号可用于实现二叉树的决策节点的覆盖。 还提供了值信号。 值信号可用于覆盖二叉树的判定节点。