会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Method and apparatus for replacing cache lines in a cache memory
    • 用于替换高速缓冲存储器中的高速缓存行的方法和装置
    • US06490654B2
    • 2002-12-03
    • US09127491
    • 1998-07-31
    • John A. WickeraadStephen B. LyleBrendan A. Voge
    • John A. WickeraadStephen B. LyleBrendan A. Voge
    • G06F1212
    • G06F12/121G06F21/00
    • A cache memory replacement algorithm replaces cache lines based on the likelihood that cache lines will not be needed soon. A cache memory in accordance with the present invention includes a plurality of cache lines that are accessed associatively, with a count entry associated with each cache line storing a count value that defines a replacement class. The count entry is typically loaded with a count value when the cache line is accessed, with the count value indicating the likelihood that the contents of cache lines will be needed soon. In other words, data which is likely to be needed soon is assigned a higher replacement class, while data that is more speculative and less likely to be needed soon is assigned a lower replacement class. When the cache memory becomes full, the replacement algorithm selects for replacement those cache lines having the lowest replacement class. Accordingly, the cache lines selected for replacement contain the most speculative data in the cache that is least likely to be needed soon.
    • 高速缓存存储器替换算法基于不久之后不需要高速缓存行的可能性来替换高速缓存行。 根据本发明的高速缓冲存储器包括多个高速缓存行,其被相关联地访问,与存储定义替换类的计数值的每个高速缓存行相关联的计数条目。 当访问高速缓存行时,计数条目通常加载计数值,其中计数值指示即将需要高速缓存行内容的可能性。 换句话说,很快可能需要的数据被分配更高的替换类,而更具有推测性且不太可能需要的数据被分配较低的替换类。 当高速缓冲存储器变满时,替换算法选择替换具有最低替换类的那些高速缓存行。 因此,选择用于替换的高速缓存行包含尽快不太可能需要的高速缓存中最具推测性的数据。