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

11. 发明公开

EP3117331A1 DYNAMICALLY MODIFYING DURABILITY PROPERTIES FOR INDIVIDUAL DATA VOLUMES 有权
标题翻译：动态变化DER BESTYNDIGKEITSEIGENSCHAFTENFÜREINZELNE DATENMENGEN
公开(公告)号：EP3117331A1
公开(公告)日：2017-01-18
申请号：EP15760756.5
申请日：2015-03-10
申请人： Amazon Technologies, Inc.
发明人： WEI, Danny , LEE, Kerry Quintin , HE, Jiahua , HAWKS, Benjamin Arthur , GUTHRIE, II, John Luther , THOMPSON, James Michael
IPC分类号： G06F15/16
CPC分类号： G06F12/0866 , G06F11/14 , G06F11/1471 , G06F11/3409 , G06F11/3485 , G06F12/0804 , G06F12/0868 , G06F2201/885 , G06F2212/1016 , G06F2212/1032 , G06F2212/313 , G06F2212/461 , G06F2212/502
摘要： A block-based storage system may implement dynamic durability adjustment for page cache write logging. A rate of incoming write requests for data volumes maintained at a storage node may be monitored. Based, at least in part, on the rate of incoming write requests, a dynamic modification to a durability property for a data volume may be made, such as enabling page cache write logging the data volume or disabling write logging for the data volume. When incoming write requests are received, a determination may be made as to whether page cache write logging for a particular data volume is enabled. For write requests with disabled page cache write logging, the page cache may be updated and the write request may be acknowledged without storing a log record describing the update in a page cache write log.
摘要翻译：基于块的存储系统可以实现页面缓存写入日志的动态持久性调整。可以监视在存储节点处维护的数据卷的传入写入请求的速率。至少部分地基于传入写入请求的速率，可以对数据卷的耐久性属性进行动态修改，例如使能页面缓存写入记录数据卷或禁用数据卷的写日志。当接收到进入的写入请求时，可以确定是否启用特定数据卷的页面缓存写入日志记录。对于具有禁用页面缓存写入日志记录的写请求，可以更新页面缓存，并且可以确认写入请求，而不将描述更新的日志记录存储在页面缓存写入日志中。

12. 发明公开

EP2823401A1 DEDUPLICATING HYBRID STORAGE AGGREGATE 有权
标题翻译：重复数据删除HYBRID存储单元
公开(公告)号：EP2823401A1
公开(公告)日：2015-01-14
申请号：EP13757008.1
申请日：2013-03-06
申请人： NetApp, Inc.
发明人： SUNDARAM, Rajesh , DOUCETTE, Douglas, P. , DRONAMRAJU, Ravikanth
IPC分类号： G06F12/00 , G06F12/06 , G06F13/14
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/0685 , G06F12/0866 , G06F2212/217 , G06F2212/461
摘要： Methods and apparatuses for performing deduplication in a hybrid storage aggregate are provided. In one example, a method includes operating a hybrid storage aggregate that includes a plurality of tiers of different types of physical storage media. The method includes identifying a first storage block and a second storage block of the hybrid storage aggregate that contain identical data and identifying caching statuses of the first storage block and the second storage block. The method also includes deduplicating the first storage block and the second storage block based on the caching statuses of the first storage block and the second storage block.

13. 发明授权

EP2612250B1 METHOD AND SYSTEM FOR INSERTING CACHE BLOCKS 有权
标题翻译：方法和系统，用于创建锁存器模块
公开(公告)号：EP2612250B1
公开(公告)日：2014-08-20
申请号：EP11758008.4
申请日：2011-08-31
申请人： Oracle International Corporation
发明人： SWART, Garret, Frederick , VENGEROV, David
IPC分类号： G06F12/12 , G06F12/08
CPC分类号： G06F12/0888 , G06F12/0871 , G06F12/121 , G06F12/123 , G06F2212/461 , G06F2212/465

14. 发明公开

EP2612249A1 METHOD AND SYSTEM FOR REMOVING CACHE BLOCKS 有权
标题翻译： VERFAHREN UND SYSTEM ZUR ENTFERNUNG VONZWISCHENSPEICHERBLÖCKEN
公开(公告)号：EP2612249A1
公开(公告)日：2013-07-10
申请号：EP11758007.6
申请日：2011-08-31
申请人： Oracle International Corporation
发明人： SWART, Garret, Frederick , VENGEROV, David
IPC分类号： G06F12/12
CPC分类号： G06F12/0888 , G06F12/0871 , G06F12/121 , G06F12/123 , G06F2212/461 , G06F2212/465
摘要： A method of inserting cache blocks into a cache queue includes detecting a first cache miss for the cache queue, identifying a storage block receiving an access in response to the cache miss, calculating a first estimated cache miss cost for a first storage container that includes the storage block, calculating an insertion probability for the first storage container based on a mathematical formula of the first estimated cache miss cost, randomly selecting an insertion probability number from a uniform distribution, and inserting, in response to the insertion probability exceeding the insertion probability number, a new cache block corresponding to the storage block into the cache queue.
摘要翻译：将高速缓存块插入高速缓存队列的方法包括：计算高速缓存队列（1002）内的高速缓存块的估计高速缓存未命中的成本，从高速缓存队列中驱逐高速缓存块，插入对应于高速缓存块的存储块的条目变成与缓存队列相对应的影子列表，检测引用存储块（1000）的缓存队列的高速缓存未命中，访问影子列表内的条目，计算估计的高速缓存未命中成本阈值，并响应于所估计的高速缓存插入错过成本超过估计的高速缓存未命中成本阈值，对应于存储块的新的高速缓存块进入高速缓存队列（1006）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式