公开(公告)号：US06378038B1

公开(公告)日：2002-04-23

申请号：US09282852

申请日：1999-03-31

申请人： Philip Anthony Richardson ,  Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

发明人： Philip Anthony Richardson ,  Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

IPC分类号： G06F1120

CPC分类号： G06F3/061 ,  G06F3/0656 ,  G06F3/0689 ,  G06F2211/103

摘要： A method and system for storing data in a redundant array of inexpensive disks (RAID) data storage subsystem is disclosed. The RAID data storage subsystem includes a plurality of drives. The method and system include temporarily storing data in a first portion of the plurality of drives using a first RAID level and relatively permanently storing the data in a second portion the plurality of drives using a second RAID level. The step of relatively permanently storing the data is performed at a time when performance of the system is not substantially affected by storage using the second RAID level. Furthermore, the temporary storing step and the step of storing the data using the second RAID level may be performed throughout operation of the RAID data storage subsystem. Thus, RAID data may be cached using the first RAID level, then relatively permanently stored using the second RAID level.

摘要翻译： 公开了一种用于将数据存储在廉价磁盘（RAID）数据存储子系统的冗余阵列中的方法和系统。 RAID数据存储子系统包括多个驱动器。 该方法和系统包括使用第一RAID级别将数据临时存储在多个驱动器的第一部分中，并且使用第二RAID级别将该数据相对永久地存储在第二部分中的多个驱动器。 在使用第二RAID级别的存储基本上不影响系统的性能的时候执行相对永久地存储数据的步骤。 此外，可以在RAID数据存储子系统的整个操作中执行临时存储步骤和使用第二RAID级存储数据的步骤。 因此，可以使用第一RAID级别来缓存RAID数据，然后使用第二RAID级别相对永久地存储。

公开(公告)号：US06334168B1

公开(公告)日：2001-12-25

申请号：US09253413

申请日：1999-02-19

申请人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle ,  Philip Anthony Richardson

发明人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle ,  Philip Anthony Richardson

IPC分类号： G06F1200

CPC分类号： G06F11/1076 ,  G06F12/0866 ,  G06F2211/1009 ,  G06F2211/1095

摘要： A method and system for a data storage system to update stored data with received data in a cache associated with the data storage system where the data storage system comprises N data storage drives is provided, where data and calculated parity are striped across the N data storage drives. An associated cache is provided with the data storage system for receiving data. The data in the cache is periodically examined to determine if the data includes all sequential data contained within a complete stripe within the data storage system. Data is fetched from the N data storage drives into the cache and the parity for the stripe is calculated by logically combining the received data in the cache and fetched data from the data storage drives if the cache is determined not to include all sequential data contained within the complete stripe. Alternatively, the parity for the stripe is calculated by logically combining only data within the cache for the stripe, if data in the cache is determined to include all sequential data contained within a complete stripe, thereby minimizing the number of input/output operations required to update data.

摘要翻译： 提供一种数据存储系统的方法和系统，用于将存储的数据与在数据存储系统中包括N个数据存储驱动器的数据存储系统相关联的高速缓存中的接收数据更新，其中数据和计算的奇偶校验在N个数据存储器 驱动器 与用于接收数据的数据存储系统一起提供关联的高速缓存。 定期检查缓存中的数据，以确定数据是否包含数据存储系统内完整条带中包含的所有顺序数据。 将数据从N个数据存储驱动器取出到高速缓存中，并且如果缓存被确定为不包括包含在其中的所有顺序数据，则逻辑地组合高速缓存中的接收数据和来自数据存储驱动器的所获取的数据来计算条带的奇偶校验 完整的条纹。 或者，如果确定高速缓存中的数据包括包含在完整条带中的所有顺序数据，则通过仅逻辑地组合该条带的高速缓存内的数据来计算条带的奇偶校验，从而最小化所需的输入/输出操作的数量 更新数据。

公开(公告)号：US06282671B1

公开(公告)日：2001-08-28

申请号：US09189689

申请日：1998-11-10

申请人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

发明人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

IPC分类号： G06F1110

CPC分类号： G06F11/1076 ,  G06F2211/1009 ,  H03M13/09 ,  H03M13/1515

