公开(公告)号：CA2532997C

公开(公告)日：2012-07-24

申请号：CA2532997

申请日：2004-07-07

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  SMITH DANIEL FELIX

IPC: G06F17/30 ,  G06F11/00 ,  G06F11/10

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.

公开(公告)号：SG145728A1

公开(公告)日：2008-09-29

申请号：SG2008059032

申请日：2004-07-07

Applicant: IBM

Inventor： HETZLER STEVEN ROBERT ,  SMITH DANIEL FELIX

IPC: G06F11/00 ,  G06F11/10 ,  G06F17/30

Abstract: DATA STORAGE ARRAY The error tolerance of an array (300) of m storage units is increased by using a technique referred to a "dodging". A plurality of k stripes are stored across the array (300) of storage units (D1 - D9) 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 (Dl - D9). 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 (D 1 - D9) having no elements of the recipient stripe. A lost element of the recipient stripe is then rebuilt on the selected element.

公开(公告)号：CA2532766A1

公开(公告)日：2005-01-20

申请号：CA2532766

申请日：2004-07-07

Applicant: IBM

Inventor： SMITH DANIEL FELIX ,  HETZLER STEVEN ROBERT ,  WINOGRAD SHMUEL

IPC: G06F3/06 ,  G06F11/10 ,  G11C29/00

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 erasure s of the data storage units and the check storage units can be corrected by th e 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.