-
公开(公告)号：US20050015694A1
公开(公告)日：2005-01-20
申请号：US10619649
申请日：2003-07-14
申请人： Steven Hetzler , Daniel Smith
发明人： Steven Hetzler , Daniel Smith
CPC分类号： G06F11/1084
摘要： Error tolerance is increased for a storage system having a plurality of arrays by making local redundancy in a selected array globally available throughout the storage system. To achieve the increased error tolerance, a donor array is selected from the plurality of arrays when the difference between a minimum distance of the donor array and a minimum distance of a recipient array is greater or equal to 2. A donor storage unit is selected in the donor array and recipient information is then rebuilt from the recipient array on the selected storage unit. The selected storage unit is indicated to the donor array as having been donated before the lost information is rebuilt on the selected storage unit. Preferably, the minimum Hamming distance of the recipient array is d≧2 before the donor array is selected from the plurality of arrays.
摘要翻译： 通过使整个存储系统中的所选阵列中的本地冗余全局可用，具有多个阵列的存储系统的容错增加。 为了实现增加的误差容限，当供体阵列的最小距离和接收器阵列的最小距离之间的差异大于或等于2时，从多个阵列中选择供体阵列。供体存储单元被选择为 然后从所选择的存储单元上的接收者阵列重建供体阵列和接收者信息。 所选择的存储单元被指示为捐赠者阵列已经在丢失的信息被重建在所选择的存储单元之前被捐赠。 优选地，在从多个阵列中选择施主阵列之前，接收器阵列的最小汉明距离为d≥2。
-
公开(公告)号：US20050015656A1
公开(公告)日：2005-01-20
申请号：US10619641
申请日：2003-07-14
申请人： Steven Hetzler , Daniel Smith
发明人： Steven Hetzler , Daniel Smith
CPC分类号： G06F11/1084 , G06F11/008 , G06F2211/1004 , G06F2211/1028
摘要： The error tolerance of an array of m storage units is increased by using a technique referred to as “dodging.” A plurality of k stripes are stored across the array of storage units in which each stripe has n+r elements that correspond to a symmetric code having a minimum Hamming distance d=r+1. Each respective element of a stripe is stored on a different storage unit. An element is selected when a difference between a minimum distance of the donor stripe and a minimum distance of a recipient stripe is greater or equal to 2. The selected element is also stored on a storage unit having no elements of the recipient stripe. A lost element of the recipient stripe is then rebuilt on the selected element.
摘要翻译： 通过使用称为“闪避”的技术来增加m个存储单元阵列的误差容限。 多个k个条纹被存储在存储单元阵列中，其中每个条带具有对应于具有最小汉明距离d = r + 1的对称码的n + r个元素。 条带的每个相应元件被存储在不同的存储单元上。 当供体条纹的最小距离与接收者条纹的最小距离之间的差异大于或等于2时，选择元素。所选择的元素也存储在不具有接收者条带的元素的存储单元上。 然后在所选元素上重建接收者条带的丢失元素。
-
公开(公告)号：US20080016416A1
公开(公告)日：2008-01-17
申请号：US11778641
申请日：2007-07-16
申请人： Steven Hetzler , Daniel Smith
发明人： Steven Hetzler , Daniel Smith
IPC分类号： G11C29/00
CPC分类号： G06F11/1084
摘要： Error tolerance is increased for a storage system having a plurality of arrays by making local redundancy in a selected array globally available throughout the storage system. To achieve the increased error tolerance, a donor array is selected from the plurality of arrays when the difference between a minimum distance of the donor array and a minimum distance of a recipient array is greater or equal to 2. A donor storage unit is selected in the donor array and recipient information is then rebuilt from the recipient array on the selected storage unit. The selected storage unit is indicated to the donor array as having been donated before the lost information is rebuilt on the selected storage unit. Preferably, the minimum Hamming distance of the recipient array is d≧2 before the donor array is selected from the plurality of arrays.
-
公开(公告)号：US20050086575A1
公开(公告)日：2005-04-21
申请号：US10689814
申请日：2003-10-20
CPC分类号： H03M13/2909 , G06F11/1076 , H03M13/134 , H03M13/2906
摘要： The Hamming distance of an array of storage devices is increased by generating a parity check matrix based on column equations that are formed using an orthogonal parity code and includes a higher-order multiplier that changes each column. The higher order multiplier is selected to generate a finite basic field of a predetermined number of elements. The array has M rows and N columns, such that M is greater than or equal to three and N is greater than or equal to three. Row 1 through row M-2 of the array each have n-p data storage devices and p parity storage devices. Row M-1 of the array has n-(p+1) data storage devices and (p+1) parity storage devices. Lastly, row M of the array has N parity storage devices.
摘要翻译： 存储装置阵列的汉明距离通过基于使用正交奇偶校验码形成的列方程生成奇偶校验矩阵而增加，并且包括改变每列的高阶乘法器。 选择较高阶乘数以产生预定数量的元素的有限基本场。 阵列具有M行和N列，使得M大于或等于3，N大于或等于3。 阵列的行1至行M-2各自具有n-p个数据存储设备和p个奇偶校验存储设备。 阵列的行M-1具有n（p + 1）数据存储设备和（p + 1）奇偶校验存储设备。 最后，数组的行M具有N个奇偶校验存储设备。
-
公开(公告)号：US20050015700A1
公开(公告)日：2005-01-20
申请号：US10619648
申请日：2003-07-14
申请人： Steven Hetzler , Daniel Smith , Shmuel Winograd
发明人： Steven Hetzler , Daniel Smith , Shmuel Winograd
CPC分类号： G06F11/1076 , G06F2211/1057 , G06F2211/1059 , G06F2211/1064
摘要： A data storage subsystem that includes three data storage units, three check storage units, and an array controller coupled to the three data and three check storage units can tolerate failure of any three data and check storage units failures can be occur before data stored on the data storage subsystem is lost. Information is stored on the data storage subsystem as a symmetric Maximum Distance Separation code, such as a Winograd code, a Reed Solomon code, an EVENODD code or a derivative of an EVENODD code. The array controller determines the contents of the check storage units so that any three erasures of the data storage units and the check storage units can be corrected by the array controller. The array controller updates a block of data contained in any one of the data storage units and the check storage units using only six IO operations.
摘要翻译： 包含三个数据存储单元，三个检查存储单元和耦合到三个数据的阵列控制器和三个检查存储单元的数据存储子系统可以容忍任何三个数据的故障，并且检查存储单元可能在存储在 数据存储子系统丢失。 信息作为对称的最大距离分离码存储在数据存储子系统上，例如Winograd码，里德所罗门码，EVENODD码或EVENODD码的导数。 阵列控制器确定检查存储单元的内容，使得数据存储单元和检查存储单元的任何三个擦除可以由阵列控制器校正。 阵列控制器仅使用六个IO操作来更新包含在任何一个数据存储单元和检查存储单元中的数据块。
-
公开(公告)号：US20080114934A1
公开(公告)日：2008-05-15
申请号：US12016597
申请日：2008-01-18
申请人： Steven Hetzler , Daniel Smith
发明人： Steven Hetzler , Daniel Smith
IPC分类号： G06F12/16
CPC分类号： G06F11/1076 , G06F3/0601 , G06F11/1088 , G06F2003/0697 , Y10S707/99937
摘要： An optimum pathway to data stored on a data storage system having N storage devices and more than N pathways is determined in response to a read request for the data. A sorter separates the read request into an appropriate segment size for sending to the storage devices of the data storage system. An assigner generates the set of read permutations satisfying the read request. A read permutation is selected based on a metric. A collector receives the requested data from the N storage devices in response to the selected read permutation being sent to the storage devices.
摘要翻译： 响应于对数据的读取请求，确定存储在具有N个存储设备和多于N个通路的数据存储系统上的数据的最佳路径。 分类器将读请求分离成适当的段大小，以便发送到数据存储系统的存储设备。 分配器生成满足读请求的一组读排列。 基于度量来选择读取排列。 响应于所选择的读取置换被发送到存储设备，收集器从N个存储设备接收所请求的数据。
-
公开(公告)号：US20080016413A1
公开(公告)日：2008-01-17
申请号：US11747887
申请日：2007-05-11
申请人： Steven Hetzler , Daniel Smith , Shmuel Winograd
发明人： Steven Hetzler , Daniel Smith , Shmuel Winograd
IPC分类号： G06F11/00
CPC分类号： G06F11/1076 , G06F2211/1057 , G06F2211/1059 , G06F2211/1064
摘要： A data storage subsystem that includes three data storage units, three check storage units, and an array controller coupled to the three data and three check storage units can tolerate failure of any three data and check storage units failures can be occur before data stored on the data storage subsystem is lost. Information is stored on the data storage subsystem as a symmetric Maximum Distance Separation code, such as a Winograd code, a Reed Solomon code, an EVENODD code or a derivative of an EVENODD code. The array controller determines the contents of the check storage units so that any three erasures of the data storage units and the check storage units can be corrected by the array controller. The array controller updates a block of data contained in any one of the data storage units and the check storage units using only six IO operations.
摘要翻译： 包含三个数据存储单元，三个检查存储单元和耦合到三个数据的阵列控制器和三个检查存储单元的数据存储子系统可以容忍任何三个数据的故障，并且检查存储单元可能在存储在 数据存储子系统丢失。 信息作为对称的最大距离分离码存储在数据存储子系统上，例如Winograd码，里德所罗门码，EVENODD码或EVENODD码的导数。 阵列控制器确定检查存储单元的内容，使得数据存储单元和检查存储单元的任何三个擦除可以由阵列控制器校正。 阵列控制器仅使用六个IO操作来更新包含在数据存储单元和检查存储单元中的任何一个中的数据块。
-
公开(公告)号：US20050078395A1
公开(公告)日：2005-04-14
申请号：US10685653
申请日：2003-10-14
申请人： Frank Chu , Steven Hetzler
发明人： Frank Chu , Steven Hetzler
CPC分类号： G11B20/1883 , G11B2220/20
摘要： A data stream received by a hard disk drive (HDD) is organized into at least one cluster having data blocks and spare data blocks and that is equal in size to an integer multiple of the number of sectors in a track of a disk of the HDD. A variable-index writing technique is used to write each data block of a cluster to a corresponding sector of a track that is encountered by a head when the sector is not defective. A sector of the track is skipped during writing when the sector is defective. The number of spare data blocks in a portion of a cluster corresponding to a single track is reduced by the number of sectors that are skipped in the track so that the number of data blocks plus the number of remaining spare data blocks equals the number of sectors in a track.
摘要翻译： 由硬盘驱动器（HDD）接收的数据流被组织成具有数据块和备用数据块的至少一个簇，并且大小相等于HDD的盘的轨道中的扇区数的整数倍 。 使用可变索引写入技术将簇的每个数据块写入当扇区没有缺陷时由头遇到的轨道的相应扇区。 当扇区有缺陷时，在写入期间跳过轨道的扇区。 对应于单个磁道的集群的一部分中的备用数据块的数量减少了在磁道中被跳过的扇区的数量，使得数据块的数量加上剩余的备用数据块的数量等于扇区的数量 在一个轨道。
-
公开(公告)号：US20050015371A1
公开(公告)日：2005-01-20
申请号：US10619633
申请日：2003-07-14
申请人： Steven Hetzler , Daniel Smith
发明人： Steven Hetzler , Daniel Smith
CPC分类号： G06F11/1076 , G06F3/0601 , G06F11/1088 , G06F2003/0697 , Y10S707/99937
摘要： An optimum pathway to data stored on a data storage system having N storage devices and more than N pathways is determined in response to a read request for the data. A sorter separates the read request into an appropriate segment size for sending to the storage devices of the data storage system. An assigner generates the set of read permutations satisfying the read request. A read permutation is selected based on a metric. A collector receives the requested data from the N storage devices in response to the selected read permutation being sent to the storage devices.
摘要翻译： 响应于对数据的读取请求，确定存储在具有N个存储设备和多于N个通路的数据存储系统上的数据的最佳路径。 分类器将读请求分离成适当的段大小，以便发送到数据存储系统的存储设备。 分配器生成满足读请求的一组读排列。 基于度量来选择读取排列。 响应于所选择的读取置换被发送到存储设备，收集器从N个存储设备接收所请求的数据。
-
-
-
-
-
-
-
-
搜索结果
9 条记录 (耗时 0.013 秒)
