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

1. 发明授权

US08996804B2 Optimizing and enhancing performance for parity based storage 有权
标题翻译：优化和提高基于奇偶校验的存储的性能
公开(公告)号：US08996804B2
公开(公告)日：2015-03-31
申请号：US13230248
申请日：2011-09-12
申请人： Rahul M. Fiske , Kalyan C. Gunda , Carl E. Jones , Sandeep R. Patil , Subhojit Roy
发明人： Rahul M. Fiske , Kalyan C. Gunda , Carl E. Jones , Sandeep R. Patil , Subhojit Roy
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G06F7/00 , G06F17/00 , G06F11/10
CPC分类号： G06F11/1076 , G06F11/1048 , G06F2211/1054
摘要： A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.
摘要翻译：提供了一种机制，用于优化和增强基于奇偶校验的存储，特别是独立磁盘（RAID）存储的冗余阵列的性能。该机制优化了重复性模式写入命令，以获得需要奇偶校验计算的存储配置的性能。该机制消除了对资源密集型并增加IO延迟的费力奇偶校验计算的需要。对于跨越RAID5或类似卷的整个条带的重复写入命令，该机制通过查看卷中的模式和列数来计算奇偶校验。该机制可以避免重复模式写入命令的XOR操作。该机制可以通过消除数据可靠性操作（如奇偶校验生成和写入）来增强使用重复模式写入命令的安全删除操作。

2. 发明申请

US20130067273A1 Optimizing and Enhancing Performance for Parity Based Storage 有权
公开(公告)号：US20130067273A1
公开(公告)日：2013-03-14
申请号：US13230248
申请日：2011-09-12
申请人： Rahul M. Fiske , Kalyan C. Gunda , Carl E. Jones , Sandeep R. Patil , Subhojit Roy
发明人： Rahul M. Fiske , Kalyan C. Gunda , Carl E. Jones , Sandeep R. Patil , Subhojit Roy
IPC分类号： G06F11/10
CPC分类号： G06F11/1076 , G06F11/1048 , G06F2211/1054
摘要： A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.

3. 发明授权

US09703500B2 Reducing power consumption by migration of data within a tiered storage system 有权
公开(公告)号：US09703500B2
公开(公告)日：2017-07-11
申请号：US13455183
申请日：2012-04-25
申请人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy , Andrew D. Walls
发明人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy , Andrew D. Walls
IPC分类号： G06F12/00 , G06F3/06
CPC分类号： G06F3/0625 , G06F3/0649 , G06F3/068 , Y02D10/154
摘要： Mechanisms identify one or more first storage devices in a first tier of the tiered storage system that may be placed in a minimal power consumption state and identify one or more data segments stored on the one or more first storage devices that are most likely to be accessed during a period of time in which the one or more first storage devices are in the minimal power consumption state. The mechanisms migrate the one or more data segments to one or more second storage devices in one of the first tier or a second tier of the storage system and place the one or more first storage devices in the minimal power consumption state. Access requests to the one or more data segments are serviced by the one or more second storage devices while the one or more first storage devices are in the minimal power consumption state.

4. 发明授权

US09009438B2 Space reclamation in multi-layered and thin provisioned storage systems 有权
标题翻译：多层次和精简配置存储系统中的空间回收
公开(公告)号：US09009438B2
公开(公告)日：2015-04-14
申请号：US13151140
申请日：2011-06-01
申请人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy
发明人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy
IPC分类号： G06F12/02 , G06F3/06
CPC分类号： G06F3/0608 , G06F3/0659 , G06F3/0665 , G06F3/067
摘要： An approach to efficient space reclamation in multi-layered thinly provisioned systems. A parent storage volume is thinly provisioned, and uses one or more child storage volumes that are also thinly provisioned for storage. A reclamation command sent to the device providing the parent thinly provisioned storage volume identifies that data has been released, and that the physical storage storing that data can be placed in a free pool and used to satisfy future write requests in the parent storage volume. An identify module identifies which child storage volumes supporting the parent storage volume are thinly provisioned. The data is released at the level of the parent storage volume, and the reclamation command is sent to the child storage volumes supporting the parent storage volume and that are themselves thinly provisioned. The storage is thus released by all affected thinly provisioned storage volumes, and not just the parent storage volume that received the reclamation command.
摘要翻译：一种在多层薄配置系统中高效空间回收的方法。父存储卷被稀疏地配置，并且使用一个或多个也被稀疏地配置用于存储的子存储卷。发送到提供父瘦的配置存储卷的设备的回收命令标识该数据已经被释放，并且存储该数据的物理存储可以被放置在空闲池中并用于满足父存储卷中的未来写入请求。识别模块识别支持父存储卷的哪个子存储卷被稀疏地配置。数据在父存储卷的级别被释放，并且回收命令被发送到支持父存储卷的子存储卷，并且本身被稀释地配置。因此，所有受影响的瘦配置存储卷都会释放存储空间，而不仅仅是接收到回收命令的父存储卷。

