Method and apparatus for improving performance in a reduntant array of independent disks

• US 5,657,468 A
• Filed: 08/17/1995
• Issued: 08/12/1997
• Est. Priority Date: 08/17/1995
• Status: Expired due to Term

• Current Assignee: Xenogenic Development Limited Liability Company (Intellectual Ventures LLC)
• Original Assignee: Ambler Technologies Incorporated
• Inventors: Stallmo, David C., Hall, Randy K.
• Primary Examiner(s): Asta, Frank J.
• Application Number:
  US08/516,293
• Time in Patent Office: 726 Days
• Field of Search: 395/439, 395/441, 395/497.01, 395/497.02, 371/41
• US Class Current: 711/114
• CPC Class Codes: G06F 11/1096 Parity calculation or recalculation after configuration or reconfiguration of the system
• CPC Class Codes: G06F 11/2087 with a common controller
• CPC Class Codes: G06F 2003/0697 device management, e.g. handlers, drivers, I/O schedulers
• CPC Class Codes: G06F 3/0601 Interfaces specially adapted for storage systems

Abstract

A RAID disk array that is adaptable to host I/O traffic, wherein the RAID configuration is hidden from the host computer. The system dynamically determines the RAID configuration used to store host data to maximize response time performance and minimize the loss of disk space used for data protection. To maximize response time and avoid a write penalty, small write operations are mapped into RAID 1 configurations, and medium and large write operations are mapped into RAID 3 configurations. These segments are migrated into RAID 5 configurations as a background operation, to minimize the disk space lost. The system hides configuration changes necessary for the addition and/or deletion of disks to the disk array. While these changes are in progress, the disk array remains on-line and all host data is available for access and modification.

Claims

1. In an array of storage devices accessible from a host computer system, wherein data stored by said host computer system on each one of said storage devices is distributed by said array across all storage devices in said array, a method of organizing storage devices within said array, said method comprising the steps of:

(a) organizing data blocks on said storage devices into at least one block group and a block pool, wherein each of said storage devices contains at least part of said block group and at least part of said block pool;

(b) when data is written to said array, allocating blocks from said block pool to form a group of allocated blocks to store said data;

(c) when data is not being written to said array, placing data from said allocated blocks into said at least one block group.

2. The method of claim 1 wherein step (c) comprises the step of copying said data to said at least one block group.

3. The method of claim 1 wherein step (c) comprises the step of exchanging blocks from said at least one block group with said allocated blocks.

4. The method of claim 1 wherein a size of each of said at least one block group is dynamically changable by a user of said method.

5. The method of claim 1 wherein a protection status of each of said at least one block group is dynamically changable by a user of said method.

6. The method of claim 1 wherein data stored in said at least one block group is stored in a first configuration and data stored in said allocated blocks is stored in a second configuration.

7. The method of claim 6 wherein said first configuration and said second configuration are selected by said array.

8. The method of claim 1 wherein step (b) further comprises the steps of:

(b1) when said data being written is not located sequentially after data previously written, allocating more blocks than necessary to contain said data being written; and

(b1) when said data being written is located sequentially after data previously written, writing said data into allocated blocks containing said previously written data.

9. The method of claim 1 wherein step (b) further comprises the steps of:

(b1) when said data being written is no larger than an amount of data that can be stored on a single disk within said array, allocating an amount of said blocks sufficient to allow said data to be written twice, wherein said data is duplicated within said allocated blocks.

10. The method of claim 1 wherein step (b) further comprises the steps of:

(b1) when said data being written is an amount of data that requires writing to all disks of said array, writing said data in said at least one block group, wherein no blocks are allocated from said block pool.

11. In an array of storage devices accessible from a host computer system, wherein data stored by said host computer system on each one of said storage devices is distributed by said array across all storage devices in said array, a method of organizing storage devices within said array, said method comprising the steps of:

(a) organizing data blocks on said storage devices into at least one block group and a block pool, wherein each of said storage devices contains at least part of said block group and at Least part of said block pool;

(b) when data is written to said array and said data is an amount of data that requires writing to all disks of said array, writing said data in said at least one block group;

(c) when data is written to said array and said data is no larger than an amount of data that can be stored on a single disk within said array, allocating an amount of blocks from said block pool to form a group of allocated blocks, wherein said amount of blocks is sufficient to allow said data to be written twice, wherein said data is duplicated within said allocated blocks;

(d) when data is written to said array and said data is an amount of data that requires writing to more than one disk of said array, but does not require writing to all disks of said array, allocating blocks from said block pool to form a group of allocated blocks to store said data;

(e) when data is not being written to said array, placing data from said allocated blocks into said at least one block group.

12. The method of claim 11 wherein step (e) comprises the step of copying said data to said at least one block group.

13. The method of claim 11 wherein step (e) comprises the step of exchanging blocks from said at least one block group with said allocated blocks.

14. The method of claim 11 wherein a size of each of said at least one block group is dynamically changeable by a user of said method.

15. The method of claim 11 wherein a protection status of each of said at least one block group is dynamically changeable by a user of said method.

16. The method of claim 11 wherein data stored in said at least one block group is stored in a first configuration and data stored in said allocated blocks is stored in a second configuration.

17. The method of claim 16 wherein said first configuration and said second configuration are selected by said array.

18. The method of claim 11 wherein step (c) further comprises the steps of:

(c1) when said data being written is not located sequentially after data previously written, allocating more blocks than necessary to contain said data being written; and

(c1) when said data being written is located sequentially after data previously written, writing said data into allocated blocks containing said previously written data.