专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20090271574A1 METHOD FOR IMPROVING FREQUENCY-BASED CACHING ALGORITHMS BY MAINTAINING A STABLE HISTORY OF EVICTED ITEMS 有权
标题翻译：通过维护有保障的项目的稳定历史来改进基于频率的高速缓存算法的方法
公开(公告)号：US20090271574A1
公开(公告)日：2009-10-29
申请号：US12109258
申请日：2008-04-24
申请人： James Allen Larkby-Lahet , Prashant Pandey
发明人： James Allen Larkby-Lahet , Prashant Pandey
IPC分类号： G06F12/08
CPC分类号： G06F12/126 , G06F12/0888 , G06F12/122
摘要： The invention provides a method for improving frequency-based caching algorithms by maintaining a stable history of evicted items. One embodiment involves a process for caching data in a cache memory including logical pages including, upon detecting that a first page is being evicted from the cache memory, performing an addition process by adding metadata of the first page to a stable history list. Upon detecting a cache miss for a second page, if the stable history list contains metadata for the second page, then removing the second page metadata from the stable history list and applying a promotion determination for the second page to determine a priority value for the second page metadata and placing the second page in the cache memory based on the priority data. Upon detecting that metadata of a third page is to be evicted from the stable history list, applying an eviction determination to evict metadata of the third page from the stable history list based on a predetermined caching rule.
摘要翻译：本发明提供了一种通过维持被驱逐物品的稳定历史来改进基于频率的缓存算法的方法。一个实施例涉及用于在包括逻辑页面的高速缓冲存储器中缓存数据的过程，包括在检测到第一页被从高速缓存存储器中逐出时执行添加处理，通过将第一页的元数据添加到稳定历史列表。当检测到第二页面的高速缓存未命中时，如果稳定历史列表包含用于第二页面的元数据，则从稳定历史列表中移除第二页面元数据并对第二页面应用促销确定以确定第二页面的第二页面的优先级值页面元数据，并且基于优先级数据将第二页面放置在高速缓冲存储器中。在检测到第三页的元数据被从稳定历史列表中逐出时，基于预定的高速缓存规则，应用逐出确定从稳定历史列表中排除第三页的元数据。

2. 发明授权

US08250306B2 Method for improving frequency-based caching algorithms by maintaining a stable history of evicted items 有权
标题翻译：通过维护被驱逐物品的稳定历史来改进基于频率的缓存算法的方法
公开(公告)号：US08250306B2
公开(公告)日：2012-08-21
申请号：US12109258
申请日：2008-04-24
申请人： James Allen Larkby-Lahet , Prashant Pandey
发明人： James Allen Larkby-Lahet , Prashant Pandey
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F12/126 , G06F12/0888 , G06F12/122
摘要： The invention provides a method for improving frequency-based caching algorithms by maintaining a stable history of evicted items. One embodiment involves a process for caching data in a cache memory including logical pages including, upon detecting that a first page is being evicted from the cache memory, performing an addition process by adding metadata of the first page to a stable history list. Upon detecting a cache miss for a second page, if the stable history list contains metadata for the second page, then removing the second page metadata from the stable history list and applying a promotion determination for the second page to determine a priority value for the second page metadata and placing the second page in the cache memory based on the priority data. Upon detecting that metadata of a third page is to be evicted from the stable history list, applying an eviction determination to evict metadata of the third page from the stable history list based on a predetermined caching rule.
摘要翻译：本发明提供了一种通过维持被驱逐物品的稳定历史来改进基于频率的缓存算法的方法。一个实施例涉及用于在包括逻辑页面的高速缓冲存储器中缓存数据的过程，包括在检测到第一页被从高速缓存存储器中逐出时执行添加处理，通过将第一页的元数据添加到稳定历史列表。当检测到第二页面的高速缓存未命中时，如果稳定历史列表包含用于第二页面的元数据，则从稳定历史列表中移除第二页面元数据并对第二页面应用促销确定以确定第二页面的第二页面的优先级值页面元数据，并且基于优先级数据将第二页面放置在高速缓冲存储器中。在检测到第三页的元数据被从稳定历史列表中逐出时，基于预定的高速缓存规则，应用逐出确定从稳定历史列表中排除第三页的元数据。

3. 发明授权

US08612689B2 Stable adaptive replacement cache processing 失效
标题翻译：稳定的自适应替换缓存处理
公开(公告)号：US08612689B2
公开(公告)日：2013-12-17
申请号：US13541430
申请日：2012-07-03
申请人： James Allen Larkby-Lahet , Prashant Pandey
发明人： James Allen Larkby-Lahet , Prashant Pandey
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F12/126 , G06F12/0888 , G06F12/122
摘要： A process for caching data in a cache memory includes upon detecting that a first page is in a first or second list, the first page is moved to a most recently used (MRU) position in the second list. Upon detecting that the first page is in a first history list, a first target size is updated to a second target size for the first and second lists, the first page is moved from the first history list to the MRU position in the second list, and the first page is fetched to the cache memory. Upon detecting that the first page is in a second history list, the second target size is updated to a third target size for the first and second lists, and the first page is moved from the second history list to the MRU position in the second list.
摘要翻译：用于缓存高速缓冲存储器中的数据的过程包括在检测到第一页面处于第一或第二列表中时，第一页面被移动到第二列表中的最近使用（MRU）位置。在检测到第一页面处于第一历史列表中时，第一目标尺寸被更新为第一和第二列表的第二目标尺寸，第一页从第一历史列表移动到第二列表中的MRU位置，并且第一页被提取到高速缓冲存储器。在检测到第一页面处于第二历史列表中时，第二目标尺寸被更新为第一和第二列表的第三目标尺寸，并且第一页面从第二历史列表移动到第二列表中的MRU位置。

4. 发明申请

US20120272010A1 STABLE ADAPTIVE REPLACEMENT CACHE PROCESSING 失效
标题翻译：稳定的自适应替换缓存处理
公开(公告)号：US20120272010A1
公开(公告)日：2012-10-25
申请号：US13541430
申请日：2012-07-03
申请人： James Allen Larkby-Lahet , Prashant Pandey
发明人： James Allen Larkby-Lahet , Prashant Pandey
IPC分类号： G06F12/12
CPC分类号： G06F12/126 , G06F12/0888 , G06F12/122
摘要： A process for caching data in a cache memory includes upon detecting that a first page is in a first or second list, the first page is moved to a most recently used (MRU) position in the second list. Upon detecting that the first page is in a first history list, a first target size is updated to a second target size for the first and second lists, the first page is moved from the first history list to the MRU position in the second list, and the first page is fetched to the cache memory. Upon detecting that the first page is in a second history list, the second target size is updated to a third target size for the first and second lists, and the first page is moved from the second history list to the MRU position in the second list.
摘要翻译：用于缓存高速缓冲存储器中的数据的过程包括在检测到第一页面处于第一或第二列表中时，第一页面被移动到第二列表中的最近使用（MRU）位置。在检测到第一页面处于第一历史列表中时，第一目标尺寸被更新为第一和第二列表的第二目标尺寸，第一页从第一历史列表移动到第二列表中的MRU位置，并且第一页被提取到高速缓冲存储器。在检测到第一页面处于第二历史列表中时，第二目标尺寸被更新为第一和第二列表的第三目标尺寸，并且第一页面从第二历史列表移动到第二列表中的MRU位置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式