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

1. 发明申请

US20120330903A1 DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE 有权
标题翻译：在基于结构的架构中的分类
公开(公告)号：US20120330903A1
公开(公告)日：2012-12-27
申请号：US13165631
申请日：2011-06-21
申请人： Subramaniam Periyagaram , Sandeep Yadav , Blake Lewis , Rickard E. Faith , Ashish Prakash , Ram Kesavan , Ananthan Subramanian
发明人： Subramaniam Periyagaram , Sandeep Yadav , Blake Lewis , Rickard E. Faith , Ashish Prakash , Ram Kesavan , Ananthan Subramanian
IPC分类号： G06F7/00
CPC分类号： G06F17/30156 , G06F3/0608 , G06F3/0641
摘要： A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
摘要翻译：收到请求以删除重复的数据。访问与存储服务器中的存储卷相关联的日志数据容器。日志数据容器包括多个条目。每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。如果供体范围的参考计数等于第二预定值，则确定。如果供体范围的参考计数等于第二预定值，则供体范围被释放。

2. 发明授权

US08600949B2 Deduplication in an extent-based architecture 有权
标题翻译：基于范围的架构中的重复数据删除
公开(公告)号：US08600949B2
公开(公告)日：2013-12-03
申请号：US13165631
申请日：2011-06-21
申请人： Subramaniam Periyagaram , Sandeep Yadav , Blake Lewis , Rickard E. Faith , Ashish Prakash , Ram Kesavan , Ananthan Subramanian
发明人： Subramaniam Periyagaram , Sandeep Yadav , Blake Lewis , Rickard E. Faith , Ashish Prakash , Ram Kesavan , Ananthan Subramanian
IPC分类号： G06F17/30
CPC分类号： G06F17/30156 , G06F3/0608 , G06F3/0641
摘要： A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.
摘要翻译：收到请求以删除重复的数据。访问与存储服务器中的存储卷相关联的日志数据容器。日志数据容器包括多个条目。每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。如果供体范围的参考计数等于第二预定值，则确定。如果供体范围的参考计数等于第二预定值，则供体范围被释放。

3. 发明授权

US08918378B1 Cloning using an extent-based architecture 有权
标题翻译：克隆使用基于范围的架构
公开(公告)号：US08918378B1
公开(公告)日：2014-12-23
申请号：US13223226
申请日：2011-08-31
申请人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis
发明人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F3/0626 , G06F3/065 , G06F3/067
摘要： An extent-based storage architecture is implemented by a storage server. The storage server generates a new extent identifier for cloning a source extent identified by a source extent identifier and stored at a source data structure that includes a length value providing a length of the source extent, an offset value and a reference count value that provides a number of data containers that reference the source extent identifier. The storage server updates a data structure for a cloned version of the data container for storing the new extent identifier that points to the source extent identifier and includes an extent length value and offset value different from length value and the offset value of the source data structure.
摘要翻译：存储服务器实现基于范围的存储架构。存储服务器生成新的盘区标识符，用于克隆由源盘区标识符识别的源盘区，并存储在源数据结构中，源数据结构包括提供源盘区长度的长度值，偏移值和引用计数值，参考源盘区标识符的数据容器数。存储服务器更新用于存储指向源盘区标识符的新盘区标识符的数据容器的克隆版本的数据结构，并且包括与长度值不同的盘区长度值和偏移值以及源数据结构的偏移值。

4. 发明授权

US08745338B1 Overwriting part of compressed data without decompressing on-disk compressed data 有权
标题翻译：在不压缩磁盘压缩数据的情况下覆盖部分压缩数据
公开(公告)号：US08745338B1
公开(公告)日：2014-06-03
申请号：US13099283
申请日：2011-05-02
申请人： Sandeep Yadav , Rickard E. Faith , Subramaniam Periyagaram , Blake Lewis , Ashish Prakash
发明人： Sandeep Yadav , Rickard E. Faith , Subramaniam Periyagaram , Blake Lewis , Ashish Prakash
IPC分类号： G06F3/044 , G06F17/30
CPC分类号： G06F3/064 , G06F3/061 , G06F3/0619 , G06F3/067 , G06F3/0689 , G06F17/30153 , G06F2211/1014 , G06F2212/401
摘要： Overwriting part of compressed data without decompressing on-disk compressed data is implemented by receiving a write request for a block of data in a compression group from a client, wherein the compression group comprises a group of data blocks that is compressed, wherein the block of data is uncompressed. The storage server partially overwrites the compression group, wherein the compression group remains compressed while the partial overwriting is performed. The storage server determines whether the partially overwritten compression group including the uncompressed block of data should be compressed. The storage server defers compression of the partially overwritten compression group if the partially overwritten compression group should not be compressed. The storage server compresses the partially overwritten compression group if the partially overwritten compression group should be compressed.
摘要翻译：通过接收来自客户机的压缩组中的数据块的写请求来实现不对压缩数据进行解压缩的部分压缩数据，其中压缩组包括被压缩的一组数据块，其中，数据未压缩。存储服务器部分地覆盖压缩组，其中在执行部分重写的同时，压缩组保持压缩。存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。如果部分覆盖的压缩组不应被压缩，则存储服务器会延迟部分覆盖压缩组的压缩。如果部分覆盖的压缩组应该被压缩，存储服务器会压缩部分覆盖的压缩组。

5. 发明授权

US08539008B2 Extent-based storage architecture 有权
标题翻译：基于范围的存储架构
公开(公告)号：US08539008B2
公开(公告)日：2013-09-17
申请号：US13098310
申请日：2011-04-29
申请人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis , Jeff Kimmel , Steve Daniel
发明人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis , Jeff Kimmel , Steve Daniel
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F3/064 , G06F3/061 , G06F3/0644 , G06F3/0689 , G06F17/30091 , G06F17/30203
摘要： An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.
摘要翻译：基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的。存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