5. 发明申请

US20130290598A1 Reducing Power Consumption by Migration of Data within a Tiered Storage System 有权
标题翻译：通过分层存储系统中的数据迁移降低功耗
公开(公告)号：US20130290598A1
公开(公告)日：2013-10-31
申请号：US13455183
申请日：2012-04-25
申请人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy , Andrew D. Walls
发明人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy , Andrew D. Walls
IPC分类号： G06F12/02
CPC分类号： G06F3/0625 , G06F3/0649 , G06F3/068 , Y02D10/154
摘要： Mechanisms identify one or more first storage devices in a first tier of the tiered storage system that may be placed in a minimal power consumption state and identify one or more data segments stored on the one or more first storage devices that are most likely to be accessed during a period of time in which the one or more first storage devices are in the minimal power consumption state. The mechanisms migrate the one or more data segments to one or more second storage devices in one of the first tier or a second tier of the storage system and place the one or more first storage devices in the minimal power consumption state. Access requests to the one or more data segments are serviced by the one or more second storage devices while the one or more first storage devices are in the minimal power consumption state.
摘要翻译：机制识别分层存储系统的第一层中的一个或多个第一存储设备，其可以被置于最小功耗状态，并且识别存储在最可能被访问的一个或多个第一存储设备上的一个或多个数据段在一个或多个第一存储设备处于最小功耗状态的时间段期间。这些机制将一个或多个数据段迁移到存储系统的第一层或第二层之一中的一个或多个第二存储设备，并将一个或多个第一存储设备置于最小功耗状态。对一个或多个数据段的访问请求由一个或多个第二存储设备服务，而一个或多个第一存储设备处于最小功耗状态。

6. 发明申请

US20120311291A1 SPACE RECLAMATION IN MULTI-LAYERED AND THIN PROVISIONED STORAGE SYSTEMS 有权
标题翻译：多层次和稀薄存储系统中的空间恢复
公开(公告)号：US20120311291A1
公开(公告)日：2012-12-06
申请号：US13151140
申请日：2011-06-01
申请人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy
发明人： Rahul M. Fiske , Carl E. Jones , Subhojit Roy
IPC分类号： G06F12/02
CPC分类号： G06F3/0608 , G06F3/0659 , G06F3/0665 , G06F3/067
摘要： An approach to efficient space reclamation in multi-layered thinly provisioned systems. A parent storage volume is thinly provisioned, and uses one or more child storage volumes that are also thinly provisioned for storage. A reclamation command sent to the device providing the parent thinly provisioned storage volume identifies that data has been released, and that the physical storage storing that data can be placed in a free pool and used to satisfy future write requests in the parent storage volume. An identify module identifies which child storage volumes supporting the parent storage volume are thinly provisioned. The data is released at the level of the parent storage volume, and the reclamation command is sent to the child storage volumes supporting the parent storage volume and that are themselves thinly provisioned. The storage is thus released by all affected thinly provisioned storage volumes, and not just the parent storage volume that received the reclamation command.
摘要翻译：一种在多层薄配置系统中高效空间回收的方法。父存储卷被稀疏地配置，并且使用一个或多个也被稀疏地配置用于存储的子存储卷。发送到提供父瘦的配置存储卷的设备的回收命令标识该数据已经被释放，并且存储该数据的物理存储可以被放置在空闲池中并用于满足父存储卷中的未来写入请求。识别模块识别支持父存储卷的哪个子存储卷被稀疏地配置。数据在父存储卷的级别被释放，并且回收命令被发送到支持父存储卷的子存储卷，并且本身被稀释地配置。因此，所有受影响的瘦配置存储卷都会释放存储空间，而不仅仅是接收到回收命令的父存储卷。

7. 发明授权

