-
公开(公告)号：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.
摘要翻译： 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。
-
公开(公告)号：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.
摘要翻译： 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。
-
公开(公告)号：US08918378B1
公开(公告)日：2014-12-23
申请号：US13223226
申请日：2011-08-31
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.发明授权Overwriting part of compressed data without decompressing on-disk compressed data 有权在不压缩磁盘压缩数据的情况下覆盖部分压缩数据公开(公告)号：US08745338B1
公开(公告)日：2014-06-03
申请号：US13099283
申请日：2011-05-02
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.
摘要翻译： 通过接收来自客户机的压缩组中的数据块的写请求来实现不对压缩数据进行解压缩的部分压缩数据，其中压缩组包括被压缩的一组数据块，其中， 数据未压缩。 存储服务器部分地覆盖压缩组，其中在执行部分重写的同时，压缩组保持压缩。 存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。 如果部分覆盖的压缩组不应被压缩，则存储服务器会延迟部分覆盖压缩组的压缩。 如果部分覆盖的压缩组应该被压缩，存储服务器会压缩部分覆盖的压缩组。
-
公开(公告)号：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
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.
摘要翻译： 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。
-
公开(公告)号：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.
摘要翻译： 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。
-
公开(公告)号：US08843711B1
公开(公告)日：2014-09-23
申请号：US13338333
申请日：2011-12-28
CPC分类号： G06F3/0608 , G06F3/061 , G06F3/064 , G06F3/0674 , G06F2212/401
摘要： A method for efficiently handling partial write requests in a storage system includes allocating a new block of data for the new partial data, and allocating a record in an extent map to record the location of the new partial data block, the location of the old partial data block and the offset length for each data block. Data blocks can be repackaged in the background when system resources are available. A full, but misaligned write request is also efficiently handled by writing the new data to a newly allocated data block and allocating new records in an extent map to record information corresponding to two partial write operations.
摘要翻译： 一种用于在存储系统中有效地处理部分写入请求的方法包括：为新的部分数据分配新的数据块，以及在扩展图中分配记录来记录新的部分数据块的位置，旧的部分数据块的位置 数据块和每个数据块的偏移量。 当系统资源可用时，数据块可以在后台重新打包。 通过将新数据写入新分配的数据块并且在扩展图中分配新记录以记录对应于两个部分写入操作的信息，也可以有效地处理完整的但未对准的写入请求。
-
8.发明申请HANDLING DATA EXTENT SIZE ASYMMETRY DURING LOGICAL REPLICATION IN A STORAGE SYSTEM 审中-公开在存储系统中的逻辑复制期间处理数据量大小不对称公开(公告)号：US20130073519A1
公开(公告)日：2013-03-21
申请号：US13237760
申请日：2011-09-20
申请人： Blake Lewis , John K. Edwards , Vijay Deshmukh , Kapil Kumar , Rajesh Desai
发明人： Blake Lewis , John K. Edwards , Vijay Deshmukh , Kapil Kumar , Rajesh Desai
IPC分类号： G06F17/30
CPC分类号： G06F17/30215 , G06F3/0608 , G06F3/0641 , G06F3/067 , G06F11/2094 , G06F11/2097
摘要： A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.
摘要翻译： 公开了一种名称数据的技术，以允许通过复制关系中的源和目的地之间的链路以及在目的地的存储来保持存储效率。 该技术允许源将命名数据发送到目的地一次，并在将来多次引用它，而不必重新发送数据。 该技术还允许数据扩展区的传输与引用数据扩展区的逻辑容器进行解耦。 此外，该技术允许复制系统适应复制源和目的地之间的不同扩展大小，同时保持存储效率。
-
公开(公告)号：US20100138394A1
公开(公告)日：2010-06-03
申请号：US12698223
申请日：2010-02-02
申请人： David Hitz , John Edwards , Blake Lewis
发明人： David Hitz , John Edwards , Blake Lewis
CPC分类号： G06F17/30067 , G06F2201/84 , Y10S707/99931 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953
摘要： A method and apparatus for operating a data storage system is disclosed. An original active file system holds incoming write transactions. Data is written at a selected time to blocks in a data storage device of the original active file system, the data written to blocks which do not hold old data of the data storage system. Pointers to data of the original active file system are written at the selected time to the data storage device, the pointers written to blocks which do not hold old data of the data storage system, the pointers and a previously saved data of the active file system forming a consistency point of the original active file system at the selected time. A new active file system is started using the consistency point of the original active file system at the selected time.
摘要翻译： 公开了一种用于操作数据存储系统的方法和装置。 原始活动文件系统保存传入的写入事务。 在选定的时间写入数据以在原始活动文件系统的数据存储装置中阻塞数据，该数据被写入不保存数据存储系统的旧数据的块。 原始活动文件系统的数据指针在选定的时间被写入数据存储装置，指针写入不保存数据存储系统的旧数据的块，指针和活动文件系统之前保存的数据 在选定的时间形成原始活动文件系统的一致性点。 在所选择的时间，使用原始活动文件系统的一致性点启动新的活动文件系统。
-
公开(公告)号：US07454445B2
公开(公告)日：2008-11-18
申请号：US09932578
申请日：2001-08-17
CPC分类号： G06F11/14 , G06F11/1435 , G06F2201/84 , Y10S707/99931 , Y10S707/99956
摘要： The invention provides an improved method and apparatus for creating a snapshot of a file system. A “copy-on-write” mechanism is used. The snapshot uses the same blocks as the active file system until the active file system is modified. Whenever a modification occurs, the modified data is copied to a new block and the old data is saved. In this way, the snapshot only uses space where it differs from the active file system, and the amount of work required to create the snapshot is small. A record of which blocks are being used by the snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion. A snapshot can also be deleted instantaneously simply by discarding its root inode.
摘要翻译： 本发明提供了一种用于创建文件系统的快照的改进的方法和装置。 使用“写时复制”机制。 快照使用与活动文件系统相同的块，直到活动文件系统被修改为止。 每当发生修改时，修改的数据将被复制到新的块，并保存旧的数据。 以这种方式，快照只使用与活动文件系统不同的空间，创建快照所需的工作量很小。 快照中使用哪些块的记录包含在快照本身中，可以有效地即时创建和删除快照。 也可以通过丢弃其根节点来即时删除快照。
-
-
-
-
-
-
-
-
-
搜索结果
26 条记录 (耗时 0.029 秒)
