-
1.发明申请SUPPORT OF MULTIPLE NATIVE NETWORK PROTOCOL IMPLEMENTATIONS IN A SINGLE SYSTEM 审中-公开在单一系统中支持多个本地网络协议实现
公开(公告)号：WO2004049670A3
公开(公告)日：2004-12-23
申请号：PCT/GB0304448
申请日：2003-10-15
CPC classification number: H04L67/1008 , H04L67/1002 , H04L67/1012 , H04L67/1019 , H04L67/1097 , H04L67/327 , H04L69/329 , H04L2029/06054
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.
Abstract translation: 智能路由器将用户请求路由到能够本地处理该请求的存储服务器，而不进行仿真。 请求将自动路由，不需要用户的任何指令或交互。 智能路由器包括一个存储槽状计算环境和一组智能路由器。 该智能路由器通过呈现单个网络IP地址，向用户显示单个实体。 当智能路由器接收到请求时，会检查协议类型，并将请求路由到相应的存储槽客户端之一。 智能路由器不会更改请求消息的内容，因此存储系统不会意识到智能路由器的存在。 因此，除非需要，任何返回消息都不需要经过智能路由器。
-
2.发明专利
公开(公告)号：AU2003271982A1
公开(公告)日：2004-05-25
申请号：AU2003271982
申请日：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.
-
公开(公告)号：DE69231841D1
公开(公告)日：2001-07-05
申请号：DE69231841
申请日：1992-03-31
Applicant: IBM
Inventor： MENON JAISHANKAR MOOTHEDATH
Abstract: In order that variable length records be accessed from an array of (N+2) synchronous fixed block formatted DASDs in a single pass and in the presence of a single DASD failure, each record is partitioned into a variable number K of fixed length blocks, the blocks are written on the DASDs in column major order K modulo (N+1), the order is constrained such that the first block of each record resides on the (N+1)th DASD, a parity block for each column resides on an (N+2)th DASD, and each parity block spans N blocks in the same column from the first N DASDs and one block one column offset thereto on the (N+1)th DASD. With four DASDs, DASD4 is reserved as parity DASD. In column major order, block 1 containing the home address HA is on DASD1, block 2 containing the record RO is on DASD2 and block 3 containing the count field C1 for record 1 is on DASD3. Blocks 4, 5 and 6, containing data for record 1 and the count field C2 for record 2 are on DASD2 1, 2 and 3, respectively. Blocks 7, 8 and 9, containing data for record 2, zeros and the count field for record 3 are similarly on DASDs 1, 2 and 3, respectively, and so on. All count fields are on DASD3. Parity from blocks 1 and 2 is stored in block P1 of DASD4. Parity from blocks 3, 4 and 5 is stored in block P2, and so on.
-
公开(公告)号：CA2063897C
公开(公告)日：1998-05-05
申请号：CA2063897
申请日：1992-03-24
Applicant: IBM
Abstract: A method and means in which data and parity blocks forming parity groups together with spare blocks are distributed over array block locations according to at least one combinatorial design, each group having N data and P parity blocks. The combinatorial designs yield uniform or balanced loading thereby minimizing the number of accesses to reconstruct missing data and parity blocks and their copyback into spare block locations, and, minimize the number of accesses to the reconstructed data referenced subsequent to its copyback. Distributions of the spare block capacity of one or two DASDs are shown over single and multiple arrays and shared among multiple arrays. Parity block distribution although ancillary to spare distribution enhances throughput and reduces the number of accesses for rebuild etc.
-
-
Patent Agency Ranking6.发明专利
公开(公告)号：CA2739639A1
公开(公告)日：2004-05-13
申请号：CA2739639
申请日：2003-10-17
Applicant: IBM
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.
-
公开(公告)号：DE69231841T2
公开(公告)日：2001-10-25
申请号：DE69231841
申请日：1992-03-31
Applicant: IBM
Inventor： MENON JAISHANKAR MOOTHEDATH
Abstract: In order that variable length records be accessed from an array of (N+2) synchronous fixed block formatted DASDs in a single pass and in the presence of a single DASD failure, each record is partitioned into a variable number K of fixed length blocks, the blocks are written on the DASDs in column major order K modulo (N+1), the order is constrained such that the first block of each record resides on the (N+1)th DASD, a parity block for each column resides on an (N+2)th DASD, and each parity block spans N blocks in the same column from the first N DASDs and one block one column offset thereto on the (N+1)th DASD. With four DASDs, DASD4 is reserved as parity DASD. In column major order, block 1 containing the home address HA is on DASD1, block 2 containing the record RO is on DASD2 and block 3 containing the count field C1 for record 1 is on DASD3. Blocks 4, 5 and 6, containing data for record 1 and the count field C2 for record 2 are on DASD2 1, 2 and 3, respectively. Blocks 7, 8 and 9, containing data for record 2, zeros and the count field for record 3 are similarly on DASDs 1, 2 and 3, respectively, and so on. All count fields are on DASD3. Parity from blocks 1 and 2 is stored in block P1 of DASD4. Parity from blocks 3, 4 and 5 is stored in block P2, and so on.
-
公开(公告)号：DE69127229T2
公开(公告)日：1998-02-12
申请号：DE69127229
申请日：1991-05-20
Applicant: IBM
Inventor： BRADY JAMES THOMAS , CINTRON RUTH ENID , GOLDSTEIN STEPHEN , JU JEAN HO-MING WANG , MENON JAISHANKAR MOOTHEDATH
Abstract: Described is 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 array.
-
公开(公告)号：DE69127229D1
公开(公告)日：1997-09-18
申请号：DE69127229
申请日：1991-05-20
Applicant: IBM
Inventor： BRADY JAMES THOMAS , CINTRON RUTH ENID , GOLDSTEIN STEPHEN , JU JEAN HO-MING WANG , MENON JAISHANKAR MOOTHEDATH
Abstract: Described is 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 array.
-
10.发明专利
公开(公告)号：CA2503129C
公开(公告)日：2011-08-09
申请号：CA2503129
申请日：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.
-
-
-
-
-
-
-
-
-
Search Results
18
records
(took 0.018 seconds)
