利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

28 条记录 (耗时 0.036 秒)

    ADAPTIVE CACHE PROMOTIONS IN A TWO LEVEL CACHING SYSTEM
    7.
    发明申请
    ADAPTIVE CACHE PROMOTIONS IN A TWO LEVEL CACHING SYSTEM 有权
    自适应高速缓存在两级缓存系统中的推广

    公开(公告)号：US20130232294A1

    公开(公告)日：2013-09-05

    申请号：US13412412

    申请日：2012-03-05

    申请人： Michael T. Benhase ,  Stephen L. Blinick ,  Evangelos S. Eleftheriou ,  Lokesh M. Gupta ,  Robert Haas ,  Xiao-Yu Hu ,  Ioannis Koltsidas ,  Roman A. Pletka

    发明人： Michael T. Benhase ,  Stephen L. Blinick ,  Evangelos S. Eleftheriou ,  Lokesh M. Gupta ,  Robert Haas ,  Xiao-Yu Hu ,  Ioannis Koltsidas ,  Roman A. Pletka

    IPC分类号： G06F12/08

    CPC分类号： G06F12/128 ,  G06F12/126

    摘要： Provided are a computer program product, system, and method for managing data in a first cache and a second cache. A reference count is maintained in the second cache for the page when the page is stored in the second cache. It is determined that the page is to be promoted from the second cache to the first cache. In response to determining that the reference count is greater than zero, the page is added to a Least Recently Used (LRU) end of an LRU list in the first cache. In response to determining that the reference count is less than or equal to zero, the page is added to a Most Recently Used (LRU) end of the LRU list in the first cache.

    摘要翻译： 提供了一种用于管理第一高速缓存和第二高速缓存中的数据的计算机程序产品，系统和方法。 当页面存储在第二高速缓存中时，对于页面的第二高速缓存中维护引用计数。 确定页面将被从第二缓存提升到第一高速缓存。 响应于确定参考计数大于零，该页被添加到第一高速缓存中的LRU列表的最近最少使用（LRU）末端。 响应于确定参考计数小于或等于零，该页被添加到第一高速缓存中的LRU列表的最近使用（LRU）端。

    Dynamically adjusted threshold for population of secondary cache
    9.
    发明授权
    Dynamically adjusted threshold for population of secondary cache 有权
    二级缓存人口的动态调整阈值

    公开(公告)号：US08972662B2

    公开(公告)日：2015-03-03

    申请号：US13457290

    申请日：2012-04-26

    申请人： Michael T. Benhase ,  Stephen L. Blinick ,  Evangelos S. Eleftheriou ,  Lokesh M. Gupta ,  Robert Haas ,  Xiao-Yu Hu ,  Ioannis Koltsidas ,  Roman A. Pletka

    发明人： Michael T. Benhase ,  Stephen L. Blinick ,  Evangelos S. Eleftheriou ,  Lokesh M. Gupta ,  Robert Haas ,  Xiao-Yu Hu ,  Ioannis Koltsidas ,  Roman A. Pletka

    IPC分类号： G06F12/08

    CPC分类号： G06F12/0888 ,  G06F12/0866 ,  G06F12/0897 ,  G06F2212/225

    摘要： The population of data to be inserted into secondary data storage cache is controlled by determining a heat metric of candidate data; adjusting a heat metric threshold; rejecting candidate data provided to the secondary data storage cache whose heat metric is less than the threshold; and admitting candidate data whose heat metric is equal to or greater than the heat metric threshold. The adjustment of the heat metric threshold is determined by comparing a reference metric related to hits of data most recently inserted into the secondary data storage cache, to a reference metric related to hits of data most recently evicted from the secondary data storage cache; if the most recently inserted reference metric is greater than the most recently evicted reference metric, decrementing the threshold; and if the most recently inserted reference metric is less than the most recently evicted reference metric, incrementing the threshold.

    摘要翻译： 通过确定候选数据的热度量来控制要插入到辅助数据存储高速缓存中的数据的总数; 调整热量度量阈值; 拒绝提供给热度量小于阈值的次数据存储高速缓存的候选数据; 并且允许其热度量等于或大于热度量阈值的候选数据。 通过将与最近插入次级数据存储高速缓存中的数据的命中相关的参考度量与与次级数据存储高速缓存最近被排出的数据的命中相关的参考度量进行比较来确定热度量阈值的调整; 如果最近插入的参考度量值大于最近被驱逐的参考度量，则递减阈值; 并且如果最近插入的参考度量小于最近驱逐的参考度量，则递增阈值。

    SECONDARY CACHE FOR WRITE ACCUMULATION AND COALESCING
    10.
    发明申请
    SECONDARY CACHE FOR WRITE ACCUMULATION AND COALESCING 有权
    用于写入累积和分析的二次高速缓存

    公开(公告)号：US20120191904A1

    公开(公告)日：2012-07-26

    申请号：US13430613

    申请日：2012-03-26

    申请人： Stephen L. Blinick ,  Lokesh M. Gupta ,  Yu-Cheng Hsu ,  Cheng-Chung Song

    发明人： Stephen L. Blinick ,  Lokesh M. Gupta ,  Yu-Cheng Hsu ,  Cheng-Chung Song

    IPC分类号： G06F12/02 ,  G06F12/08

    CPC分类号： G06F12/0804 ,  G06F11/1008 ,  G06F11/1076 ,  G06F12/0866

    摘要： A method for efficiently using a large secondary cache is disclosed herein. In certain embodiments, such a method may include accumulating, in a secondary cache, a plurality of data tracks. These data tracks may include modified data and/or unmodified data. The method may determine if a subset of the plurality of data tracks makes up a full stride. In the event the subset makes up a full stride, the method may destage the subset from the secondary cache. By destaging full strides, the method reduces the number of disk operations that are required to destage data from the secondary cache. A corresponding computer program product and apparatus are also disclosed herein.

    摘要翻译： 本文公开了一种高效地使用大型二级高速缓存的方法。 在某些实施例中，这种方法可以包括在二次高速缓存中累积多个数据轨道。 这些数据轨道可以包括经修改的数据和/或未修改的数据。 该方法可以确定多个数据轨道的一个子集是否构成一个完整的步幅。 在子集构成一个完整的步骤的情况下，该方法可能会从二级缓存中退出该子集。 通过降级整个步骤，该方法减少了从二级缓存中恢复数据所需的磁盘操作数。 本文还公开了相应的计算机程序产品和装置。