-
51.发明授权Data placement technique for striping data containers across volumes of a storage system cluster 有权用于在存储系统集群的卷上分条数据容器的数据放置技术公开(公告)号：US08032704B1
公开(公告)日：2011-10-04
申请号：US12533633
申请日：2009-07-31
CPC分类号： G06F3/0607 , G06F3/0646 , G06F3/0689 , G06F11/1096
摘要： A method and apparatus for storing data on a computer data storage system are described. Two or more computers are coupled together to form a cluster of computers. One or more data storage devices are coupled to the two or more computers. One or more volumes of data storage devices are implemented on a plurality of computers of the two or more computers, where each volume is a logical arrangement of the one or more storage devices coupled to a selected computer of the plurality of computers. A data container holds data stored by the data storage system. The data container is striped over a plurality of the one or more volumes of data storage devices, whereby data stored in the data container is striped over a plurality of the volumes of data storage devices.
摘要翻译： 描述了一种在计算机数据存储系统上存储数据的方法和装置。 两台或多台计算机耦合在一起以形成一组计算机。 一个或多个数据存储设备耦合到两个或更多个计算机。 在两个或多个计算机的多个计算机上实现一个或多个数据存储设备，其中每个卷是耦合到多个计算机中的所选计算机的一个或多个存储设备的逻辑布置。 数据容器保存数据存储系统存储的数据。 数据容器在多个一个或多个数据存储设备中被分割，由此存储在数据容器中的数据在多个数据存储设备上进行条带化。
-
公开(公告)号：US20110161980A1
公开(公告)日：2011-06-30
申请号：US12651069
申请日：2009-12-31
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： H04L43/08 , G06F9/5083 , H04L47/70
摘要： A load balancer allocates requests to a pool of web servers configured to have low queue capacities. If the queue capacity of a web server is reached, the web server responds to an additional request with a rejection notification to the load balancer, which enables the load balancer to quickly send the rejected request to another web server. Each web server self-monitors its rejection rate. If the rejection rate exceeds a threshold, the number of processes concurrently running on the web server is increased. If the rejection rate falls below a threshold, the number of processes concurrently running on the web server is decreased.
摘要翻译： 负载平衡器将请求分配给配置为具有低队列容量的Web服务器池。 如果达到Web服务器的队列容量，则Web服务器将响应额外的请求，并向负载均衡器发送拒绝通知，这使负载平衡器能够将拒绝的请求快速发送到另一个Web服务器。 每个Web服务器自我监控其拒绝率。 如果拒绝率超过阈值，则在Web服务器上同时运行的进程数量增加。 如果拒绝率低于阈值，则在Web服务器上同时运行的进程数量减少。
-
公开(公告)号：US07921257B1
公开(公告)日：2011-04-05
申请号：US11965406
申请日：2007-12-27
IPC分类号： G06F12/00
CPC分类号： G06F11/1076 , G06F11/1088
摘要： A dynamic parity distribution system and technique distributes parity across disks of an array. The dynamic parity distribution system includes a storage operating system that integrates a file system with a RAID system. In response to a request to store (write) data on the array, the file system determines which disks contain free blocks in a next allocated stripe of the array. There may be multiple blocks within the stripe that do not contain file system data (i.e., unallocated data blocks) and that could potentially store parity. One or more of those unallocated data blocks can be assigned to store parity, arbitrarily. According to the dynamic parity distribution technique, the file system determines which blocks hold parity each time there is a write request to the stripe. The technique alternately allows the RAID system to assign a block to contain parity when each stripe is written.
摘要翻译： 动态奇偶校验分配系统和技术在阵列的磁盘上分配奇偶校验。 动态奇偶校验分配系统包括将文件系统与RAID系统集成的存储操作系统。 响应于在阵列上存储（写入）数据的请求，文件系统确定哪个磁盘在数组的下一个分配的条带中包含空闲块。 条带内可能存在不包含文件系统数据（即，未分配的数据块）并且可能存储奇偶校验的多个块。 这些未分配数据块中的一个或多个可以被任意地分配给存储奇偶校验。 根据动态奇偶校验分配技术，文件系统确定哪个块在每次存在对条带的写请求时保持奇偶校验。 该技术交替地允许RAID系统在写入每个条带时分配块以包含奇偶校验。
-
54.发明授权System and method for efficiently guaranteeing data consistency to clients of a storage system cluster 有权有效保证与存储系统集群客户端数据一致性的系统和方法公开(公告)号：US07721045B1
公开(公告)日：2010-05-18
申请号：US12048659
申请日：2008-03-14
IPC分类号： G06F12/16
CPC分类号： G06F17/30067
摘要： A method for operating a computer storage system is disclosed. One or more data storage devices are configured to store a data content of a data container. A data structure having a plurality of permitted modification times (mtimes) is generated, the mtimes to control modifying a data stored in the data container. An I/O operation is performed by the storage system in response to a selected mtime. A request for the I/O operation is received from a client, and the data structure having a plurality of permitted modification times (mtimes) is generated in response to the request. The selected mtime is transmitted to the client, and an I/O operation is requested by the client in response to the selected mtime. The I/O operation is performed as an atomic I/O operation.
摘要翻译： 公开了一种用于操作计算机存储系统的方法。 一个或多个数据存储设备被配置为存储数据容器的数据内容。 产生具有多个允许修改次数（mtimes）的数据结构，用于控制修改存储在数据容器中的数据的时间。 响应于所选择的时间，存储系统执行I / O操作。 从客户端接收对I / O操作的请求，响应该请求生成具有多个允许修改次数（mtimes）的数据结构。 所选择的mtime被发送到客户端，并且响应于所选择的mtime，客户端请求I / O操作。 执行I / O操作作为原子I / O操作。
-
55.发明授权Method and apparatus for defragmentation and for detection of relocated blocks 有权用于碎片整理和检测重新定位块的方法和装置公开(公告)号：US07702870B2
公开(公告)日：2010-04-20
申请号：US11336755
申请日：2006-01-19
申请人： Robert M. English , Ashish Prakash
发明人： Robert M. English , Ashish Prakash
CPC分类号： H04L67/1097
摘要： A method of operating a storage system includes moving a block of data stored in the storage system to a new location in the storage system, such as for purposes of defragmentation. After the block has been moved to the new location, the storage system receives a request requiring access to the block. The storage system uses metadata appended to an identified block to detect that the block may have been relocated. The metadata can further be used to distinguish a block that has been relocated from a lost write.
摘要翻译： 操作存储系统的方法包括将存储在存储系统中的数据块移动到存储系统中的新位置，例如用于碎片整理的目的。 在块被移动到新位置之后，存储系统接收到需要访问块的请求。 存储系统使用附加到识别的块的元数据来检测该块可能已被重新定位。 元数据可以进一步用于区分已被重新定位的块与丢失的写入。
-
公开(公告)号：US20080270690A1
公开(公告)日：2008-10-30
申请号：US11741553
申请日：2007-04-27
申请人： Robert M. English
发明人： Robert M. English
IPC分类号： G06F12/00
CPC分类号： G06F3/0644 , G06F3/0613 , G06F3/0689
摘要： A system and method enhances performance of updates to sequential block storage of a storage system. According to an aspect of the invention, a disk array of the storage system is utilized to extend write buffers of the system, thereby rendering a portion of the disk array a disk-based log. To that end, one portion of the disk array is organized into a home location array having a set of sequential home locations for disk blocks. Another portion of the disk array is organized into the disk-based log having a set of log buffers configured to store versions of disk blocks that have yet to be returned to their home locations in the home location array. In addition, non-volatile memory of the storage system is organized as an index configured to provide efficient mappings of disk blocks not yet returned to their home locations. In accordance with another aspect of the invention, a novel disk-based multi-level sort procedure is provided to establish locality among updates (write data) held in the disk-based log, thereby enabling the write data to be efficiently written to home locations on the disk array.
摘要翻译： 系统和方法增强了对存储系统的顺序块存储的更新的性能。 根据本发明的一个方面，存储系统的磁盘阵列用于扩展系统的写入缓冲器，从而使得磁盘阵列的一部分成为基于磁盘的日志。 为此，磁盘阵列的一部分被组织成具有用于磁盘块的一组顺序归属位置的归属位置阵列。 磁盘阵列的另一部分被组织到具有一组日志缓冲器的基于磁盘的日志中，该组日志缓冲器被配置为存储尚未被返回到归属位置阵列中的本地位置的磁盘块的版本。 此外，存储系统的非易失性存储器被组织为被配置为提供尚未返回到其本地位置的磁盘块的有效映射的索引。 根据本发明的另一方面，提供了一种新颖的基于磁盘的多级分类过程，以在保持在基于磁盘的日志中的更新（写入数据）之间建立位置，由此使写入数据能够有效地写入本地位置 在磁盘阵列上。
-
公开(公告)号：US07409494B2
公开(公告)日：2008-08-05
申请号：US10836817
申请日：2004-04-30
IPC分类号： G06F12/00
CPC分类号： G06F3/0689 , G06F3/0619 , G06F3/0665 , G06F17/30233
摘要： A file system layout apportions an underlying physical volume into one or more virtual volumes (vvols) of a storage system. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space. Notably, the block allocation structures of a vvol are sized to the vvol, and not to the underlying aggregate, to thereby allow operations that manage data served by the storage system (e.g., snapshot operations) to efficiently work over the vvols. The file system layout extends the file system layout of a conventional write anywhere file layout system implementation, yet maintains performance properties of the conventional implementation.
摘要翻译： 文件系统布局将底层物理卷分配到存储系统的一个或多个虚拟卷（vvols）中。 底层物理卷是包含存储系统的一组或多组磁盘（如RAID组）的聚合。 聚合具有自己的物理卷块数（pvbn）空间，并在该pvbn空间内维护诸如块分配结构的元数据。 每个vvol具有自己的虚拟卷块号（vvbn）空间，并在该vvbn空间内维护诸如块分配结构的元数据。 值得注意的是，vvol的块分配结构的大小适合于vvol，而不是基础聚合，从而允许管理由存储系统服务的数据（例如，快照操作）的操作有效地在vvols上工作。 文件系统布局扩展了常规写入任何文件布局系统实现的文件系统布局，但是保持了传统实现的性能特性。
-
58.发明授权Data placement technique for striping data containers across volumes of a storage system cluster 有权用于在存储系统集群的卷上分条数据容器的数据放置技术公开(公告)号：US07366837B2
公开(公告)日：2008-04-29
申请号：US11118298
申请日：2005-04-29
CPC分类号： G06F11/1096 , G06F3/0607 , G06F3/0632 , G06F3/0646 , G06F3/0689
摘要： A technique places content, such as data, of one or more data containers on volumes of a striped volume set (SVS). The placement of data across the volumes of the SVS allows specification of a deterministic pattern of fixed length. That is, the pattern determines a placement of data of a data container that is striped among the volumes of the SVS. The placement pattern is such that the stripes are distributed exactly or nearly equally among the volumes and that, within any local span of a small multiple of the number of volumes, the stripes are distributed nearly equally among the volumes. The placement pattern is also substantially similar for a plurality of SVSs having different numbers of volumes.
摘要翻译： 一种技术将一个或多个数据容器的内容（如数据）放置在条带卷集（SVS）的卷上。 数据在SVS卷上的放置允许规定固定长度的确定性模式。 也就是说，该模式确定在SVS的卷之间条带化的数据容器的数据的放置。 放置图案使得条纹在卷之间精确地或几乎相等地分布，并且在卷的数量的小倍数的任何局部跨度内，条纹在卷之间几乎相等地分布。 对于具有不同数量的体积的多个SVS，放置图案也基本相似。
-
公开(公告)号：US07328305B2
公开(公告)日：2008-02-05
申请号：US10700227
申请日：2003-11-03
IPC分类号： G06F12/00
CPC分类号： G06F11/1076 , G06F11/1088
摘要： A dynamic parity distribution system and technique distributes parity across disks of an array. The dynamic parity distribution system includes a storage operating system that integrates a file system with a RAID system. In response to a request to store (write) data on the array, the file system determines which disks contain free blocks in a next allocated stripe of the array. There may be multiple blocks within the stripe that do not contain file system data (i.e., unallocated data blocks) and that could potentially store parity. One or more of those unallocated data blocks can be assigned to store parity, arbitrarily. According to the dynamic parity distribution technique, the file system determines which blocks hold parity each time there is a write request to the stripe. The technique alternately allows the RAID system to assign a block to contain parity when each stripe is written.
摘要翻译： 动态奇偶校验分配系统和技术在阵列的磁盘上分配奇偶校验。 动态奇偶校验分配系统包括将文件系统与RAID系统集成的存储操作系统。 响应于在阵列上存储（写入）数据的请求，文件系统确定哪个磁盘在数组的下一个分配的条带中包含空闲块。 条带内可能存在不包含文件系统数据（即，未分配的数据块）并且可能存储奇偶校验的多个块。 这些未分配数据块中的一个或多个可以被任意地分配给存储奇偶校验。 根据动态奇偶校验分配技术，文件系统确定哪个块在每次存在对条带的写请求时保持奇偶校验。 该技术交替地允许RAID系统在写入每个条带时分配块以包含奇偶校验。
-
60.发明授权Row-diagonal parity technique for enabling efficient recovery from double failures in a storage array 有权行对角奇偶校验技术，用于实现存储阵列中双重故障的高效恢复公开(公告)号：US07203892B2
公开(公告)日：2007-04-10
申请号：US11303788
申请日：2005-12-16
IPC分类号： G11C29/00
CPC分类号： G06F11/1076
摘要： A “row-diagonal” (R-D) parity technique reduces overhead of computing diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of two storage devices in the array. The diagonal parity is computed along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. The R-D parity technique provides a uniform stripe depth and an optimal amount of parity information.
摘要翻译： “行对角线”（R-D）奇偶校验技术减少了针对阵列中的两个存储设备的并发故障进行有效恢复的存储阵列计算对角奇偶校验的开销。 沿对角线奇偶校验集计算对角线奇偶校验集，该集合跨越阵列的所有数据磁盘和行奇偶校验磁盘。 所有对角奇偶校验集的奇偶校验除了一个存储在对角奇偶校验磁盘上。 R-D奇偶校验技术提供均匀条纹深度和最优量的奇偶校验信息。
-
-
-
-
-
-
-
-
-
搜索结果
64 条记录 (耗时 0.036 秒)