会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明公开
    • CACHE MEMORY AND CACHE MEMORY CONTROL METHOD
    • CACHE-SPEICHER UND CACHE-SPEICHER-STEUERVERFAHREN
    • EP1667028A1
    • 2006-06-07
    • EP04772377.0
    • 2004-08-23
    • MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD.
    • TANAKA, TetsuyaNAKANISHI, RyutaKIYOHARA, TokuzoMORISHITA, HiroyukiCHIKAMURA, Keishi
    • G06F12/12G06F12/08
    • G06F12/127G06F12/124
    • A cache memory of the present invention includes: for each cache entry, way 0 to way 3 which hold use flags U indicating whether or not the use flags U have been accessed; and a control unit which: updates, when a cache entry is hit, a use flag U corresponding to the hit cache entry so that the use flag U indicates that the cache entry has been accessed; and reset, in the case where all other use flags in the same set indicates that the cache entries have been accessed herein, the all other use flags so that the use flags indicate that the cache entries have not been accessed; and select a cache entry to be replaced from among the cache entries corresponding to the use flags indicating that the cache entries have not been accessed.
    • 本发明的高速缓冲存储器包括:对于每个高速缓存条目,方式0到路径3,其保持使用标志U,指示是否已经访问了使用标志U; 以及控制单元,其在高速缓存条目被命中时更新与所述命中高速缓存条目对应的使用标志U,使得所述使用标志U指示所述高速缓存条目已经被访问; 并且在同一集合中的所有其他使用标志指示已经在这里访问了高速缓存条目的情况下,复位所有其他使用标志,使得使用标志指示高速缓存条目未被访问; 并且从与指示高速缓存条目未被访问的使用标志相对应的高速缓存条目中选择要替换的高速缓存条目。
    • 6. 发明公开
    • Cache-based data compression/decompression
    • Datenkomprimierung / -dekomprimierung mit Cache-Speichern。
    • EP0593968A1
    • 1994-04-27
    • EP93116015.4
    • 1993-10-04
    • HEWLETT-PACKARD COMPANY
    • Rosenburg,Charles J.Berge,Thomas G.
    • G06F12/12H04N1/417
    • G06F12/123G06F12/0802G06F12/124G06F2212/401H04N1/417
    • An apparatus (60) for compressing bilevel data includes a first cache memory (20,66) having a plurality of assigned levels of usage, a first usage level assigned to most recently used data segments and a second level assigned to a plurality of less recently used data segments. A processor (62) determines if a received data segment is found in the cache memory (20,66) and, if not, it assigns the received data segment to the cache memory's first level in place of a previous data segment stored therein. The previous data segment is assigned to a position in the second level in place of a less recently used data segment. The less recently used data segment that is displaced is chosen by a pseudo-random method. A "not-found" indication (38,62) is then transmitted to a receiving station along with the identity of the received data segment. The receiving station (72) contains identical cache structures and updates its caches in response to received code words and data segments. A further version of the invention emplaces data segments into cache memories in accordance with the context in which the data segments are found, the cache memories being assigned in accordance with context derived addresses.
    • 用于压缩二级数据的装置(60)包括具有多个分配的使用级别的第一高速缓存存储器(20,66),分配给最近使用的数据段的第一使用级别和分配给多个不太近的多个 使用的数据段。 处理器(62)确定在高速缓冲存储器(20,66)中是否找到接收到的数据段,并且如果不是,则将接收到的数据段分配给高速缓冲存储器的第一级代替存储在其中的先前数据段。 先前的数据段被分配给第二级中的位置,代替不太近使用的数据段。 通过伪随机方法选择最近使用的被替换的数据段。 然后将“未发现”指示(38,62)与所接收的数据段的标识一起发送到接收站。 接收站(72)包含相同的高速缓存结构,并响应于接收到的代码字和数据段更新其高速缓存。 根据发现数据段的上下文,根据上下文导出的地址分配高速缓存存储器,本发明的另一个版本将数据段发送到高速缓存存储器中。
    • 7. 发明公开
    • Cache memory
    • 缓存斯派克。
    • EP0412245A2
    • 1991-02-13
    • EP90108527.4
    • 1990-05-07
    • International Business Machines Corporation
    • Robinson, John Timothy
    • G06F12/12
    • G06F12/124G06F12/122
    • Methods and apparatus are set forth for use with a cache memory resource (that includes a plurality of cache blocks for storing data) and a cache directory (for keeping track of which of said blocks are in use, the number of times each block is referenced and block age), for determining which of said plurality of cache blocks is to be replaced with data to be stored in cache memory on a cache miss. The methods and apparatus cause a reference count, for each cache block, to be maintained in the cache directory; utilize at least one preselected age boundary threshold to determine when to adjust a reference count for a given block on a cache hit; and select a cache block for replacement as a function of reference count value and block age. For example, when 2 preselected age boundary thresholds are utilized, blocks may be considered for replacement only if they have aged past the second boundary and have a reference count below a preselected threshold value. On a cache miss, the block to be replaced can be selected from the set of blocks whose reference counts are below a preselected reference count threshold value thereby allowing for the possibility of non least recently used block replacement choices. Furthermore, according to another embodiment of the invention, to facilitate rapid identification of possible block replacement choices, a chain of blocks is maintained for each reference count below a preselected reference count threshold value.
    • 阐述了与高速缓存存储器资源(其包括用于存储数据的多个高速缓存块)和高速缓存目录(用于跟踪所使用的块中的哪一个正在使用中的每个块被参考的次数)的方法和装置 和块年龄),用于确定在高速缓存未命中将被要存储在高速缓冲存储器中的数据替换为所述多个高速缓存块中的哪一个。 所述方法和装置对于每个高速缓存块引起参考计数,以保持在所述缓存目录中; 利用至少一个预选的年龄边界阈值来确定何时调整缓存命中上给定块的引用计数; 并根据引用计数值和块年龄来选择一个用于替换的缓存块。 例如,当使用2个预选的年龄边界阈值时,只有当它们已经老化超过第二边界并且具有低于预选阈值的参考计数时,才可以考虑块的替换。 在缓存未命中时,可以从其参考计数低于预选参考计数阈值的块集合中选择要替换的块,从而允许非最近最少使用的块替换选择的可能性。 此外,根据本发明的另一个实施例,为了便于快速识别可能的块更换选择,为了每个参考计数保持低于预先选择的参考计数阈值的块链。