EP0697660A1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
HMC: a hybrid mirrored and chained data replication method to support high availability for disk arrays
Assignee: International Business Machines Corp
•
Filing: 1995-07-05
•
Granted: —
•
Expires: 2015-07-05
Abstract
Abstract A method of distributing a set of data among a plurality of disks, which provides for load balancing in the event of a disk failure. In accordance with the method the total number of the disks in an array are divided into a number of clusters. The blocks of data are then stored in each cluster such that each cluster contains a complete set of the data and such that data block placement in each cluster is a unique permutation of the data block placement in the other clusters. In the event of a disk failure, data block accesses to the failed disk are redirected to a disk in the other cluster having a copy of the data block and further access to the disks that remain operational are rebalanced.
Inventors
- 👤 Ming-Syan Chen
- 👤 Hui-I Hsiao
- 👤 Chung-Shen Li
- 👤 Philip Shi-Lung Yu
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-03 02:16
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G06; G06F; G06F11/00; G06F11/07; G06F11/16; G06F11/20; G06F11/2053; G06F11/2094; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F3/0613; G06F3/0628; G06F3/0646; G06F3/065; G06F3/0668; G06F3/067; G11B20/18; G11B20/1833; G11C; G11C29/00; G11C29/70; G11C29/74; H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/231; H04N21/23103; H04N21/23116
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
72 words
A method of distributing a set of data among a plurality of disks, comprising steps of: dividing a total number of the disks into a plurality of clusters; and, storing blocks of the data in each cluster such that each cluster contains a complete set of the data and such that data block placement in at least some of the clusters differs from data block placement in other ones of the clusters.
Claim 2
Independent Claim
72 words
A method of distributing a set of data among a plurality of disks, comprising steps of: dividing a total number of the disks into a plurality of clusters; and, storing blocks of the data in each cluster such that each cluster contains a complete set of the data and such that data block placement in at least some of the clusters differs from data block placement in other ones of the clusters.
Claim 3
Independent Claim
72 words
A method of distributing a set of data among a plurality of disks, comprising steps of: dividing a total number of the disks into a plurality of clusters; and, storing blocks of the data in each cluster such that each cluster contains a complete set of the data and such that data block placement in each cluster is a unique permutation of the data block placement in other ones of the clusters.
Claim 4
Independent Claim
72 words
A method of distributing a set of data among a plurality of disks, comprising steps of: dividing a total number of the disks into a plurality of clusters; and, storing blocks of the data in each cluster such that each cluster contains a complete set of the data and such that data block placement in each cluster is a unique permutation of the data block placement in other ones of the clusters.
Claim 5
Dependent Claim
71 words
The method of Claim 2 wherein for given number rn of the disks numbered 0, 1, 2, ... , rn-1, where r is a number of clusters, n is a number of disks of a cluster, the i th partition of the j th replica is placed on the disk numbered d(i,j) in accordance with the relationship d(i,j) = (i + [i/n] * (j-1)) mod n + (j-1) * n .
Claim 6
Dependent Claim
140 words
A video server, comprising: a network interface; a disk array coupled to the network interface and having a set of movies stored thereon, each of the movies being stored as a plurality of data blocks; a disk array coupled to the network interface and having a set of movies stored thereon, each of the movies being stored as a plurality of data blocks; a scheduler coupled to the disk array, for scheduling transmission of the movies to users, by way of the network interface; and, wherein, a complete replicated set of the movies is stored in each of a plurality of groups of the disks, each group of the disks having the data blocks placed thereon such that the data block placement in each group is a unique permutation of the data block placement in other ones of the groups.
Claim 7
Dependent Claim
140 words
A video server, comprising: a network interface; a disk array coupled to the network interface and having a set of movies stored thereon, each of the movies being stored as a plurality of data blocks; a disk array coupled to the network interface and having a set of movies stored thereon, each of the movies being stored as a plurality of data blocks; a scheduler coupled to the disk array, for scheduling transmission of the movies to users, by way of the network interface; and, wherein, a complete replicated set of the movies is stored in each of a plurality of groups of the disks, each group of the disks having the data blocks placed thereon such that the data block placement in each group is a unique permutation of the data block placement in other ones of the groups.
Claim 8
Dependent Claim
25 words
The video server of Claim 4 wherein the schedular schedules the movies as a function of user requests received by way of the network interface.
Claim 9
Dependent Claim
39 words
The video server of Claim 4 further comprising: a disk controller coupled to the disks and the video server for controlling accesses to the disks and for rebalancing data block accesses in the event of failure of a disk.
Claim 10
Independent Claim
112 words
A method of storing movies in a video server of a type having a plurality of disks for storage of movies, comprising the steps of: selecting a set of the movies to store on the disks; placing data blocks of the movies on the disks such that each of a plurality of groups of the disks has a replicated set of the movies stored thereon and such that each group of the disks has the data blocks placed thereon such that the data block placement in each group is a unique permutation of the data block placement in other ones of the groups. rebalancing further access to the disks that remain operational.
Claim 11
Independent Claim
112 words
A method of storing movies in a video server of a type having a plurality of disks for storage of movies, comprising the steps of: selecting a set of the movies to store on the disks; placing data blocks of the movies on the disks such that each of a plurality of groups of the disks has a replicated set of the movies stored thereon and such that each group of the disks has the data blocks placed thereon such that the data block placement in each group is a unique permutation of the data block placement in other ones of the groups. rebalancing further access to the disks that remain operational.
Claim 12
Dependent Claim
71 words
The method of Claim 7 wherein for given number rn of the disks numbered 0, 1, 2, ... , rn-1, where r is a number of clusters, n is a number of disks of a cluster, the i th partition of the j th replica is placed on the disk numbered d(i,j) in accordance with the relationship d(i,j) = (i + [i/n] * (j-1)) mod n + (j-1) * n .
References Cited (Backward Citations)
EP0469924A2
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.