US09058120B2 Setting optimal space allocation policy for creating dependent snapshots to enhance application write performance and reduce resource usage 有权
标题翻译：设置最佳的空间分配策略来创建依赖的快照，以增强应用程序的写入性能并减少资源的使用
公开(公告)号：US09058120B2
公开(公告)日：2015-06-16
申请号：US13292335
申请日：2011-11-09
申请人： Rahul M. Fiske , Subhojit Roy
发明人： Rahul M. Fiske , Subhojit Roy
IPC分类号： G06F12/00 , G06F13/00 , G06F3/06 , G06F17/30
CPC分类号： G06F3/0619 , G06F3/061 , G06F3/0643 , G06F3/065 , G06F3/0662 , G06F3/0665 , G06F3/067 , G06F3/0685 , G06F17/30088 , G06F2003/0692 , G06F2003/0698
摘要： In one embodiment, a system includes a network storage controller having logic adapted for receiving a request to duplicate at least a portion of a volume stored on the first disk array, logic adapted for creating at least one dependent volume on the first disk array, and logic adapted for duplicating the at least the portion of the volume to the at least one dependent volume on the first disk array to create a snapshot. Other systems, computer program products, and methods are described according to more embodiments.
摘要翻译：在一个实施例中，系统包括网络存储控制器，其具有适于接收复制存储在第一磁盘阵列上的卷的至少一部分的请求的逻辑，适用于在第一磁盘阵列上创建至少一个从属卷的逻辑，以及逻辑适于将该卷的至少一部分复制到第一磁盘阵列上的至少一个从属卷以创建快照。根据更多实施例描述其他系统，计算机程序产品和方法。

8. 发明授权

US09262428B2 Preserving redundancy in data deduplication systems by designation of virtual address 有权
标题翻译：通过指定虚拟地址来保护重复数据删除系统中的冗余
公开(公告)号：US09262428B2
公开(公告)日：2016-02-16
申请号：US13453266
申请日：2012-04-23
申请人： Rahul M. Fiske , Carl Evan Jones , Subhojit Roy
发明人： Rahul M. Fiske , Carl Evan Jones , Subhojit Roy
IPC分类号： G06F17/30 , G06F3/06
CPC分类号： G06F17/30156 , G06F3/061 , G06F3/0641 , G06F17/30233 , G06F17/30371
摘要： Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.
摘要翻译：提供了用于在计算环境中的用于在重复数据删除系统中保持相同数据的数据冗余的各种实施例。将计算环境中的虚拟存储设备的虚拟地址的选定范围指定为不进行重复数据删除操作。公开了其他系统和计算机程序产品实施例并提供相关优点。

9. 发明授权

US09779103B2 Preserving redundancy in data deduplication systems 有权
公开(公告)号：US09779103B2
公开(公告)日：2017-10-03
申请号：US13453252
申请日：2012-04-23
申请人： Rahul M. Fiske , Carl Evan Jones , Subhojit Roy
发明人： Rahul M. Fiske , Carl Evan Jones , Subhojit Roy
IPC分类号： G06F17/30 , G06F3/06
CPC分类号： G06F17/30371 , G06F3/0608 , G06F3/0619 , G06F3/0641 , G06F3/0659 , G06F3/0689 , G06F17/30156 , G06F17/30339 , G06F17/30377
摘要： Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation, such that repetitive data can be written and stored on physical locations despite being identical.

10. 发明授权

US09417811B2 Efficient inline data de-duplication on a storage system 有权
标题翻译：存储系统上的高效内联数据重复数据删除
公开(公告)号：US09417811B2
公开(公告)日：2016-08-16
申请号：US13414247
申请日：2012-03-07
申请人： Rahul M. Fiske , Subhojit Roy , Andrew D. Walls
发明人： Rahul M. Fiske , Subhojit Roy , Andrew D. Walls
IPC分类号： G06F12/00 , G06F3/06 , G06F12/08
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F12/00 , G06F12/0866 , G06F2212/1024
摘要： A mechanism is provided in a storage system for efficient inline data de-duplication. The mechanism receives a write command and a hash key for a portion of data to be written from an application host to a write address. The write command indicates whether the application host is tolerant or intolerant to data loss. Responsive to the write command indicating the application host is tolerant to data loss, the mechanism performs a hash key lookup in a hash index. The mechanism determines whether the portion of data has previously been written to the storage system. Responsive to determining the portion of data has previously been written to the storage system, the mechanism stores a pointer to the previously written data at the write address.
摘要翻译：在存储系统中提供了用于有效的内联数据重复数据删除的机制。该机制接收用于要从应用主机写入写入地址的数据的一部分的写入命令和散列密钥。 write命令指示应用程序主机是否容忍或不容忍数据丢失。响应于指示应用主机的写入命令容忍数据丢失，该机制在散列索引中执行散列密钥查找。该机制确定数据的部分是否已经被写入存储系统。响应于确定数据部分以前已经写入存储系统，该机制存储指向写地址处的先前写入数据的指针。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式