公开(公告)号：AT321300T

公开(公告)日：2006-04-15

申请号：AT03753821

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG ,  NG SPENCER

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：CA2503129A1

公开(公告)日：2004-05-13

申请号：CA2503129

申请日：2003-10-17

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  NG SPENCER ,  YOUNG HONESTY CHENG ,  MENON JAISHANKAR MOOTHEDATH

IPC: G06F11/10

Abstract: Stored data can be recovered from a disk array having at least 2n + 1 physic al disks that are capable of storing n physical disks worth of data when any tw o disks fail, or when more than two dependent disks fail. Data is stored in da ta stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe , the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

公开(公告)号：DE69219208D1

公开(公告)日：1997-05-28

申请号：DE69219208

申请日：1992-06-08

Applicant: IBM

Inventor： MENON JAISHANKAR MOOTHEDATH ,  MATSON RICHARD LEWIS ,  NG SPENCER WAH-FUNG

IPC: G06F12/16 ,  G06F3/06 ,  G06F11/10 ,  G06F11/20 ,  G11C29/00 ,  G11B20/18

公开(公告)号：CA2042872C

公开(公告)日：1995-08-15

申请号：CA2042872

申请日：1991-05-17

Applicant: IBM

Inventor： BRADY JAMES THOMAS ,  CINTRON RUTH ENID ,  GOLDSTEIN STEPHEN ,  JU JEAN HO-MING WANG ,  MENON JAISHANKAR MOOTHEDATH

IPC: G06F3/06 ,  G06F11/10 ,  G06F13/42 ,  G11B20/10 ,  G11B20/18 ,  G06F13/40

Abstract: A method and means for managing access to a logical track of KN blocks of which K are parity blocks. The KN blocks are distributed and stored in an array of N DASDs having K blocks per physical track per DASD. The array includes control means for securing synchronous access to selectable ones of the DASDs responsive to each access request. The method involves (a) formatting the blocks onto the array using a row major order modulus as the metric for balancing the data rate and concurrency (the number of DASDs bound per access) and (b) executing the random sequences of large and small access requests over the array.

公开(公告)号：AU2003278310A8

公开(公告)日：2004-06-18

申请号：AU2003278310

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  YOUNG HONESTY CHENG ,  MENON JAISHANKAR MOOTHEDATH

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：AU2003278310A1

公开(公告)日：2004-06-18

申请号：AU2003278310

申请日：2003-10-15

Applicant: IBM

Inventor： HSU WINDSOR WEE SUN ,  MENON JAISHANKAR MOOTHEDATH ,  YOUNG HONESTY CHENG

IPC: H04L29/06 ,  H04L29/08

Abstract: An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

公开(公告)号：SG60155A1

公开(公告)日：1999-02-22

申请号：SG1997004102

申请日：1997-11-20

Applicant: IBM

Inventor： BENHASE MICHAEL T ,  BRADY JAMES THOMAS ,  FINNEY DAMON W ,  HARTUNG MICHAEL H ,  KO MICHAEL ANTHONY ,  LANG DONALD J ,  MENON JAISHANKAR MOOTHEDATH

IPC: G06F3/06 ,  G06F13/38 ,  G06F12/02

Abstract: A method enables a host processor, which employs variable length (VL) records, to communicate with disk storage which employs fixed length (FL) sectors for storage of the VL records. The method comprises the steps of: a) deriving a first control data structure for an update VL record, the first control data structure including information describing segments of the update VL record; b) determining a disk track that includes a FL sector wherein am old VL record commences that corresponds to the update VL record; c) reading each FL sector in the disk track and creating a control data structure which includes information describing each VL record stored in the disk track; d) substituting in a control data structure for the old VL record that corresponds to the update VL record, information regarding update data from the first control data structure; e) recording in the disk track, data indicated by each control data structure determined in steps c) and d); and f) if the old VL record ends at other than a sector break of a FL sector, reblocking VL records into FL sectors which are recorded thereafter on the disk track. The invention also enables a read action to be accomplished in one rotation of a disk even though it commences at a FL sector that is not at the beginning of a VL record to be accessed.

公开(公告)号：DE69222879D1

公开(公告)日：1997-12-04

申请号：DE69222879

申请日：1992-02-11

Applicant: IBM

Inventor： MENON JAISHANKAR MOOTHEDATH

IPC: G06F3/06 ,  G06F11/10 ,  G11B20/18

Abstract: In a method and means for accessing arrays of DASDs, write update of variable length records stored in row major order on an array of N DASDs is facilitated by utilising the correlation between byte offsets of a variable length record and the byte offset of a byte level parity image of data stored on the same track across N-1 other DASDs. Each DASD physical track has a home address field HA, a record zero field RO, one or more count fields C and one or more data fields D. Each count field C is followed by a variable length block data field D. Parity is recorded in the data field in physical track N in the DASD N. If data field D3 is to be updated and is five bytes long, the old and new values of D3 are XORed and the old value of the last five bytes in D8 is changed to match this.