公开(公告)号：US07783836B2

公开(公告)日：2010-08-24

申请号：US11611670

申请日：2006-12-15

Applicant: Qufei Wang

Inventor： Qufei Wang

IPC: G06F12/00

CPC classification number: G06F12/123

Abstract: Aspects of the invention relate to improvements to the Least Recently Used (LRU) cache replacement method. Weighted LRU (WLRU) and Compact Weighted LRU (CWLRU) are CPU cache replacement methods that have superior hit rates to LRU replacement for programs with poor locality, such as network protocols and applications. WLRU assigns weights to cache lines and makes replacement decision by comparing weights. When a cache line is first brought into the cache, it is assigned an initial weight. Weights of cache lines in WLRU increase when hit and decrease when not hit. Weights in WLRU also have upper limits, and the weight of a cache line never increases beyond the upper limit. CWLRU is a more space-efficient implementation of WLRU. Compared to WLRU, CWLRU uses fewer bits per cache line to store the weight.

Abstract translation: 本发明的方面涉及对最近最少使用（LRU）高速缓存替换方法的改进。 加权LRU（WLRU）和紧凑加权LRU（CWLRU）是CPU缓存替换方法，对于局部性差的程序（如网络协议和应用程序），具有优于LRU替换的命中率。 WLRU将权重分配给高速缓存行，并通过比较权重进行替换决策。 当缓存行首先被带入高速缓存时，它被分配一个初始权重。 WLRU中的高速缓存线的重量在击中时增加，而不受命中则减小。 WLRU中的权重也有上限，缓存行的权重不会超过上限。 CWLRU是WLRU更节省空间的实施。 与WLRU相比，CWLRU使用每个缓存行更少的位来存储权重。

公开(公告)号：US20070198779A1

公开(公告)日：2007-08-23

申请号：US11611670

申请日：2006-12-15

Applicant: Qufei Wang

Inventor： Qufei Wang

IPC: G06F12/00

CPC classification number: G06F12/123

Abstract: Aspects of the invention relate to improvements to the Least Recently Used (LRU) cache replacement method. Weighted LRU (WLRU) and Compact Weighted LRU (CWLRU) are CPU cache replacement methods that have superior hit rates to LRU replacement for programs with poor locality, such as network protocols and applications. WLRU assigns weights to cache lines and makes replacement decision by comparing weights. When a cache line is first brought into the cache, it is assigned an initial weight. Weights of cache lines in WLRU increase when hit and decrease when not hit. Weights in WLRU also have upper limits, and the weight of a cache line never increases beyond the upper limit. CWLRU is a more space-efficient implementation of WLRU. Compared to WLRU, CWLRU uses fewer bits per cache line to store the weight.

Abstract translation: 本发明的方面涉及对最近最少使用（LRU）高速缓存替换方法的改进。 加权LRU（WLRU）和紧凑加权LRU（CWLRU）是CPU缓存替换方法，对于局部性差的程序（如网络协议和应用程序），具有优于LRU替换的命中率。 WLRU将权重分配给高速缓存行，并通过比较权重进行替换决策。 当缓存行首先被带入高速缓存时，它被分配一个初始权重。 WLRU中的高速缓存线的重量在击中时增加，而不受命中则减小。 WLRU中的权重也有上限，缓存行的权重不会超过上限。 CWLRU是WLRU更节省空间的实施。 与WLRU相比，CWLRU使用每个缓存行更少的位来存储权重。

公开(公告)号：US08176258B2

公开(公告)日：2012-05-08

申请号：US12840728

申请日：2010-07-21

Applicant: Qufei Wang

Inventor： Qufei Wang

IPC: G06F12/00

CPC classification number: G06F12/123

Abstract: Aspects of the invention relate to improvements to the Least Recently Used (LRU) cache replacement method. Weighted LRU (WLRU) and Compact Weighted LRU (CWLRU) are CPU cache replacement methods that have superior hit rates to LRU replacement for programs with poor locality, such as network protocols and applications. WLRU assigns weights to cache lines and makes replacement decision by comparing weights. When a cache line is first brought into the cache, it is assigned an initial weight. Weights of cache lines in WLRU increase when hit and decrease when not hit. Weights in WLRU also have upper limits, and the weight of a cache line never increases beyond the upper limit. CWLRU is a more space-efficient implementation of WLRU. Compared to WLRU, CWLRU uses fewer bits per cache line to store the weight.

Abstract translation: 本发明的方面涉及对最近最少使用（LRU）高速缓存替换方法的改进。 加权LRU（WLRU）和紧凑加权LRU（CWLRU）是CPU缓存替换方法，对于局部性差的程序（如网络协议和应用程序），具有优于LRU替换的命中率。 WLRU将权重分配给高速缓存行，并通过比较权重进行替换决策。 当缓存行首先被带入高速缓存时，它被分配一个初始权重。 WLRU中的高速缓存线的重量在击中时增加，而不受命中则减小。 WLRU中的权重也有上限，缓存行的权重不会超过上限。 CWLRU是WLRU更节省空间的实施。 与WLRU相比，CWLRU使用每个缓存行更少的位来存储权重。

公开(公告)号：US20110016276A1

公开(公告)日：2011-01-20

申请号：US12840728

申请日：2010-07-21

Applicant: Qufei Wang

Inventor： Qufei Wang

IPC: G06F12/08 ,  G06F12/00

CPC classification number: G06F12/123

Abstract: Aspects of the invention relate to improvements to the Least Recently Used (LRU) cache replacement method. Weighted LRU (WLRU) and Compact Weighted LRU (CWLRU) are CPU cache replacement methods that have superior hit rates to LRU replacement for programs with poor locality, such as network protocols and applications. WLRU assigns weights to cache lines and makes replacement decision by comparing weights. When a cache line is first brought into the cache, it is assigned an initial weight. Weights of cache lines in WLRU increase when hit and decrease when not hit. Weights in WLRU also have upper limits, and the weight of a cache line never increases beyond the upper limit. CWLRU is a more space-efficient implementation of WLRU. Compared to WLRU, CWLRU uses fewer bits per cache line to store the weight.

Abstract translation: 本发明的方面涉及对最近最少使用（LRU）高速缓存替换方法的改进。 加权LRU（WLRU）和紧凑加权LRU（CWLRU）是CPU缓存替换方法，对于局部性差的程序（如网络协议和应用程序），具有优于LRU替换的命中率。 WLRU将权重分配给高速缓存行，并通过比较权重进行替换决策。 当缓存行首先被带入高速缓存时，它被分配一个初始权重。 WLRU中的高速缓存线的重量在击中时增加，而不受命中则减小。 WLRU中的权重也有上限，缓存行的权重不会超过上限。 CWLRU是WLRU更节省空间的实施。 与WLRU相比，CWLRU使用每个缓存行更少的位来存储权重。