-
21.发明授权Data placement technique for striping data containers across volumes of a storage system cluster 有权用于在存储系统集群的卷上分条数据容器的数据放置技术公开(公告)号：US07647451B1
公开(公告)日：2010-01-12
申请号：US12109272
申请日：2008-04-24
CPC分类号： G06F3/0607 , G06F3/0646 , G06F3/0689 , G06F11/1096
摘要： 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，放置图案也基本相似。
-
公开(公告)号：US20090034377A1
公开(公告)日：2009-02-05
申请号：US11927952
申请日：2007-10-30
CPC分类号： G06F3/0656 , G06F3/0613 , G06F3/0643 , G06F3/0644 , G06F3/0689 , G06F12/0804
摘要： An improved system and method enhances performance of updates to sequential block storage of a storage system. A disk-based sort procedure is provided to establish locality among updates (write data) held in a disk-based log, thereby enabling the write data to be efficiently written to home locations on a home location array. As the write data is received, a log manager of the storage system temporarily stores the data efficiently on the disk-based log. As more write data arrives, the log manager sorts the data in the log in accordance with the sort procedure, thus increasing the locality of data when stored on the home location array. When the log approaches capacity, the log manager writes the sorted data to their home locations on the array with high locality and performance.
摘要翻译： 改进的系统和方法增强了对存储系统的顺序块存储的更新的性能。 提供基于磁盘的分类程序以在保持在基于磁盘的日志中的更新（写入数据）之间建立位置，从而使写入数据能够有效地写入归属位置阵列上的归属位置。 当接收到写入数据时，存储系统的日志管理器将有效的数据临时存储在基于磁盘的日志上。 随着更多的写入数据到达，日志管理器根据分类过程对日志中的数据进行排序，从而在存储在归属位置数组上时增加数据的位置。 当日志接近容量时，日志管理器将排序数据写入阵列的本地位置和性能很高。
-
23.发明授权Distributed scheduling of parallel jobs with no kernel-to-kernel communication 失效没有内核到内核通信的并行作业的分布式调度公开(公告)号：US06766515B1
公开(公告)日：2004-07-20
申请号：US08801646
申请日：1997-02-18
IPC分类号： G06F900
CPC分类号： G06F9/4843 , G06F9/4881
摘要： A system and a method of scheduling a plurality of threads from a multi-threaded program. A shared arena is provided in user memory, wherein the shared arena includes a register save area for each of the plurality of threads. A processor, when allocated to the application, executes the application's user-level scheduler and selects a user-level thread from a plurality of available threads, wherein the step of selecting includes the step of reading register context associated with the selected thread from one of the plurality of register save areas. In multikernel systems, kernels having access to an application's register save areas can execute preempted threads from that application with no kernel-to-kernel communication. Likewise, kernels having access to an application's user-level run queues can execute ready-to-run threads from that application with no kernel-to-kernel communication.
摘要翻译： 一种从多线程程序调度多个线程的系统和方法。 在用户存储器中提供共享的竞技场，其中共享竞技场包括用于多个线程中的每一个的寄存器保存区域。 当处理器分配给应用程序时，执行应用程序的用户级调度程序，并从多个可用线程中选择一个用户级线程，其中选择步骤包括以下步骤之一：选择线程从与 多个寄存器保存区域。 在多内核系统中，具有访问应用程序的寄存器保存区域的内核可以执行没有内核到内核通信的应用程序的抢占线程。 同样，可以访问应用程序的用户级运行队列的内核可以从该应用程序执行即可运行的线程，而无需内核到内核的通信。
-
公开(公告)号：US5564031A
公开(公告)日：1996-10-08
申请号：US629041
申请日：1996-04-12
CPC分类号： G06F9/462 , G06F7/72 , G06F9/30123 , G06F9/30134
摘要： In a digital computer, a circular queue of registers in a register file are allocated as temporary local storage for procedures rather than using the known caller/callee save convention in order to minimize main memory references. A called procedure dynamically allocates local registers as needed without regard to registers used by the caller of the procedure or by any callee of the procedure, whereby register allocation is not restricted by any predetermined window size. Local registers, including parameter passing registers, are allocated in the called procedure, rather than a priori at compile time, by adjusting register stack pointer values. Only the number of registers actually required by the procedure need by allocated. Optionally, rotating registers may be allocated among the local registers. Stack pointer values are stored in one of the parameter passing registers when a procedure is called. Hardware register file access circuitry maps virtual register numbers used by the procedures into the hardware register file. Upon return from a procedure, registers are deallocated by adjusting the register stack pointers to the values stored when the procedure was called.
摘要翻译： 在数字计算机中，寄存器文件中的寄存器的循环队列被分配为用于过程的临时本地存储器，而不是使用已知的调用者/被调用者保存约定来最小化主存储器引用。 被调用的过程根据需要动态地分配本地寄存器，而不考虑由过程的调用者使用的寄存器或过程的任何被调用者，由此寄存器分配不受任何预定窗口大小的限制。 本地寄存器（包括参数传递寄存器）在调用过程中被分配，而不是在编译时通过调整寄存器堆栈指针值来先验地分配。 只有实际需要的寄存器数量需要分配。 可选地，可以在本地寄存器之间分配旋转寄存器。 调用过程时，堆栈指针值存储在参数传递寄存器之一中。 硬件寄存器文件访问电路将程序使用的虚拟寄存器编号映射到硬件寄存器文件中。 从过程返回时，通过将寄存器堆栈指针调整到调用过程时存储的值来释放寄存器。
-
公开(公告)号：US08285747B1
公开(公告)日：2012-10-09
申请号：US11717895
申请日：2007-03-13
申请人： Robert M. English
发明人： Robert M. English
IPC分类号： G06F17/30
CPC分类号： G06F3/0605 , G06F3/0632 , G06F3/0689
摘要： Embodiments of the present invention are directed to an apparatus and methods for operating a storage system. The storage system incorporates a storage device associated with a client into a logical group of storage devices managed by the storage system. Thereafter, the storage system is capable of satisfying data access requests from an incorporated storage device managed by the storage system.
摘要翻译： 本发明的实施例涉及一种用于操作存储系统的装置和方法。 存储系统将与客户端相关联的存储设备并入由存储系统管理的逻辑组存储设备。 此后，存储系统能够满足来自由存储系统管理的并入的存储装置的数据访问请求。
-
公开(公告)号：US07882304B2
公开(公告)日：2011-02-01
申请号：US11927952
申请日：2007-10-30
IPC分类号： G06F12/12
CPC分类号： G06F3/0656 , G06F3/0613 , G06F3/0643 , G06F3/0644 , G06F3/0689 , G06F12/0804
摘要： An improved system and method enhances performance of updates to sequential block storage of a storage system. A disk-based sort procedure is provided to establish locality among updates (write data) held in a disk-based log, thereby enabling the write data to be efficiently written to home locations on a home location array. As the write data is received, a log manager of the storage system temporarily stores the data efficiently on the disk-based log. As more write data arrives, the log manager sorts the data in the log in accordance with the sort procedure, thus increasing the locality of data when stored on the home location array. When the log approaches capacity, the log manager writes the sorted data to their home locations on the array with high locality and performance.
摘要翻译： 改进的系统和方法增强了对存储系统的顺序块存储的更新的性能。 提供基于磁盘的分类程序以在保持在基于磁盘的日志中的更新（写入数据）之间建立位置，从而使写入数据能够有效地写入归属位置阵列上的归属位置。 当接收到写入数据时，存储系统的日志管理器将有效的数据临时存储在基于磁盘的日志上。 随着更多的写入数据到达，日志管理器根据分类过程对日志中的数据进行排序，从而在存储在归属位置数组上时增加数据的位置。 当日志接近容量时，日志管理器将排序数据写入阵列的本地位置和性能很高。
-
27.发明授权Row-diagonal parity technique for enabling efficient recovery from double failures in a storage array 有权行对角奇偶校验技术，用于实现存储阵列中双重故障的高效恢复公开(公告)号：US07409625B2
公开(公告)日：2008-08-05
申请号：US11710304
申请日：2007-02-23
IPC分类号： G11C29/00
CPC分类号： G06F11/1076
摘要： A method for enabling recovery from concurrent failure of a plurality of storage devices in a storage array is disclosed. The method stores data on a first plurality of storage devices of the storage array. The first plurality of storage devices may have a number of storage devices equal to a prime number greater then three. Row parity is stored on one or more storage devices of the storage array. A diagonal parity set is computed for the plurality of storage devices. The diagonal parity set is stored on an additional diagonal parity device, the diagonal parity device separate from the first plurality of storage devices.
摘要翻译： 公开了一种能够从存储阵列中的多个存储设备的并发故障恢复的方法。 该方法将数据存储在存储阵列的第一多个存储设备上。 第一多个存储设备可以具有等于大于三的素数的多个存储设备。 行奇偶校验存储在存储阵列的一个或多个存储设备上。 针对多个存储设备计算对角奇偶校验集。 对角奇偶校验集存储在附加的对角奇偶校验设备上，对角奇偶校验设备与第一多个存储设备分离。
-
28.发明授权System and method for efficiently guaranteeing data consistency to clients of a storage system cluster 有权有效保证与存储系统集群客户端数据一致性的系统和方法公开(公告)号：US07409497B1
公开(公告)日：2008-08-05
申请号：US11261007
申请日：2005-10-28
CPC分类号： G06F17/30067
摘要： A system and method efficiently guarantees data consistency to clients for one or more data containers stored on a plurality of volumes configured as a striped volume set (SVS) and served by a plurality of nodes connected as a cluster. Data consistency guarantees of data containers stored on the SVS is generally provided by delegating to data volumes (DVs) sufficient authority to autonomously service input/output (I/O) requests directed to the containers using attributes, such as timestamps, of the containers. Specifically, a DV is only allowed to service I/O requests, e.g., read and write operations, to a data container, such as a file, if it has a valid ticket book for the file. A DV requests and is granted the ticket book from a container attribute volume (CAV) on a per-file basis.
摘要翻译： 一种系统和方法有效地保证数据一致性，以便存储在被配置为条带卷集（SVS）的多个卷上并由作为集群连接的多个节点服务的一个或多个数据容器的数据容器。 存储在SVS上的数据容器的数据一致性保证通常是通过委托数据卷（DV）来提供足够的权限来自动地使用容器等属性（例如时间戳）来定向到容器的输入/输出（I / O）请求来提供的。 具体地说，如果DV具有用于该文件的有效机票簿，那么只允许DV将数据容器（例如文件）的I / O请求（例如，读取和写入操作）进行服务。 DV请求并从每个文件的容器属性卷（CAV）中授予票证。
-
29.发明授权Uniform and symmetric double failure correcting technique for protecting against two disk failures in a disk array 有权用于保护磁盘阵列中的两个磁盘故障的统一和对称双重故障纠正技术公开(公告)号：US07356731B2
公开(公告)日：2008-04-08
申请号：US11653651
申请日：2007-01-16
IPC分类号： G06F11/00
CPC分类号： G06F11/1076 , G06F2211/1057
摘要： A uniform and symmetric, double failure-correcting technique protects against two or fewer disk failures in a disk array of a storage system. A RAID system of the storage system generates two disks worth of “redundant” information for storage in the array, wherein the redundant information (e.g., parity) is illustratively derived from computations along both diagonal parity sets (“diagonals”) and row parity sets (“rows”). Specifically, the RAID system computes row parity along rows of the array and diagonal parity along diagonals of the array. However, the contents of the redundant (parity) information disks interact such that neither disk contains purely (solely) diagonal or row redundancy information; the redundant information is generated using diagonal parity results in row parity computations (and vice versa).
摘要翻译： 统一和对称的双故障校正技术可保护存储系统的磁盘阵列中的两个或更少的磁盘故障。 存储系统的RAID系统生成两个用于存储在阵列中的“冗余”信息的磁盘，其中冗余信息（例如，奇偶校验）被说明性地从两个对角奇偶校验集（“对角线”）和行奇偶校验集 （“行”）。 具体来说，RAID系统沿着阵列的行和沿着阵列的对角线的对角线奇偶校验来计算行奇偶校验。 然而，冗余（奇偶校验）信息磁盘的内容相互作用，使得两个磁盘都不包含纯（单独）对角线或行冗余信息; 使用行奇偶校验计算中的对角奇偶校验结果生成冗余信息（反之亦然）。
-
公开(公告)号：US07185144B2
公开(公告)日：2007-02-27
申请号：US10720364
申请日：2003-11-24
CPC分类号： G06F11/1096
摘要： A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.
-
-
-
-
-
-
-
-
-
搜索结果
64 条记录 (耗时 0.044 秒)