-
公开(公告)号：US20120191904A1
公开(公告)日：2012-07-26
申请号：US13430613
申请日：2012-03-26
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.
摘要翻译： 本文公开了一种高效地使用大型二级高速缓存的方法。 在某些实施例中，这种方法可以包括在二次高速缓存中累积多个数据轨道。 这些数据轨道可以包括经修改的数据和/或未修改的数据。 该方法可以确定多个数据轨道的一个子集是否构成一个完整的步幅。 在子集构成一个完整的步骤的情况下，该方法可能会从二级缓存中退出该子集。 通过降级整个步骤，该方法减少了从二级缓存中恢复数据所需的磁盘操作数。 本文还公开了相应的计算机程序产品和装置。
-
公开(公告)号：US20110087837A1
公开(公告)日：2011-04-14
申请号：US12577164
申请日：2009-10-10
IPC分类号： 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 and claimed herein.
摘要翻译： 本文公开了一种高效地使用大型二级高速缓存的方法。 在某些实施例中，这种方法可以包括在二次高速缓存中累积多个数据轨道。 这些数据轨道可以包括经修改的数据和/或未修改的数据。 该方法可以确定多个数据轨道的一个子集是否构成一个完整的步幅。 在子集构成一个完整的步骤的情况下，该方法可能会从二级缓存中退出该子集。 通过降级整个步骤，该方法减少了从二级缓存中恢复数据所需的磁盘操作数。 本文还公开并要求对应的计算机程序产品和装置。
-
公开(公告)号：US08688914B2
公开(公告)日：2014-04-01
申请号：US13286465
申请日：2011-11-01
申请人： Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Matthew J. Kalos , Ioannis Koltsidas , Karl A. Nielsen , Roman A. Pletka
发明人： Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Matthew J. Kalos , Ioannis Koltsidas , Karl A. Nielsen , Roman A. Pletka
IPC分类号： G06F12/00
CPC分类号： G06F3/0619 , G06F3/0646 , G06F3/0688 , G06F12/0246 , G06F12/0253 , G06F12/0811 , G06F12/0862 , G06F12/0864 , G06F12/0871 , G06F12/0897 , G06F12/122 , G06F12/127 , G06F12/128 , G06F2212/1016 , G06F2212/154 , G06F2212/222 , G06F2212/283 , G06F2212/604 , G06F2212/702 , G06F2212/7201
摘要： For efficient track destage in secondary storage in a more effective manner, for temporal bits employed with sequential bits for controlling the timing for destaging the track in a primary storage, the temporal bits and sequential bits are transferred from the primary storage to the secondary storage. The temporal bits are allowed to age on the secondary storage.
摘要翻译： 为了以更有效的方式有效地在二级存储器中运行轨迹，对于与用于控制主存储器中的轨道的定时的顺序位一起使用的时间位，时间位和顺序位从主存储器传送到辅助存储器。 时间位允许在辅助存储器上老化。
-
公开(公告)号：US08688913B2
公开(公告)日：2014-04-01
申请号：US13286454
申请日：2011-11-01
申请人： Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Matthew J. Kalos , Ioannis Koltsidas , Roman A. Pletka
发明人： Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Matthew J. Kalos , Ioannis Koltsidas , Roman A. Pletka
IPC分类号： G06F12/00
CPC分类号： G06F12/128 , G06F12/0811 , G06F12/0868 , G06F12/0891 , G06F12/0897 , G06F12/126 , G06F2212/1021 , G06F2212/1041 , G06F2212/222 , G06F2212/283
摘要： For movement of partial data segments within a computing storage environment having lower and higher levels of cache by a processor, a whole data segment containing one of the partial data segments is promoted to both the lower and higher levels of cache. Requested data of the whole data segment is split and positioned at a Most Recently Used (MRU) portion of a demotion queue of the higher level of cache. Unrequested data of the whole data segment is split and positioned at a Least Recently Used (LRU) portion of the demotion queue of the higher level of cache. The unrequested data is pinned in place until a write of the whole data segment to the lower level of cache completes.
摘要翻译： 为了在由处理器具有较低和较高级别的高速缓存的计算存储环境中移动部分数据段，将包含部分数据段中的一个的整个数据段升级到较低级别和更高级别的高速缓存。 整个数据段的请求数据被分割并定位在较高级缓存的降级队列的最近使用（MRU）部分。 整个数据段的未请求的数据被分割并定位在较高级别的缓存的降级队列的最近最少使用（LRU）部分。 未请求的数据被固定到位，直到整个数据段写入缓存的较低级别完成。
-
公开(公告)号：US20130232295A1
公开(公告)日：2013-09-05
申请号：US13466861
申请日：2012-05-08
申请人： 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.
-
公开(公告)号：US08972661B2
公开(公告)日：2015-03-03
申请号：US13285740
申请日：2011-10-31
申请人： 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.
-
公开(公告)号：US08935479B2
公开(公告)日：2015-01-13
申请号：US13466861
申请日：2012-05-08
申请人： 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
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）端。
-
公开(公告)号：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）端。
-
公开(公告)号：US08930624B2
公开(公告)日：2015-01-06
申请号：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
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.
-
公开(公告)号：US10152423B2
公开(公告)日：2018-12-11
申请号：US13285817
申请日：2011-10-31
申请人： Kevin J. Ash , Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Ioannis Koltsidas , Roman A. Pletka
发明人： Kevin J. Ash , Michael T. Benhase , Stephen L. Blinick , Evangelos S. Eleftheriou , Lokesh M. Gupta , Robert Haas , Xiao-Yu Hu , Ioannis Koltsidas , Roman A. Pletka
IPC分类号： G06F12/0871 , G06F12/0888 , G06F12/0897 , G06F12/128 , G06F12/121
摘要： The population of data to be admitted into secondary data storage cache of a data storage system is controlled by determining heat metrics of data of the data storage system. If candidate data is submitted for admission into the secondary cache, data is selected to tentatively be evicted from the secondary cache; candidate data provided to the secondary data storage cache is rejected if its heat metric is less than the heat metric of the tentatively evicted data; and candidate data submitted for admission to the secondary data storage cache is admitted if its heat metric is equal to or greater than the heat metric of the tentatively evicted data.
-
-
-
-
-
-
-
-
-
搜索结果
28 条记录 (耗时 0.029 秒)