-
公开(公告)号：WO2005006173A3
公开(公告)日：2006-06-08
申请号：PCT/EP2004051385
申请日：2004-07-07
Applicant: HETZLER STEVEN ROBERT , SMITH DANIEL FELIX , WINOGRAD SHMUEL , IBM , IBM UK
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX , WINOGRAD SHMUEL
CPC classification number: G06F11/1076 , G06F2211/1057 , G06F2211/1059 , G06F2211/1064
Abstract: 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 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.
Abstract translation: 包含三个数据存储单元，三个检查存储单元和耦合到三个数据的阵列控制器和三个检查存储单元的数据存储子系统可以容忍任何三个数据的故障，并且检查存储单元可能在存储在 数据存储子系统丢失。 信息作为对称的最大距离分离码存储在数据存储子系统上，例如Winograd代码，Reed Solomon码，EVENODD码或EVENODD码的导数。 阵列控制器确定检查存储单元的内容，使得数据存储单元和检查存储单元的任何三个擦除可以由阵列控制器校正。 阵列控制器仅使用六个IO操作来更新包含在任何一个数据存储单元和检查存储单元中的数据块。
-
公开(公告)号：WO2005006215A2
公开(公告)日：2005-01-20
申请号：PCT/EP2004051382
申请日：2004-07-07
Applicant: IBM , IBM UK , HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
CPC classification number: G06F11/1084 , G06F11/008 , G06F2211/1004 , G06F2211/1028
Abstract: 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.
Abstract translation: 通过使用称为“闪避”的技术来增加m个存储单元阵列的容错。 多个k条纹被存储在存储单元阵列之间，其中每个条带具有对应于具有最小汉明距离d = r + 1的对称码的n + r个元素。条带的每个相应元素被存储在不同的 存储单元。 当供体条纹的最小距离与接收者条纹的最小距离之间的差异大于或等于2时，选择元素。所选择的元素也存储在不具有接收者条带的元素的存储单元上。 然后在所选元素上重建接收者条带的丢失元素。
-
公开(公告)号：WO2005006173A9
公开(公告)日：2006-02-23
申请号：PCT/EP2004051385
申请日：2004-07-07
Applicant: IBM , IBM UK , HETZLER STEVEN ROBERT , SMITH DANIEL FELIX , WINOGRAD SHMUEL
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX , WINOGRAD SHMUEL
CPC classification number: G06F11/1076 , G06F2211/1057 , G06F2211/1059 , G06F2211/1064
Abstract: 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 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.
Abstract translation: 包含三个数据存储单元，三个检查存储单元和耦合到三个数据的阵列控制器和三个检查存储单元的数据存储子系统可以容忍任何三个数据的故障，并且检查存储单元可能在存储在 数据存储子系统丢失。 信息作为对称的最大距离分离码存储在数据存储子系统上，例如Winograd代码，Reed Solomon码，EVENODD码或EVENODD码的导数。 阵列控制器确定检查存储单元的内容，使得数据存储单元和检查存储单元的任何三个擦除可以由阵列控制器校正。 阵列控制器仅使用六个IO操作来更新包含在任何一个数据存储单元和检查存储单元中的数据块。
-
公开(公告)号：WO2005006172A3
公开(公告)日：2005-11-24
申请号：PCT/EP2004051363
申请日：2004-07-05
Applicant: IBM , IBM UK , HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
CPC classification number: G06F11/1076 , G06F3/0601 , G06F11/1088 , G06F2003/0697 , Y10S707/99937
Abstract: 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 recieves the requested data from the N storage devices in response to the selected read permutation being sent to the storage devices.
Abstract translation: 响应于对数据的读取请求，确定存储在具有N个存储设备和多于N个路径的数据存储系统上的数据的最佳途径。 分拣机将读取请求分成合适的段大小以发送到数据存储系统的存储设备。 分配器生成满足读取请求的读取排列组。 基于度量选择读取排列。 收集器接收来自N个存储设备的所请求的数据以响应所选的读取排列被发送到存储设备。
-
公开(公告)号：WO2005006198A2
公开(公告)日：2005-01-20
申请号：PCT/EP2004051383
申请日：2004-07-07
Applicant: IBM , IBM UK , HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
CPC classification number: G06F11/1084
Abstract: 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.
Abstract translation: 通过使整个存储系统中的所选阵列中的本地冗余全局可用，具有多个阵列的存储系统的容错增加。 为了实现增加的误差容限，当供体阵列的最小距离和接收器阵列的最小距离之间的差异大于或等于2时，从多个阵列中选择供体阵列。供体存储单元被选择为 然后从所选择的存储单元上的接收者阵列重建供体阵列和接收者信息。 所选择的存储单元被指示为捐赠者阵列已经在丢失的信息被重建在所选择的存储单元之前被捐赠。 优选地，在从多个阵列中选择施主阵列之前，接收器阵列的最小汉明距离为d≥2。
-
Patent Agency Ranking
公开(公告)号：JP2004213647A
公开(公告)日：2004-07-29
申请号：JP2003421669
申请日：2003-12-18
Applicant: Internatl Business Mach Corp
, インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Inventor： STEVEN ROBERT HELLER , SMITH DANIEL FELIX
CPC classification number: G06F12/0804 , G06F12/0866 , G06F2212/312
Abstract: PROBLEM TO BE SOLVED: To enhance performance of a log structure writing cache for a data storage system and the storage system. SOLUTION: There are a RAID (redundant array of independent disks), a magnetic disk, an optical disk and a magnetic tape storage, etc. as the storage system. The writing cache is preferably mounted on a main storage, however, it may be mounted on other storage elements and includes a cache line for temporarily storing written data at a nonvolatile state. Thus, system performance is enhanced by sequentially writing data in a target storage position later. Meta data by every cache line is also held in the writing cache. The meta data includes target sector addresses to each sector in the line and a number indicating an order of data to be written in the cache line. Entry of a buffer table is provided by every cache line. A hash table is used for searching the buffer table by calculating sector addresses required for reading/writing of each piece of data. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract translation: 要解决的问题：提高数据存储系统和存储系统的日志结构写入高速缓存的性能。 解决方案：存储系统有RAID（独立磁盘冗余阵列），磁盘，光盘和磁带存储等。 写入缓存优选地安装在主存储器上，然而，其可以安装在其他存储元件上，并且包括用于在非易失性状态下临时存储写入数据的高速缓存行。 因此，通过在稍后的目标存储位置中顺序写入数据来提高系统性能。 每个高速缓存行的元数据也保存在写入高速缓存中。 元数据包括行中每个扇区的目标扇区地址和指示要写入高速缓存行的数据顺序的数字。 缓存表的输入由每条缓存行提供。 哈希表用于通过计算读取/写入每个数据所需的扇区地址来搜索缓冲表。 版权所有（C）2004，JPO＆NCIPI
-
公开(公告)号：DE602004030573D1
公开(公告)日：2011-01-27
申请号：DE602004030573
申请日：2004-07-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
-
公开(公告)号：CA2532766C
公开(公告)日：2011-04-05
申请号：CA2532766
申请日：2004-07-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX , WINOGRAD SHMUEL
Abstract: 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 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.
-
公开(公告)号：CA2694819A1
公开(公告)日：2005-01-20
申请号：CA2694819
申请日：2004-07-07
Applicant: IBM
Inventor： HETZLER STEVEN ROBERT , SMITH DANIEL FELIX
Abstract: 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.
-
公开(公告)号：GB2491004A
公开(公告)日：2012-11-21
申请号：GB201207613
申请日：2012-05-02
Applicant: IBM
Inventor： SHMUELI EDI , GILL BINNY SHER , ASSAF NITZAN , LOTEM EYAL , BELLUOMINI WENDY ANN , HAFNER JAMES LEE , SMITH DANIEL FELIX , HETZLER STEVEN ROBERT , NAYAR GOPAL
Abstract: A storage system contains a controller 102, a flash memory 106 and another type of storage device, such as a hard disc drive 108. The flash memory has a life span based on the number of write/erase cycles for each block. The controller estimates the remaining lifespan of the flash memory. Based on the estimate, it determines which data should be written to the flash memory. A limit may be placed on the size of data transfer written to the flash memory. Data transfers over the limit are written to the other storage device without being written to the flash. A limit may be placed on the amount of data pre-fetched from the other storage device during read operations. A proportion of transfers to the system may be written directly to the other storage device and not to the flash memory.
-
-
-
-
-
-
-
-
-
Search Results
23
records
(took 0.02 seconds)