摘要： The method and system for improved efficiency and parity calculation in RAID data storage system. RAID data storage systems permit recovery of data in the event of a drive failure by storing a parity value for each stripe of data on a separate drive. Each time data is written to a RAID data storage the parity value for the associated data stripe must be updated. Parity may be calculated utilizing two different algorithms. New parity may be calculated utilizing the old data value, the new data value and the old parity value, or calculated utilizing the new data value and all remaining old data within the associated data stripe. The number of input/output operations required to calculate parity utilizing each algorithm is predetermined and the method requiring the least number of input/output operations is selected, unless data sequentiality is detected. If sequential data is present the parity value is calculated utilizing the new data and all old data in the associated data stripe, even if a greater number of input/output operations are initially required, as further sequential input/output operations will be more efficient.

摘要翻译： RAID数据存储系统中提高效率和奇偶校验计算的方法和系统。 RAID数据存储系统允许在驱动器发生故障的情况下通过将每个数据条带的奇偶校验值存储在单独的驱动器上来恢复数据。 每次将数据写入RAID数据存储时，必须更新相关数据条带的奇偶校验值。 可以使用两种不同的算法来计算奇偶校验。 可以使用旧的数据值，新的数据值和旧的奇偶校验值来计算新的奇偶校验，或者利用新的数据值和相关联的数据条带内的所有剩余的旧数据来计算。 使用每个算法计算奇偶校验所需的输入/输出操作的数量是预定的，并且除非检测到数据顺序性，否则选择需要最少数量的输入/输出操作的方法。 如果存在顺序数据，则即使最初需要更多数量的输入/输出操作，因此使用新数据和相关数据条带中的所有旧数据来计算奇偶校验值，因为进一步的顺序输入/输出操作将更有效。

公开(公告)号：US06195727B1

公开(公告)日：2001-02-27

申请号：US09282714

申请日：1999-03-31

申请人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

发明人： Shah Mohammad Rezaul Islam ,  Linda Ann Riedle

IPC分类号： G06F1120

CPC分类号： G06F11/1076

摘要： A redundant array of inexpensive disks (RAID) includes a plurality of disk drives organized as a plurality of stripes, wherein each stripe includes a plurality of stripe units. A host processor system sends write commands in write-through mode to a RAID controller, some of which are immediately processed by the controller, and others of which are temporarily stored in a stash. Commands stored in the stash for data writes that only partially fill a stripe may be coalesced with another write command that also only partially fills the same stripe. This coalescing occurs for commands for data writes that span one or more stripes, and that may start or stop in the middle of a stripe, as well as in the middle of a stripe unit. In addition, two different commands for writing data to different stripe units, but from the same stripe, can also be coalesced. The coalescing of write commands in the stash reduces the number of disk I/O's and improves data throughput.

摘要翻译： 廉价磁盘（RAID）的冗余阵列包括被组织为多个条带的多个磁盘驱动器，其中每个条带包括多个条带单元。 主处理器系统以直写模式向RAID控制器发送写入命令，其中一些由控制器立即处理，其中一些暂时存储在存储器中。 存储在数据写入中的仅用于部分填充条带的命令可能与另一个仅部分填充相同条带的写命令合并。 这种合并发生在跨越一个或多个条带的数据写入命令，并且可能在条带中间以及条带单元的中间开始或停止。 另外，两个不同的命令用于将数据写入不同的条带单元，但是从相同的条带也可以合并。 写入命令的合并减少了磁盘I / O的数量，并提高了数据吞吐量。

公开(公告)号：US06728833B2

公开(公告)日：2004-04-27

申请号：US10085401

申请日：2002-02-28

申请人： Gregory Brian Pruett ,  David B. Rhoades ,  Linda Ann Riedle

发明人： Gregory Brian Pruett ,  David B. Rhoades ,  Linda Ann Riedle

IPC分类号： G06F1200

CPC分类号： G06F3/0632 ,  G06F3/0607 ,  G06F3/0689 ,  G06F11/1092 ,  G06F2211/1035

摘要： A method, system and computer program product for updating firmware in a disk in a disk array in a RAID storage system without deactivating a server coupled to the disk array. Upon selecting the disk whose firmware is to be updated, the selected disk may enter a degrade mode of operation where a RAID controller coupled to the RAID storage system may prevent requests from reaching the selected disk thereby suppressing activity on the selected disk to allow the firmware to be updated. During the updating of the firmware, any stripes updated may be tracked. Upon completion of the firmware update, the stripe units in the selected disk associated with the stripes updated may be rebuilt. In this manner, firmware may be updated on a disk in a RAID storage system without deactivating the server thereby allowing the server to continuously stay active.

