← Back to Patent Explorer
US5185884A Expired / Lapsed US ⏱️ 0.0 years remaining

Computer controlled optimized pairing of disk units

Assignee: International Business Machines Corp
•
Filing: 1990-01-24
•
Granted: 1993-02-09
•
Expires: 2010-01-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of pairing disk units in a computer system where mirroring is desirable is disclosed. Where possible, disk units are paired with other disk units located on a different bus. This provides the highest level of protection against inaccessible data due to data loss or failure of a component in the computer system. Where this is not possible, the remaining disk units are paired with disk units located on a different I/O processor, a different controller, or a different disk enclosure. Where none of these pairings are possible, the remaining disk units fall below the threshold level of protection and therefore cannot be paired within the segment. Any disk units that could not be paired are placed on a spare list. Several attempts are made to pair up disk units on the spare list. If all of these attempts fail, the paired disk units with the lowest level of protection are broken apart and added to the spare list, where attempts are again made to pair up the disk units on the spare list. After all units are paired, a pair of disk units is compared with other pairs of disk units to see if the level of protection can be increased by swapping mates. This comparison of pairs of disk units is repeated until the level of protection is optimized. Each time the computer system is started, a check is made to determine if a configuration change resulted in a lower level of protection. If so, the user is asked if he would like the disk units on the computer system to be re-paired to increase the level of protection.

