-
公开(公告)号：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.
摘要翻译： 存储服务器实现基于范围的存储架构。 存储服务器生成新的盘区标识符，用于克隆由源盘区标识符识别的源盘区，并存储在源数据结构中，源数据结构包括提供源盘区长度的长度值，偏移值和引用计数值， 参考源盘区标识符的数据容器数。 存储服务器更新用于存储指向源盘区标识符的新盘区标识符的数据容器的克隆版本的数据结构，并且包括与长度值不同的盘区长度值和偏移值以及源数据结构的偏移值 。
-
公开(公告)号：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.
摘要翻译： 一种用于在存储系统中有效地处理部分写入请求的方法包括：为新的部分数据分配新的数据块，以及在扩展图中分配记录来记录新的部分数据块的位置，旧的部分数据块的位置 数据块和每个数据块的偏移量。 当系统资源可用时，数据块可以在后台重新打包。 通过将新数据写入新分配的数据块并且在扩展图中分配新记录以记录对应于两个部分写入操作的信息，也可以有效地处理完整的但未对准的写入请求。
-
3.发明授权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.
摘要翻译： 通过接收来自客户机的压缩组中的数据块的写请求来实现不对压缩数据进行解压缩的部分压缩数据，其中压缩组包括被压缩的一组数据块，其中， 数据未压缩。 存储服务器部分地覆盖压缩组，其中在执行部分重写的同时，压缩组保持压缩。 存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。 如果部分覆盖的压缩组不应被压缩，则存储服务器会延迟部分覆盖压缩组的压缩。 如果部分覆盖的压缩组应该被压缩，存储服务器会压缩部分覆盖的压缩组。
-
公开(公告)号：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.
摘要翻译： 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。
-
公开(公告)号：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.
摘要翻译： 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。
-
公开(公告)号：US09043555B1
公开(公告)日：2015-05-26
申请号：US12392994
申请日：2009-02-25
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/0683 , G06F12/0871 , G06F2212/1016 , G06F2212/262 , G06F2212/263 , G06F2212/312 , G06F2212/463
摘要： Provided is a method and system for reducing duplicate buffers in buffer cache associated with a storage device. Reducing buffer duplication in a buffer cache includes accessing a file reference pointer associated with a file in a deduplicated filesystem when attempting to load a requested data block from the file into the buffer cache. To determine if the requested data block is already in the buffer cache, aspects of the invention compare a fingerprint that identifies the requested data block against one or more fingerprints identifying a corresponding one or more sharable data blocks in the buffer cache. A match between the fingerprint of the requested data block and the fingerprint from a sharable data block in the buffer cache indicates that the requested data block is already loaded in buffer cache. The sharable data block in buffer cache is used instead thereby reducing buffer duplication in the buffer cache.
摘要翻译： 提供了一种用于减少与存储设备相关联的缓冲器高速缓存中的重复缓冲器的方法和系统。 减少缓冲区高速缓存中的重复数据包括在尝试将所请求的数据块从文件加载到缓冲区高速缓存中时访问与重复数据删除的文件系统中的文件相关联的文件引用指针。 为了确定所请求的数据块是否已经在缓冲区高速缓存中，本发明的各方面将识别所请求的数据块的指纹与标识缓冲区高速缓存中相应的一个或多个可共享数据块的一个或多个指纹进行比较。 所请求的数据块的指纹与来自缓冲器高速缓存器中的可共享数据块的指纹之间的匹配指示所请求的数据块已经被加载到缓冲器高速缓存中。 使用缓冲区高速缓存中的可共享数据块，从而减少缓冲区高速缓存中的缓冲区重复。
-
公开(公告)号：US09454440B2
公开(公告)日：2016-09-27
申请号：US11084679
申请日：2005-03-18
申请人： Ajay Pratap Singh Kushwah , Akhil Kaushik , Jian Xing , Mayank Joshi , Pashupati Kumar , Subramaniam Periyagaram , Rangarajan Suryanarayanan , Yogita Bijani
发明人： Ajay Pratap Singh Kushwah , Akhil Kaushik , Jian Xing , Mayank Joshi , Pashupati Kumar , Subramaniam Periyagaram , Rangarajan Suryanarayanan , Yogita Bijani
CPC分类号： G06F11/1471 , G06F3/067 , G06F11/1458
摘要： A method for information management comprises intercepting an output from an application; distributing packets according to a routing scheme, wherein the packets are associated with the output, and wherein distributing the packets may occur when the application is associated with a first operating system, and may also occur when the application is associated with a second operating system; and storing the packets.
摘要翻译： 一种用于信息管理的方法，包括拦截应用程序的输出; 根据路由方案分发分组，其中分组与输出相关联，并且其中分发分组可以在应用与第一操作系统相关联时发生，并且还可以在应用与第二操作系统相关联时发生; 并存储分组。
-
公开(公告)号：US20080177805A1
公开(公告)日：2008-07-24
申请号：US11084065
申请日：2005-03-18
申请人： Ajay Pratap Singh Kushwah , Akhil Kaushik , Jian Xing , Mayank Joshi , Pashupati Kumar , Subramaniam Periyagaram , Rangarajan Suryanarayanan , Yogita Bijani
发明人： Ajay Pratap Singh Kushwah , Akhil Kaushik , Jian Xing , Mayank Joshi , Pashupati Kumar , Subramaniam Periyagaram , Rangarajan Suryanarayanan , Yogita Bijani
IPC分类号： G06F17/30
CPC分类号： G06F11/1471 , G06F3/067 , G06F11/1458
摘要： A method for information management comprises monitoring output from an application to an operating system, wherein the output is monitored substantially continuously; determining if a policy applies to data associated with the output; and executing the policy if the policy applies.
摘要翻译： 一种用于信息管理的方法包括监视从应用程序到操作系统的输出，其中输出被基本连续地监视; 确定策略是否适用于与输出相关联的数据; 并在策略适用的情况下执行策略。
-
-
-
-
-
-
-
-
-
搜索结果
17 条记录 (耗时 0.025 秒)