摘要翻译： 一种方法，系统和计算机程序产品，用于更新RAID存储系统中磁盘阵列中的磁盘中的固件，而不停用与磁盘阵列相连的服务器。 在选择要更新其固件的磁盘时，所选择的磁盘可能进入降级操作模式，其中耦合到RAID存储系统的RAID控制器可以阻止请求到达所选择的磁盘，从而抑制所选磁盘上的活动以允许固件 要被更新。 在更新固件期间，可以跟踪更新的任何条带。 固件更新完成后，可以重建与更新的条带相关联的所选磁盘中的条带单元。 以这种方式，可以在RAID存储系统中的盘上更新固件，而不停用服务器，从而允许服务器持续保持活动状态。

公开(公告)号：US06611827B1

公开(公告)日：2003-08-26

申请号：US09411810

申请日：1999-10-01

申请人： Linda Ann Riedle

发明人： Linda Ann Riedle

IPC分类号： G06F1730

CPC分类号： G06F3/0601 ,  G06F2003/0697 ,  Y10S707/99931

摘要： A redundant disk array and improved method for redundant disk array access improve the performance of storage systems for computers. The disk array and method retrieve data from redundant drives according to an algorithm that will fetch contiguous pages from a single storage device, rather than alternating accesses between storage devices. The result is a reduced access time and increased data throughput.

摘要翻译： 冗余磁盘阵列和冗余磁盘阵列访问的改进方法可提高计算机存储系统的性能。 磁盘阵列和方法根据将从单个存储设备获取连续页面的算法而不是在存储设备之间交替访问从冗余驱动器检索数据。 结果是减少了访问时间并增加了数据吞吐量。

公开(公告)号：US06298415B1

公开(公告)日：2001-10-02

申请号：US09253414

申请日：1999-02-19

申请人： Linda Ann Riedle

发明人： Linda Ann Riedle

IPC分类号： G06F1110

CPC分类号： G06F11/1076 ,  G06F2211/1009 ,  G06F2211/1095

摘要： A method and system for updating stored data with received data in a cache associated with the data storage system is provided, where the data storage system comprises N data storage drives, where data and calculated parity are striped across N data storage drives, where a stripe comprises multiple data sectors on each of N data storage drives. An associated cache is provided with the data storage system into which data is received. The data in the cache is periodically examined to determine if the cache includes all sequential data sectors contained within a complete stripe within the data storage system. Parity is calculated for the complete stripe by first calculating a range of sectors between which all sectors received into the cache for the complete stripe fall. Next, only those sectors within the range of sectors which are not included in the data in the cache for the complete stripe are read from the N data storage drives into the cache. Finally, the range of sectors in the cache for the complete stripe are logically combined. The parity is calculated such that input/output operations within said data storage system are minimized.

摘要翻译： 提供了一种用于在与数据存储系统相关联的高速缓存中更新存储的数据的方法和系统，其中数据存储系统包括N个数据存储驱动器，其中数据和计算的奇偶校验在N个数据存储驱动器上被条带化， 在N个数据存储驱动器中的每一个上包括多个数据扇区。 相关联的高速缓冲存储器被提供有数据存储系统，数据被接收到数据存储系统中。 定期检查高速缓存中的数据，以确定高速缓存是否包含数据存储系统内完整条带内的所有顺序数据扇区。 通过首先计算接收到高速缓存中的所有扇区之间的扇区范围，以完整条带落下，为完整条带计算奇偶校验。 接下来，从N个数据存储驱动器中仅读取不包括在完整条带的高速缓存中的数据的扇区范围内的那些扇区。 最后，完整条带的缓存中的扇区范围是逻辑组合的。 计算奇偶校验，使得所述数据存储系统内的输入/输出操作最小化。

公开(公告)号：US06272590B1

公开(公告)日：2001-08-07

申请号：US09253415

申请日：1999-02-19

申请人： Linda Ann Riedle

发明人： Linda Ann Riedle

IPC分类号： G06F1200

CPC分类号： G06F12/0866 ,  G06F12/0862

摘要： A method and system in a data storage system for reading stored data from the data storage system, where the data storage system comprises N data storage drives and an associated cache, where data and calculated parity are striped across the N data storage drives, where a stripe comprises multiple sectors on each of the N data storage drives. Data is requested from the data storage system. A determination is made of whether or not the requested data currently resides in a cache associated with the data storage system. In addition, a determination is made of whether or not the requested data sequentially follows other sectors also residing in the cache. Only the requested data is fetched into the cache if it is determined that the requested data does not reside in the cache and the requested data does not sequentially follow sectors in the cache. The requested data and a predefined block of sectors within the N data storage drives are fetched into the cache if it is determined that the requested data does not reside in the cache and the requested data sequentially follows sectors in the cache, where the fetched predetermined block of sectors sequentially follows the requested data.

