Cloning using an extent-based architecture
    1.
    发明授权
    Cloning using an extent-based architecture 有权
    克隆使用基于范围的架构

    公开(公告)号:US08918378B1

    公开(公告)日:2014-12-23

    申请号:US13223226

    申请日:2011-08-31

    IPC分类号: G06F7/00 G06F17/00

    摘要: 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.

    摘要翻译: 存储服务器实现基于范围的存储架构。 存储服务器生成新的盘区标识符,用于克隆由源盘区标识符识别的源盘区,并存储在源数据结构中,源数据结构包括提供源盘区长度的长度值,偏移值和引用计数值, 参考源盘区标识符的数据容器数。 存储服务器更新用于存储指向源盘区标识符的新盘区标识符的数据容器的克隆版本的数据结构,并且包括与长度值不同的盘区长度值和偏移值以及源数据结构的偏移值 。

    Partial write without read-modify
    2.
    发明授权
    Partial write without read-modify 有权
    部分写入无需修改

    公开(公告)号:US08843711B1

    公开(公告)日:2014-09-23

    申请号:US13338333

    申请日:2011-12-28

    摘要: 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.

    摘要翻译: 一种用于在存储系统中有效地处理部分写入请求的方法包括:为新的部分数据分配新的数据块,以及在扩展图中分配记录来记录新的部分数据块的位置,旧的部分数据块的位置 数据块和每个数据块的偏移量。 当系统资源可用时,数据块可以在后台重新打包。 通过将新数据写入新分配的数据块并且在扩展图中分配新记录以记录对应于两个部分写入操作的信息,也可以有效地处理完整的但未对准的写入请求。

    Overwriting part of compressed data without decompressing on-disk compressed data
    6.
    发明授权
    Overwriting part of compressed data without decompressing on-disk compressed data 有权
    在不压缩磁盘压缩数据的情况下覆盖部分压缩数据

    公开(公告)号:US08745338B1

    公开(公告)日:2014-06-03

    申请号:US13099283

    申请日:2011-05-02

    IPC分类号: G06F3/044 G06F17/30

    摘要: 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.

    摘要翻译: 通过接收来自客户机的压缩组中的数据块的写请求来实现不对压缩数据进行解压缩的部分压缩数据,其中压缩组包括被压缩的一组数据块,其中, 数据未压缩。 存储服务器部分地覆盖压缩组,其中在执行部分重写的同时,压缩组保持压缩。 存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。 如果部分覆盖的压缩组不应被压缩,则存储服务器会延迟部分覆盖压缩组的压缩。 如果部分覆盖的压缩组应该被压缩,存储服务器会压缩部分覆盖的压缩组。

    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE
    8.
    发明申请
    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE 有权
    在基于结构的架构中的分类

    公开(公告)号:US20120330903A1

    公开(公告)日:2012-12-27

    申请号:US13165631

    申请日:2011-06-21

    IPC分类号: G06F7/00

    摘要: 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.

    摘要翻译: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目,确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配,则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值,则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值,则确定。 如果供体范围的参考计数等于第二预定值,则供体范围被释放。