Inventors

  • 👤 Dennis R. Martin
  • 👤 Michael J. McDermott
  • 👤 Stuart D. Plumlee
  • 👤 Robert H. Satin
  • 👤 Robert L. Wenger

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 18:35
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F11/00; G06F11/07; G06F11/16; G06F11/20; G06F11/2053; G06F11/2056; G06F11/2069; G06F11/008; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1803; G11C; G11C29/00; G11C29/70; G11C29/74; G06F11/22; G06F11/2257

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 99 words
A method for optimizing the pairing of a plurality of disk units, comprising the machine-executed steps of: selecting a first disk unit; selecting a second disk unit, wherein the first and second disk units are a first potential pair; calculating a first level of protection for said first potential pair: selecting a third disk unit, wherein the first and third disk units are a second potential pair; determining a second level of protection for the second potential pair: and pairing said first and second disk units together unless said second level of protection exceeds said first level of protection.
Claim 2
Independent Claim 99 words
A method for optimizing the pairing of a plurality of disk units, comprising the machine-executed steps of: selecting a first disk unit; selecting a second disk unit, wherein the first and second disk units are a first potential pair; calculating a first level of protection for said first potential pair: selecting a third disk unit, wherein the first and third disk units are a second potential pair; determining a second level of protection for the second potential pair: and pairing said first and second disk units together unless said second level of protection exceeds said first level of protection.
Claim 3
Dependent Claim 24 words
The method of claim 1, wherein said pairing step is performed only if said first level of protection exceeds a threshold level of protection.
Claim 4
Dependent Claim 30 words
The method of claim 1, further comprising the step of: pairing the first and third disk units together if said second level of protection exceeds said first level of protection.
Claim 5
Dependent Claim 24 words
The method of claim 3, wherein said pairing step is performed only if said second level of protection exceeds a threshold level of protection.
Claim 6
Dependent Claim 62 words
The method of claim 1, further comprising the steps of: selecting a fourth disk unit, wherein the first and fourth disk units are a third potential pair; determining a third level of protection for the third potential pair: and pairing the first and second disk units together unless said second or said third levels of protection exceeds said first level of protection.
Claim 7
Dependent Claim 24 words
The method of claim 5, wherein said pairing step is performed only if said first level of protection exceeds a threshold level of protection.
Claim 8
Dependent Claim 43 words
The method of claim 5, further comprising the step of: pairing the first and third disk units together if said second level of protection exceeds said first level of protection and said third level of protection does not exceed said level of protection.
Claim 9
Dependent Claim 24 words
The method of claim 7, wherein said pairing step is performed only if said second level of protection exceeds a threshold level of protection.
Claim 10
Independent Claim 123 words
A method for optimizing the pairing of a plurality of disk units 1-N, comprising the machine-executed steps of: (a) selecting a disk unit x, wherein x is one of said plurality of disk units 1-N: (b) picking a disk unit y, wherein y is one of said plurality of disk units 1-N different than disk unit x, wherein the first and second disk units are a potential pair x+y; (c) calculating a level of protection for potential pair x+y: (d) repeatedly setting y equal to a different one of said plurality of disk units 1-N and repeating step (c): and (e) pairing disk unit x with the disk unit y determined in steps (b) through (d) to have the highest level of protection.
Claim 11
Independent Claim 123 words
A method for optimizing the pairing of a plurality of disk units 1-N, comprising the machine-executed steps of: (a) selecting a disk unit x, wherein x is one of said plurality of disk units 1-N: (b) picking a disk unit y, wherein y is one of said plurality of disk units 1-N different than disk unit x, wherein the first and second disk units are a potential pair x+y; (c) calculating a level of protection for potential pair x+y: (d) repeatedly setting y equal to a different one of said plurality of disk units 1-N and repeating step (c): and (e) pairing disk unit x with the disk unit y determined in steps (b) through (d) to have the highest level of protection.
Claim 12
Dependent Claim 25 words
The method of claim 9, wherein step (e) is not performed if the highest level of protection does not exceed a threshold level of protection.
Claim 13
Dependent Claim 35 words
The method of claim 10, further comprising the step of: (f) repeatedly setting x equal to a different one of said plurality of disk units 1-N not previously paired and repeating steps (b) through (e).
Claim 14
Dependent Claim 28 words
The method of claim 11, further comprising the step of: (g) repeating steps (b) through (f) until all of said plurality of disk units 1-N are paired together.
Claim 15
Dependent Claim 48 words
The method of claim 12, further comprising the steps of: (h) swapping mates between a first pair of disk units and a second pair of disk units if said swapping would result in a higher level of protection for both said first and second pair of disk units.
Claim 16
Independent Claim 160 words
A method for optimizing the pairing of a plurality of disk units 1 to N, wherein said plurality of disk units 1 to N is segmented into a first group 1 to M and a second group M+1 to N. said method comprising the machine-executed steps of: (a) selecting a disk unit x, wherein x is one of said first group of disk units 1 to M: (b) picking a disk unit y, wherein y is one of said first group of disk units 1 to M different than disk unit x, wherein disk units x and y are a potential pair x+y: (c) calculating a level of protection for potential pair x+y: (d) repeatedly setting y equal to a different one of said first group of disk units 1 to M and repeating step (c): and (e) pairing disk unit x with the disk unit y determined in steps (b) through (d) to have the highest level of protection.
Claim 17
Independent Claim 160 words
A method for optimizing the pairing of a plurality of disk units 1 to N, wherein said plurality of disk units 1 to N is segmented into a first group 1 to M and a second group M+1 to N. said method comprising the machine-executed steps of: (a) selecting a disk unit x, wherein x is one of said first group of disk units 1 to M: (b) picking a disk unit y, wherein y is one of said first group of disk units 1 to M different than disk unit x, wherein disk units x and y are a potential pair x+y: (c) calculating a level of protection for potential pair x+y: (d) repeatedly setting y equal to a different one of said first group of disk units 1 to M and repeating step (c): and (e) pairing disk unit x with the disk unit y determined in steps (b) through (d) to have the highest level of protection.
Claim 18
Dependent Claim 24 words
The method of claim 14, wherein step (e) is performed only if the highest level of y protection exceeds a threshold level of protection.
Claim 19
Dependent Claim 37 words
The method of claim 15, further comprising the step of: (f) repeatedly setting x equal to a different one of said plurality of disk units 1 to M not previously paired and repeating steps (b) through (e).
Claim 20
Dependent Claim 126 words
The method of claim 16, further comprising the step of: (g) selecting a disk unit x, wherein x is one of said plurality of disk units M+1 to N in said second group: (h) picking a disk unit y, wherein y is one of said second group of disk units M+1 to N different than disk unit x, wherein disk units x and y are a potential pair x+y: (i) calculating a level of protection for potential pair x+y: (j) repeatedly setting y equal to a different one of said second group of disk units M+1 to N and repeating step (i): and (k) pairing disk unit x with the disk unit y determined in steps (h) through (j) to have the highest level of protection.
Claim 21
Dependent Claim 23 words
The method of claim 17, wherein step (k) is performed only if the highest level of protection exceeds a threshold level of protection.
Claim 22
Dependent Claim 37 words
The method of claim 18, further comprising the step of: (1) repeatedly setting x equal to a different one of said plurality of disk units M+1 to N not previously paired and repeating steps (g) through (k).
Claim 23
Dependent Claim 48 words
The method of claim 19, further comprising the step of: (v) swapping mates between a first pair of disk units and a second pair of disk units if said swapping would result in a higher level of protection for both said first and second pair of disk units.
Claim 24
Dependent Claim 32 words
The method of claim 19, wherein all disk units that could not be paired in steps (a) through (1) are placed on a spare list comprising spare disk units 1 to S.
Claim 25
Dependent Claim 117 words
The method of claim 21, further comprising the steps of: (m) selecting a disk unit b, wherein b is one of said disk units on said spare list: (n) picking a disk unit c, wherein c is one of said disk units on said spare list different than disk unit b, wherein disk units b and c are a potential pair b+c: (o) calculating a level of protection for potential pair b+c: (p) repeatedly setting c equal to a different one of said disk units on said spare list and repeating step (o); and (q) pairing disk unit b with the disk unit c determined in steps (n) through (p) to have the highest level of protection.
Claim 26
Dependent Claim 23 words
The method of claim 22, wherein step (q) is performed only if the highest level of protection exceeds a threshold level of protection.
Claim 27
Dependent Claim 37 words
The method of claim 23, further comprising the step of: (r) repeatedly setting b equal to a different one of said plurality of disk units 1 to S not previously paired and repeating steps (m) through (q).
Claim 28
Dependent Claim 73 words
The method of claim 24, if any disk units 1-S are still unpaired, comprising the steps of: (s) determining the pair of disk units x+y with the lowest level of protection paired in steps (a) through (1): (t) adding the pair with the lowest level of protection paired in steps (a) through (1) to said spare list; and (u) repeating steps (m) through (t) until all disk units 1 to N are paired.
Claim 29
Dependent Claim 48 words
The method of claim 25, further comprising the step of: (v) swapping mates between a first pair of disk units and a second pair of disk units if said swapping would result in a higher level of protection for both said first and second pair of disk units.

References Cited (Backward Citations)

US3634830A Cited
US3623006A Cited
US4608688A Cited
US4819159A Cited
US4958273A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-02-09 1996-08-10 1997-02-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-02-09 2000-08-10 2001-02-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-02-09 2004-08-10 2005-02-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag