Data and parity prefetching for redundant arrays of disk drives

• US 5,309,451 A
• Filed: 08/12/1992
• Issued: 05/03/1994
• Est. Priority Date: 08/12/1992
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Arnott, Randy M., Noya, Eric S., Rosich, Mitchell N.
• Primary Examiner(s): Canney, Vincent P.
• Application Number:
  US07/929,080
• Time in Patent Office: 629 Days
• Field of Search: 371/40.4, 371/10.1, 371/10.2, 371/40.1, 395/575, 395/425
• US Class Current: 714/766
• CPC Class Codes: G06F 11/1012 using codes or arrangements adapted for a specific type of error G06F11/1048 takes precedence
• CPC Class Codes: G06F 12/0862 with prefetch
• CPC Class Codes: G06F 12/0866 for peripheral storage systems, e.g. disk cache
• CPC Class Codes: G06F 2212/311 In host system

Abstract

A method for prefetching the data and parity blocks for generating parity data of a stripe. The method uses a low and high thresholds marker indicative of a first and second level of fullness of the cache to determine whether or not to prefetch the data and parity blocks. If the cache is filled to a level exceeding the first level of fullness, the data and parity blocks are prefetched for any blocks to be written to the disk drive between the low and high threshold. The data and parity blocks are read from the disk drive at a lower processing priority in anticipation of the writing of the block.

Claims

1. An apparatus for prefetching data from a plurality of disk drives, each of the plurality of disk drives organized into a plurality of disk blocks, the plurality of disk blocks further organized into a plurality of stripes, each of the plurality of stripes including at least one disk block from each of the plurality of disk drives, each of the plurality of stripes further including a parity disk block storing parity data generated from the data stored in the other disk blocks of the stripe, the apparatus comprising:

memory means for storing data, said memory means partitioned into memory blocks compatible with the disk block organization of the plurality of disk drives;

means for maintaining said memory blocks in a least recently used (LRU) order;

means for generating a low threshold signal in response to a first predetermined number of said memory blocks being filled with data; and

means, responsive to said low threshold signal, for starting a prefetch procedure to read disk blocks associated with a predetermined stripe, said predetermined stripe including at least one disk block to be overwritten by a LRU memory block.

2. The apparatus as in claim 1 wherein said disk blocks associated with said predetermined stripe include the parity disk block of said predetermined stripe and said at least one disk block to be overwritten by said LRU memory block.

3. The apparatus as in claim 1 further including means for marking said LRU memory block as being prefetched.

4. The apparatus as in claim 1 further including means for generating a high threshold signal in response to a second predetermined number of said memory blocks being filled with data, said second number being greater than said first number;

and

means for generating parity data from said LRU memory block, said at least one disk block to be overwritten, and the parity disk block; and

means for storing said parity data in a parity memory block; and

means for writing said LRU memory block and said parity memory block to said plurality of disk drives.

5. The apparatus as in claim 1 further including means for reading disk blocks associated with a second predetermined stripe, said second predetermined stripe including at least one disk block to be overwritten by a next LRU memory block.

6. A method for prefetching data from a plurality of disk drives, each of the plurality of disk drives organized into a plurality of disk blocks, the plurality of disk blocks further organized into a plurality of stripes, each of the plurality of stripes including at least one disk block from each of the plurality of disk drives, each of the plurality of stripes further including a parity disk block storing parity data generated from the data stored in the other disk blocks of the stripe, the method comprising the steps of;

storing data in a memory means, said memory means partitioned into memory blocks compatible with the disk block organization of the plurality of disk drives;

maintaining said memory blocks in a least recently used (LRU) order;

generating a low threshold signal in response to a first predetermined number of said memory blocks being filled with data; and

starting, in response to said low threshold signal, a prefetch procedure to read disk blocks associated with a predetermined stripe, said predetermined stripe including at least one disk block to be overwritten by a LRU memory block.

7. The method as in claim 6 further including the steps of reading the parity disk block of said predetermined stripe, and reading said at least one disk block to be overwritten by said LRU memory block.

8. The method as in claim 6 further including the step of marking said LRU memory block as being prefetched.

9. The method as in claim 6 further including the step of generating a high threshold signal in response to a second predetermined number of said memory blocks being filled with data, said second number being greater than said first number;

and

generating parity data from said LRU memory block, said at least one disk block to be overwritten, and the parity disk block; and

storing said parity data in a parity memory block; and

writing said LRU memory block and said parity memory block to said plurality of disk drives.

10. The apparatus as in claim 6 further including reading disk blocks associated with a second predetermined stripe, said second predetermined stripe including at least one disk block to be overwritten by a next LRU memory block.