6. 发明申请

US20120278382A1 EXTENT-BASED STORAGE ARCHITECTURE 有权
标题翻译：基于EXTENT的存储架构
公开(公告)号：US20120278382A1
公开(公告)日：2012-11-01
申请号：US13098310
申请日：2011-04-29
申请人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis , Jeff Kimmel , Steve Daniel
发明人： Rickard E. Faith , Subramaniam Periyagaram , Sandeep Yadav , Ashish Prakash , Blake Lewis , Jeff Kimmel , Steve Daniel
IPC分类号： G06F15/16
CPC分类号： G06F3/064 , G06F3/061 , G06F3/0644 , G06F3/0689 , G06F17/30091 , G06F17/30203
摘要： An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.
摘要翻译：基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的。存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

7. 发明申请

US20120131286A1 DYNAMIC DETECTION AND REDUCTION OF UNALIGNED I/O OPERATIONS 有权
标题翻译：动态检测和减少UNALIGN I / O操作
公开(公告)号：US20120131286A1
公开(公告)日：2012-05-24
申请号：US12950392
申请日：2010-11-19
申请人： Rickard E. Faith , Matthew D. Hambrick , Matti A. Vanninen
发明人： Rickard E. Faith , Matthew D. Hambrick , Matti A. Vanninen
IPC分类号： G06F12/00
CPC分类号： H04L67/1097 , G06F3/0613 , G06F3/0629 , G06F3/064 , G06F3/067
摘要： Detection and reduction of unaligned input/output (“I/O”) requests is implemented by a storage server determining an alignment value for data stored by the server within a storage system on behalf of a first client, writing the alignment value to a portion of the volume that stores the data for the first client, but not to a portion of the volume that stores data for a second client, and changing a location of data within the portion of the volume that stores the data for the first client, but not a location of data in the portion of the volume that stores data for the second client, to an alignment corresponding to the alignment value. The alignment value is applied to I/O requests directed to the portion of the volume that stores the data blocks for the first client after the location of the data blocks has been changed.
摘要翻译：检测和减少未对齐的输入/输出（“I / O”）请求由存储服务器实现，该存储服务器代表第一客户机确定存储系统内的服务器所存储的数据的对准值，将对准值写入一部分存储第一客户端的数据的卷，而不存储存储第二客户端的数据的卷的一部分，以及改变存储第一客户端的数据的卷的部分内的数据的位置，但是不是将存储第二客户端的数据的卷的部分中的数据的位置设置为与对齐值相对应的对齐。在数据块的位置已经改变之后，对齐值被应用于指向存储第一客户端的数据块的卷部分的I / O请求。

8. 发明授权

US08156290B1 Just-in-time continuous segment cleaning 有权
标题翻译：即时连续段清洗
公开(公告)号：US08156290B1
公开(公告)日：2012-04-10
申请号：US12429108
申请日：2009-04-23
申请人： Matti Vanninen , Rickard E. Faith
发明人： Matti Vanninen , Rickard E. Faith
IPC分类号： G06F13/00
CPC分类号： G06F3/061 , G06F3/064 , G06F3/0652 , G06F3/0683 , G06F2206/1004
摘要： Just-in-time segment cleaning obtains the location of blocks of a storage system predicted to be targeted by a future write operation and cleans the blocks targeted for the future write operation prior to the occurrence of the future write operation. In one aspect, just-in-time segment cleaning is performed in proportion to previous user-initiated write operations. In another aspect, just-in-time segment cleaning applies a cost analysis determination to minimize the work of cleaning.
摘要翻译：即时段清除获得预测为将来写入操作所针对的存储系统的块的位置，并且在将来写入操作发生之前清除针对未来写入操作的块。在一个方面，按照先前的用户启动的写操作来执行即时段清除。在另一方面，即时段清洁应用成本分析确定以最小化清洁的工作。

9. 发明授权

US08484433B2 Dynamic detection and reduction of unaligned I/O operations 有权
标题翻译：动态检测和减少未对齐的I / O操作
公开(公告)号：US08484433B2
公开(公告)日：2013-07-09
申请号：US12950392
申请日：2010-11-19
申请人： Rickard E. Faith , Matthew D. Hambrick , Matti A. Vanninen
发明人： Rickard E. Faith , Matthew D. Hambrick , Matti A. Vanninen
IPC分类号： G06F12/06
CPC分类号： H04L67/1097 , G06F3/0613 , G06F3/0629 , G06F3/064 , G06F3/067
摘要： Detection and reduction of unaligned input/output (“I/O”) requests is implemented by a storage server determining an alignment value for data stored by the server within a storage system on behalf of a first client, writing the alignment value to a portion of the volume that stores the data for the first client, but not to a portion of the volume that stores data for a second client, and changing a location of data within the portion of the volume that stores the data for the first client, but not a location of data in the portion of the volume that stores data for the second client, to an alignment corresponding to the alignment value. The alignment value is applied to I/O requests directed to the portion of the volume that stores the data blocks for the first client after the location of the data blocks has been changed.
摘要翻译：检测和减少未对齐的输入/输出（“I / O”）请求由存储服务器实现，该存储服务器代表第一客户机确定存储系统内的服务器所存储的数据的对准值，将对准值写入一部分存储第一客户端的数据的卷，而不存储存储第二客户端的数据的卷的一部分，以及改变存储第一客户端的数据的卷的部分内的数据的位置，但是不是将存储第二客户端的数据的卷的部分中的数据的位置设置为与对齐值相对应的对齐。在数据块的位置已经改变之后，对齐值被应用于指向存储第一客户端的数据块的卷部分的I / O请求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式