公开(公告)号：US08706971B1

公开(公告)日：2014-04-22

申请号：US13419881

申请日：2012-03-14

Applicant: Manoj Nayak

Inventor： Manoj Nayak

IPC: G06F12/00

CPC classification number: G06F12/0893 ,  G06F11/1453 ,  G06F12/0804 ,  G06F12/0873 ,  G06F12/0891 ,  G06F12/12 ,  G06F2212/154 ,  G06F2212/261 ,  G06F2212/313 ,  G06F2212/60 ,  G06F2212/70

Abstract: A storage system comprises a cache for caching data blocks and storage devices for storing blocks. A storage operating system may deduplicate sets of redundant blocks on the storage devices based on a deduplication requirement. Blocks in cache are typically deduplicated based on the deduplication on the storage devices. Sets of redundant blocks that have not met the deduplication requirement for storage devices and have not been deduplicated on the storage devices and cache are targeted for further deduplication processing. Sets of redundant blocks may be further deduplicated based on their popularity (number of accesses) in cache. If a set of redundant blocks in cache is determined to have a combined number of accesses being greater than a predetermined threshold number of accesses, the set of redundant blocks is determined to be “popular.” Popular sets of redundant blocks are selected for deduplication in cache and the storage devices.

Abstract translation: 存储系统包括用于缓存数据块的高速缓存和用于存储块的存储装置。 存储操作系统可以基于重复数据删除要求对存储设备上的冗余块进行重复数据删除。 缓存中的块通常基于存储设备上的重复数据删除来重复数据删除。 不符合存储设备重复数据删除要求且尚未在存储设备和缓存中进行重复数据删除的冗余块的集合将针对进一步的重复数据消除处理。 可以根据高速缓存中的受欢迎程度（访问次数）进一步对冗余块进行重复数据删除。 如果高速缓存中的一组冗余块被确定为具有大于预定阈值数量的访问的组合数量，那么该冗余块被确定为“受欢迎”。选择大量的冗余块组用于重复数据删除 缓存和存储设备。

公开(公告)号：US08825605B2

公开(公告)日：2014-09-02

申请号：US13270596

申请日：2011-10-11

Applicant: Manoj Nayak

Inventor： Manoj Nayak

IPC: G06F17/30

CPC classification number: G06F3/0613 ,  G06F3/0641 ,  G06F3/067

Abstract: Systems and methods for scheduling requests to access data may adjust the priority of such requests based on the presence of de-duplicated data blocks within the requested set of data blocks. A data de-duplication process operating on a storage device may build a de-duplication data map that stores information about the presence and location of de-duplicated data blocks on the storage drive. An I/O scheduler that manages the access requests can employ the de-duplicated data map to identify and quantify any de-duplicated data blocks within an access request. The I/O scheduler can then adjust the priority of the access request, based at least in part, on whether de-duplicated data blocks provide a large enough sequence of data blocks to reduce the likelihood that servicing the request, even if causing a head seek operation, will not reduce the overall global throughput of the storage system.

Abstract translation: 用于调度访问数据的请求的系统和方法可以基于所请求的数据块集合内的去重复数据块的存在来调整这样的请求的优先级。 在存储设备上操作的数据重复数据删除过程可以构建重复数据删除数据映射，其存储关于存储驱动器上的去重复数据块的存在和位置的信息。 管理访问请求的I / O调度器可以使用去重复的数据映射来识别和量化访问请求内的任何去重复的数据块。 至少部分地，I / O调度器可以调整访问请求的优先级，无论是否重复的数据块是否提供足够大的数据块序列，以减少服务请求的可能性，即使造成头部 寻求操作，不会降低存储系统的整体吞吐量。

公开(公告)号：US08732403B1

公开(公告)日：2014-05-20

申请号：US13419948

申请日：2012-03-14

Applicant: Manoj Nayak

Inventor： Manoj Nayak

IPC: G06F12/00

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F12/0833 ,  G06F12/0866 ,  G06F12/12

Abstract: A storage system comprises a cache for caching data blocks and storage devices for storing blocks. A storage operating system may deduplicate sets of redundant blocks on the storage devices based on a deduplication requirement. Blocks in cache are typically deduplicated based on the deduplication on the storage devices. Sets of redundant blocks that have not met the deduplication requirement for storage devices and have not been deduplicated on the storage devices and cache are targeted for further deduplication processing. Sets of redundant blocks may be further deduplicated based on their popularity (number of accesses) in cache. If a set of redundant blocks in cache is determined to have a combined number of accesses being greater than a predetermined threshold number of accesses, the set of redundant blocks is determined to be “popular.” Popular sets of redundant blocks are selected for deduplication in cache and the storage devices.

Abstract translation: 存储系统包括用于缓存数据块的高速缓存和用于存储块的存储装置。 存储操作系统可以基于重复数据删除要求对存储设备上的冗余块进行重复数据删除。 缓存中的块通常基于存储设备上的重复数据删除来重复数据删除。 不符合存储设备重复数据删除要求且尚未在存储设备和缓存中进行重复数据删除的冗余块的集合将针对进一步的重复数据消除处理。 可以根据高速缓存中的受欢迎程度（访问次数）进一步对冗余块进行重复数据删除。 如果高速缓存中的一组冗余块被确定为具有大于预定阈值访问次数的组合数量的访问，那么该冗余块被确定为“受欢迎”。选择流行的冗余块组用于重复数据删除 缓存和存储设备。

公开(公告)号：US20130091102A1

公开(公告)日：2013-04-11

申请号：US13270596

申请日：2011-10-11

Applicant: Manoj Nayak

Inventor： Manoj Nayak

IPC: G06F7/00

CPC classification number: G06F3/0613 ,  G06F3/0641 ,  G06F3/067

Abstract: Systems and methods for scheduling requests to access data may adjust the priority of such requests based on the presence of de-duplicated data blocks within the requested set of data blocks. A data de-duplication process operating on a storage device may build a de-duplication data map that stores information about the presence and location of de-duplicated data blocks on the storage drive. An I/O scheduler that manages the access requests can employ the de-duplicated data map to identify and quantify any de-duplicated data blocks within an access request. The I/O scheduler can then adjust the priority of the access request, based at least in part, on whether de-duplicated data blocks provide a large enough sequence of data blocks to reduce the likelihood that servicing the request, even if causing a head seek operation, will not reduce the overall global throughput of the storage system.

Abstract translation: 用于调度访问数据的请求的系统和方法可以基于所请求的数据块集合内的去重复数据块的存在来调整这样的请求的优先级。 在存储设备上操作的数据重复数据删除过程可以构建重复数据删除数据映射，其存储关于存储驱动器上的去重复数据块的存在和位置的信息。 管理访问请求的I / O调度器可以使用去重复的数据映射来识别和量化访问请求内的任何去重复的数据块。 至少部分地，I / O调度器可以调整访问请求的优先级，无论是否重复的数据块是否提供足够大的数据块序列，以减少服务请求的可能性，即使造成头部 寻求操作，不会降低存储系统的整体吞吐量。