-
公开(公告)号：EP3391221A1
公开(公告)日：2018-10-24
申请号：EP16819251.6
申请日：2016-12-09
IPC分类号： G06F11/10
摘要： Recovery requests are scheduled and prioritized according to priority valuations of the minimum time to next failure relative to the minimum time to next recovery for corresponding storage data sets. The prioritization can be performed by an upper layer recovery scheduler that dispatches requests to different storage units and/or by lower layers and individual storage unit schedulers. Prioritizations can be reflected in tagging on recovery requests, as determined by a first entity, and/or determined dynamically at the point of dispatch and processing.
-
-
-
公开(公告)号：EP3175348A1
公开(公告)日：2017-06-07
申请号：EP15748380.1
申请日：2015-07-24
IPC分类号： G06F3/06
摘要： A system is configured to use a de-randomizer and budget data structure to economize I/O operations for a shared storage device while still allowing access to the device to a number of different entities. Embodiments can identify a comparatively low cost next operation as compared to other I/O operations, including a cost for seek time, for a first entity to dispatch to the storage device when the first entity has sufficient budget to have the I/O operation performed on its behalf and to identify an I/O operation for a second entity to dispatch to the storage device when there is insufficient budget for the first entity.
摘要翻译： 系统被配置为使用去随机化器和预算数据结构来节约共享存储设备的I / O操作，同时仍然允许将设备访问到多个不同的实体。 当第一实体具有足够的预算以执行I / O操作时，实施例可以识别与第一实体向存储设备分派的其他I / O操作（包括搜寻时间的成本）相比相对较低成本的下一操作 并且当第一实体的预算不足时识别第二实体向存储设备分派的I / O操作
-
-
-
搜索结果
4 条记录 (耗时 0.011 秒)
