US6976187B2ExpiredUtilityA1

Rebuilding redundant disk arrays using distributed hot spare space

90
Assignee: BROADCOM CORPPriority: Nov 8, 2001Filed: Nov 8, 2001Granted: Dec 13, 2005
Est. expiryNov 8, 2021(expired)· nominal 20-yr term from priority
G06F 11/10G06F 11/1076G06F 2211/1028
90
PatentIndex Score
61
Cited by
11
References
9
Claims

Abstract

A method and system that allows the distribution of hot spare space across multiple disk drives that also store the data and redundant data in a fully active array of redundant independent disks, so that an automatic rebuilding of the array to an array of the identical level of redundancy can be achieved with fewer disk drives. The method configures the array with D disk drives of B physical blocks each. N user data and redundant data blocks are allocated to each disk drive, and F free blocks are allocated as hot spare space to each disk drive, where N+F<=B, and ((D−M)×F)>=N. Thus, rebuilding of data and redundant blocks of a failed disk drive in the free blocks of the remaining disk drives is enabled after M disk drive failures.

Claims

exact text as granted — not AI-modified
1. A method for configuring and rebuilding a redundant array of independent disks, comprising:
 configuring the array with D disk drives of B physical blocks each; 
 allocating N user data and redundant data blocks to each disk drive; and 
 allocating F free blocks as hot spare space to each disk drive, where N+F <=B, and ((D−M)×F)>=N to enable rebuilding of data and redundant blocks of a failed disk drive in the free blocks of the remaining disk drives after M disk drive failures. 
 
     
     
       2. The method of  claim 1  further comprising:
 detecting M disk drive failures; 
 generating new user data and redundant data to recover from the M disk failures; 
 moving the new data and redundant data into the hot spare space; and 
 rearranging all of the data and redundant blocks of the D−M disk drives to rebuild the array with fewer disks and an identical level of redundancy. 
 
     
     
       3. A method of  claim 1  further comprising:
 generating new user data and redundant to recover from a single failed disk drive; 
 moving the new data and redundant data into a part of the hot spare space; and 
 rearranging all of the data and redundant blocks of the remaining disk drives to rebuild the array with fewer disks and an identical level of redundancy so that remaining hot spare space which can accommodate M−1 additional disk drive failures. 
 
     
     
       4. A method of  claim 1  further comprising:
 generating new data and redundant data for concurrent disk drive failures of more than one disk drive; 
 moving the new data and redundant data into a part of the hot spare space; and 
 rearranging all of the data and redundant blocks of the remaining disk drives to rebuild the array with fewer disks and an identical level of redundancy. 
 
     
     
       5. The method of  claim 1  wherein the redundant data are mirror blocks. 
     
     
       6. The method of  claim 1  wherein the redundant data are parity blocks. 
     
     
       7. The method of  claim 1  wherein all disk drives except failed disk drives are actively used while recovering from the M disk drive failures. 
     
     
       8. The method of  claim 2  wherein the generating uses an exclusive OR operation. 
     
     
       9. A redundant array of independent disks with hot spare space, comprising:
 D disk drives of B physical blocks each; 
 N user data and redundant data blocks allocated to each of the D disk drives; 
 F free blocks allocated as hot spare space to each of the D disk drive, where N+F<=B, and ((D−M)×F)>=N; and 
 means for rebuilding the data and redundant blocks of a failed disk drive in the free blocks of the remaining disk drives after M disk drive failures.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.