摘要翻译： 一种用于从数据存储系统读取存储数据的数据存储系统中的方法和系统，其中数据存储系统包括N个数据存储驱动器和相关联的高速缓存，其中数据和计算的奇偶校验在N个数据存储驱动器上被分段，其中 条带包括N个数据存储驱动器中的每一个上的多个扇区。 从数据存储系统请求数据。 确定所请求的数据当前是否驻留在与数据存储系统相关联的高速缓存中。 此外，确定所请求的数据是否顺序地跟随也驻留在高速缓存中的其他扇区。 如果确定所请求的数据不驻留在高速缓存中并且所请求的数据不顺序地跟随高速缓存中的扇区，则仅将所请求的数据提取到高速缓存中。 如果确定所请求的数据不驻留在高速缓存中，并且所请求的数据顺序地跟随高速缓存中的扇区，则将所请求的数据和N个数据存储驱动器内的预定义的扇区块提取到高速缓冲存储器中，其中获取的预定块 的扇区顺序地遵循所请求的数据。

公开(公告)号：US06983334B2

公开(公告)日：2006-01-03

申请号：US10007190

申请日：2001-11-07

申请人： Linda Ann Riedle

发明人： Linda Ann Riedle

IPC分类号： G06F15/16

CPC分类号： H04L67/06 ,  H04L1/1848 ,  H04L29/06 ,  H04L49/90 ,  H04L69/329 ,  H04L2001/0093

摘要： A method, system, and program product for efficiently tracking lost data packets in a multicast TFTP network environment. An algorithm is encoded within the receiving client processing system that tracks received packets within a 64 Kbit tracking array. The array is stored in memory. If the number of packets of a file being transmitted is larger than 64K, the algorithm performs a grouping function, by which each set of two neighboring spaces within the array are combined. Combining of the spaces involves ANDing the spaces together, and the ANDed results stored within a single space indicates whether or not the packets within the group needs to be re-requested. Thus if either one of the values in the spaces is a zero (indicating that the corresponding packet is lost) then the combined space is tagged with a zero. In this way, when the client is determining which packet(s) or groups to re-request, the client checks the array for holes (i.e., 0's) and re-requests the packet(s) represented by each hole found.

公开(公告)号：US06966006B2

公开(公告)日：2005-11-15

申请号：US10142142

申请日：2002-05-09

申请人： Joaquin Fernando Pacheco ,  William Joseph Piazza ,  Gregory Brian Pruett ,  David B. Rhoades ,  Linda Ann Riedle

发明人： Joaquin Fernando Pacheco ,  William Joseph Piazza ,  Gregory Brian Pruett ,  David B. Rhoades ,  Linda Ann Riedle

IPC分类号： G06F3/06 ,  G11B19/20 ,  G06F1/26

CPC分类号： G11B19/20 ,  G06F3/0625 ,  G06F3/0632 ,  G06F3/0689 ,  Y02D10/154

摘要： A method and system for adaptively implementing a disk drive startup sequence for a disk drive array. Prior to a next disk drive spin-up sequence a currently available power supply resource capacity and a startup metric of each of the array disk drives are determined. Each of the disk drives are scheduled into designated startup groups as a function of both the determined currently available power supply resource capacity and the determined startup metric. The scheduling of disk drives into designated startup groups includes determining an activation sequence timing schedule for each of the disk drives. The activation sequence timing schedule determines the relative times at which spindle motors for each of said plurality of disk drives will be activated as a function of the determined startup metric for each of the disk drives and the available power supply resource capacity as reduced by the steady state power requirements of each of the startup groups.

摘要翻译： 一种用于自适应地实现磁盘驱动器阵列的磁盘驱动器启动顺序的方法和系统。 在下一个磁盘驱动器启动序列之前，确定当前可用的电源资源容量和每个阵列磁盘驱动器的启动度量。 根据确定的当前可用的电源资源容量和确定的启动度量，将每个磁盘驱动器调度到指定的启动组中。 将磁盘驱动器调度到指定的启动组包括确定每个磁盘驱动器的激活顺序时序表。 激活顺序时序调度决定了所述多个磁盘驱动器中的每一个的主轴电动机将被激活的相对时间，作为对于每个磁盘驱动器确定的启动度量以及可用电力供应资源容量的函数，由稳定 每个启动组的状态功率要求。