Enhanced data management in data storage subsystems

Abstract: The present system may be utilized to minimize access performance penalties in memory subsystems which utilize redundant arrays of disk memory devices. Redundant arrays of disk memory devices provide levels of reliability which are not available with single storage devices; however, the redundancy carries with it an access performance degradation due to the requirement that such systems write data segments and parity elements to the array each time an application updates data within the system. A large nonvolatile cache is therefore provided in association with a redundant array of disk memory devices. Each time a data segment is written or read the data segment is staged from the array to the nonvolatile cache, if the data segment is not already within the cache. Additionally, if the operation is an update, a parity element associated with the data segment to be updated is also staged to the cache with the existing data segment content. An updated parity element is then calculated based upon the updated data, the existing data and the existing parity element. Data segments and associated parity elements are then maintained in the cache for future reading and updates until the number of updated data segments within the cache exceeds a predetermined value. Thereafter, selected data segments and associated parity elements are destaged from the cache to the array based upon a "Least Recently Utilized" (LRU) or "minimum seek" algorithm.

Description: The present invention relates in general to an improved data storage subsystem and in particular to an improved data storage subsystem for use with a data processing system. Modern computer systems often use a plurality of storage devices or memories in order to store data associated with that computer. Many such storage devices are categorized as so-called "direct access storage devices" (DASD) in that the access plan for data within such a device is effectively independent of the location of the data. One example of such a storage device is a magnetic disk drive memory. As over all system processing speeds within modern computer systems increase, magnetic disk storage technology access times have lagged. As a consequence, several techniques have been proposed for increasing the data throughput for storage systems associated with computer systems. One such technique is the provision of a redundant array of disk memory devices. Such arrays are increasingly utilized as a result of the decreases in size and cost per megabyte for data storage within disk memory devices. One technique for providing a redundant array of disk memory devices is the so-called "Redundant Array of Inexpensive Disks" (RAID) wherein a tightly coupled plurality of disk storage devices are arranged into an array to provide greater data throughput. These disk arrays provide a high data reliability and availability. That is, the expected time to data loss is quite long and the time spent repairing systems and recovering lost data is a small fraction of total time. However, as is well documented in the available literature on RAID systems, the notion of redundancy can carry with it a necessary acceptance of a performance degradation as a price to be paid for significantly higher levels of availability. This performance degradation occurs as a result of the need to read parity and write both data and parity whenever an application updates data. Consequently, numerous systems for organizing data and parity within arrays of disk memory devices have been proposed in an effort to increase the access performance for such systems. However, such increased performance typically occurs in response to a substantial increase in the cost of the system, as a result of the necessary provision of mirrored disk drives or the like. EP-A-0 462 917 describes a data storage system in which a cache is provided to store data read from the disk drives before transferring to the host system. It should therefore be apparent that a need exists for a method and system for enhanced data management within a data storage subsystem which utilizes redundant arrays of disk memory devices wherein access performance degradation associated with such arrays may be minimized. Accordingly, the present invention provides a data storage subsystem comprising: a nonvolatile cache; a redundant array of disk memory devices for storing a plurality of data segments and associated parity elements; and a control circuit for staging an image of a selected data segment and an associated parity element from said redundant array of disk memory devices into said nonvolatile cache in response to an attempted update thereto; updating said selected data segment and said associated parity element; writing said updated selected data segment and said updated associated parity element into said nonvolatile cache; and destaging a data segment and an associated parity element from said nonvolatile cache to said redundant array of disk memory devices only in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number wherein access performance degradation associated with redundant arrays of disk storage devices is minimized. In a second aspect of the present invention there is provided a method for enhanced data management in a data storage subsystem which includes a nonvolatile cache and a redundant array of disk memory devices for storing a plurality of data segments and associated parity elements, said method comprising the steps of: determining if a selected data segment and an associated parity element are present within said nonvolatile cache in response to an attempted update to said selected data segment; staging said selected data segment and an associated parity element into said nonvolatile cache from said redundant array of disk memory devices in response to a determination that said selected data segment and an associated parity element are not present within said nonvolatile cache; updating both said selected data segment and said associated parity element; writing said updated selected data segment and said updated associated parity element into said nonvolatile cache; and destaging a data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices only in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number wherein access performance degradation associated with redundant arrays of disk memory devices is minimized. The method and system of the present invention may be utilized to minimize access performance penalties in memory subsystems which utilize redundant arrays of disk memory devices. Redundant arrays of disk memory devices provide levels of reliability which are not available with single storage devices; however, the redundancy carries with it an access performance degradation due to the requirement that such systems write data segments and parity elements to the array each time an application updates data within the system. A large nonvolatile cache is therefore provided in association with a redundant array of disk memory devices. Each time a data segment is written or read the data segment is staged from the array to the nonvolatile cache, if the data segment is not already within the cache. Additionally, if the operation is an update, a parity element associated with the data segment to be updated is also staged to the cache with the existing data segment content. An updated parity element is then calculated based upon the updated data, the existing data and the existing parity element. Data segments and associated parity elements are then maintained in the cache for future reading and updates until the number of updated data segments within the cache exceeds a predetermined value. By utilizing nonvolatile cache the likelihood of data loss due to power failures or the like can be effectively eliminated. Thereafter, selected data segments and associated parity elements are destaged from the cache to the array based upon a "Least Recently Utilized" (LRU) algorithm, or a "Minimum Seek" algorithm. A battery backup power supply may also be provided to permit all data segments and parity elements within the cache to be destroyed to the array in the even of power loss. The invention will now be further described, by way of an illustrative embodiment, with reference to the accompanying figures in which: Figure 1 is a partially schematic pictorial representation of a data processing system which may be utilized to implement the method and system of the present invention; Figure 2 is a high level block diagram of the storage subsystem of the data processing system of Figure 1 , which may be utilized to implement the method and system of the present invention; Figure 3 is a high level logic flowchart which illustrates the method and system of the present invention with respect to data reads within the storage subsystem; and Figure 4 is a high level logic flowchart which illustrates the method and system of the present invention with respect to updates to data within the memory storage subsystem. With reference now to the figures and in particular with reference to Figure 1, there is depicted a partially schematic pictorial representation of a data processing system which may be utilized to implement the method and system of the present invention. As illustrated, the data processing system includes a host processor 10 which may be implemented utilizing any suitable computer such as, for example, the International Business Machines AS/400 computer. Additionally, a storage subsystem 12 is shown coupled to host processor 10. As is common in such storage subsystems a controller 14 and one or more direct access storage devices 16 are also illustrated within storage subsystem 12. Thus, in manner which should be apparent to those having ordinary skill in the art, data utilized by host processor 10 may be stored and retrieved from one or more direct access storage devices within storage subsystem 12. Referring now to Figure 2, there is depicted a high level block diagram of the storage subsystem of the data processing system of Figure 1, which may be utilized to implement the method and system of the present invention. As illustrated, storage subsystem 12 includes multiple direct access storage devices 16. In the depicted embodiment of the present invention, direct access storage devices 16 comprise four separate so-called "head/disk assemblies" 20 which may be utilized to implement a redundant array of disk memory devices in a manner known within the art as "RAID." In the depicted embodiment of the present invention, each disk memory device provided within direct access storage device 16 is utilized to store a plurality of data segments and a parity element associated with each group of data segments is also periodically stored at various locations throughout the array of disk memory devices in a manner known in the art as "striping." Thus, it should be apparent that each data segment stored within direct access storage devices 16 utilizing head/disk assemblies 20 must be read in conjunction with an associated parity element and each of those associated parity elements must be updated each time a data segment associated with a parity element has been updated. Calculation of appropriate parity elements for a group of data segments is accomplished utilizing parity generation circuitry 24. While depicted as a separate element within storage subsystem 12, those skilled in the art will appreciate that parity generation circuitry 24 may comprise a software routine implemented within control circuitry 22. Parity generation circuitry 24 preferably calculates a parity element value for a group of data segments. This is typically accomplished by exclusive ORing a group of data segments together to form a parity element. Thus, a parity element for data segments D 1 , D 2 , and D 3 will be expressed mathematically as: P 1 = D 1 ⊕ D 2 ⊕ D 3 It should therefore be apparent that updates to any data segment within the group of data segments represented by a parity element will result in the necessity of updating the associated parity element. Of course, it is not necessary to utilize each data segment within a group of data segments which is associated with a parity element in order to update that parity element, as the updated parity element which is associated with a group of data segments may be expressed as: P updated = P 1 ⊕ D existing ⊕ D updated In accordance with an important feature of the present invention, a nonvolatile cache 18 is provided within storage subsystem 12. Nonvolatile cache 18 comprises a large store of nonvolatile memory which, for a storage subsystem capable of storing multiple gigabytes of data, should preferably comprise an addressable address space which includes at least thirty-two million bytes of data. In accordance with the method and system of the present invention, in a manner which will be explained in greater detail herein, control circuitry 22 may be utilized in conjunction with nonvolatile cache 18 to stage data and parity elements from direct access storage devices 16 into nonvolatile cache 18 in response to an attempted read or updating of those data segments. In the manner which will be illustrated below, parity generation circuitry 24 may be utilized to determine the updated parity for a group of data segments in response to an update to any data segment within that group and the updated parity may then be maintained within nonvolatile cache 18, greatly enhancing the access efficiency for storage subsystem 12. With reference now to Figure 3, there is depicted a high level logic flowchart which illustrates the method and system of the present invention with respect to data reads within the storage subsystem of Figure 2 . As depicted, this process begins at block 30 and thereafter passes to block 32. Block 32 illustrates a determination of whether or not data is to be read from direct access storage devices 16. If not, this process merely iterates until such time as a read operation occurs. Still referring to block 32, in the event a read operation has been initiated the process passes to block 34. Block 34 illustrates a determination of whether or not the target data is within nonvolatile cache 18. If not, the process passes to block 36 which illustrates the staging of the target data to nonvolatile cache 18. Thereafter, or after determining that the target data is within nonvolatile cache 18, the process passes to block 38. Block 28 illustrates the reading of the target data. Next, the process passes to block 40 which depicts a determination of whether or not the cache data limit has been exceeded by the possible addition of target data to the cache. If the cache data limit has not been exceeded, the process merely returns to block 32 in an iterative fashion to await the next read operation for data within direct access storage devices 16. Alternately, in the event the cache data limit has been exceeded, as determined in block 40, the process passes to block 42. Block 42 illustrates the destaging of the "Least Recently Utilized" (LRU) or "Minimum Seek" data segment from nonvolatile cache 18 to the array of disk memory devices within direct access storage devices 16. Those having ordinary skill in the art will appreciate that the "Least Recently Utilized" (LRU) algorithm is a well known technique for updating and maintaining cache contents within the data processing system art. The "Minimum Seek" algorithm involves destaging the data within the cache which requires the shortest "seek" time to arrive at the appropriate storage location to the array of disk storage devices. Finally, referring to Figure 4, there is depicted a high level logic flowchart which illustrates the method and system of the present invention with respect to updates to data within a memory storage subsystem. As depicted, this process begins at block 50 and thereafter passes to block 52. Block 52 illustrates a determination of whether or not an update has occurred which will result in the writing of data to direct access storage devices 16. If not, this process merely iterates until such time as such an update occurs. Still referring to block 52, in the event an update occurs which will result in a writing of data to direct access storage devices 16, the process passes to block 54. Block 54 illustrates a determination of whether or not the target data segment is present within nonvolatile cache 18 and if not, the process passes to block 56. Block 56 depicts the staging of the target data segment to nonvolatile cache 18. Thereafter, or after determining that the target data segment was present within nonvolatile cache 18, the process passes to block 58. Block 58 illustrates the writing of the updated data value into nonvolatile cache 18. Next, in accordance with an important feature of the present invention, the process passes to block 60. Block 60 illustrates a determination of whether or not the target data segment associated parity element is present within nonvolatile cache 18. If not, the process passes to block 62 which illustrates the staging of the target data segment associated parity element to nonvolatile cache 18. Thereafter, or after determining that the target data segment associated parity element is present within nonvolatile cache 18, block 64 illustrate the calculation of an updated parity element for the target data segment and the writing of that updated parity element to nonvolatile cache 18. In this manner, as those skilled in the art will appreciate upon reference to this specification, an image of an updated track or segment of data may be efficiently maintained within nonvolatile cache by virtue of the fact that the associated parity element for each group of data therein can be maintained within the cache without requiring an access to the disk memory devices within direct access storage device 16, greatly enhancing the efficiency of the storage subsystem. Next, the process passes to block 66. Block 66 illustrates a determination of whether or not the cache updated data segment limit has been exceeded. That is, is the number of updated memory segments within nonvolatile cache 18 greater than a selected number which limits the amount of free space within nonvolatile cache 18. If not, the process merely returns to block 52 in an iterative fashion to await a subsequent update to a data segment within direct access storage devices 16. Alternately, if the number of updated memory segments within nonvolatile cache 18 has exceeded the predetermined number, the process passes to block 68. Block 68 illustrates the destaging of the "Least Recently Utilized" (LRU) or "Minimum Seek" data and its associated parity element to the array of disk memory devices within direct access storage devices 16. As described herein a nonvolatile cache is utilized to prevent data loss in the event of power failure. Additionally, a battery backup system may be utilized to provide power for destaging data from the cache to the array in the event of power loss, providing an ordered shut down procedure. Upon reference to the foregoing those skilled in the art will appreciate that by the addition of nonvolatile caching to the management process of a redundant array of disk memory devices, the access performance penalty normally associated with such arrays may be minimized. This is not strictly a result of the expected performance enhancement which accompanies caching in non-array memory systems, but results in an increased performance capability as a result of the ability of the system to manage cache images and parity elements for that data within a nonvolatile cache, without requiring access to the storage media to update the parity element. This technique permits subsequent updates to a group of data segments to proceed without access to the storage media within the disk memory devices and thus facilitates destaging of groups of memory segments on a least recently utilized basis while simplifying the task of maintaining data consistency across the storage array. While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined in the claims appended hereto.

Claims: A method for enhanced data management in a data storage subsystem which includes a nonvolatile cache (18) and a redundant array of disk memory devices (16) for storing a plurality of data segments and associated parity elements, said method comprising the steps of: determining if a selected data segment and an associated parity element are present within said nonvolatile cache in response to an attempted update to said selected data segment; staging said selected data segment and an associated parity element into said nonvolatile cache from said redundant array of disk memory devices in response to a determination that said selected data segment and an associated parity element are not present within said nonvolatile cache; updating both said selected data segment and said associated parity element; characterized by the steps of: writing said updated selected data segment and said updated associated parity element into said nonvolatile cache; and destaging a data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices only in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number wherein access performance degradation associated with redundant arrays of disk memory devices is minimized. The method according to Claim 1, further including the step of determining if a particular data segment is present within said nonvolatile cache in response to an attempted read of said particular data segment. The method according to Claim 2, further including the step of staging said particular data segment without a parity element into said nonvolatile cache from said redundant array of disk memory devices in response to a determination that said particular data segment is not present within said nonvolatile cache. The method according to any preceding claim, wherein said step of updating both said selected data segment and said associated parity element within said nonvolatile cache comprises the step of updating said selected data segment and calculating a new parity element for association with said updated selected data segment. The method according to Claim 4, wherein said step of calculating a new parity element for association with said updated selected data segment comprises the step of exclusive ORing said associated parity element, said selected data segment and said updated selected data segment. The method according to any preceding claim, wherein said step of destaging a data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number comprises the step of destaging a least recently utilized (LRU) data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number. The method according to Claim 1, wherein said step of destaging a data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number comprises the step of destaging a minimum seek data segment and an associated parity element from said nonvolatile cache into said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number. A data storage subsystem comprising: a nonvolatile cache (18); a redundant array of disk memory devices (16) for storing a plurality of data segments and associated parity elements; and a control circuit (22, 24) for staging an image of a selected data segment and an associated parity element from said redundant array of disk memory devices into said nonvolatile cache in response to an attempted update thereto; updating said selected data segment and said associated parity element; characterized by writing said updated selected data segment and said updated associated parity element into said nonvolatile cache; and destaging a data segment and an associated parity element from said nonvolatile cache to said redundant array of disk memory devices only in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number wherein access performance degradation associated with redundant arrays of disk storage devices is minimized. A subsystem according to Claim 8, wherein said control circuit further includes means for staging an image of a particular data segment without an associated parity element from said redundant array of disk memory devices into said nonvolatile cache in response to an attempted read of said particular data segment. A subsystem according to Claim 8 or Claim 9, wherein said control circuit further includes means for calculating an updated parity element for association with an updated selected data segment by exclusive ORing said associated parity element, said selected data segment and said updated selected data segment. A subsystem according to any of Claims 8 to 10, further including destaging means for destaging a data segment and an associated parity element from said nonvolatile cache to said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number. A subsystem according to Claim 11, wherein said destaging means comprises means for destaging a least recently utilized (LRU) data segment and an associated parity element from said nonvolatile cache to said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number. A subsystem according to Claim 11, wherein said destaging means comprises means for destaging a minimum seek data segment and an associated parity element from said nonvolatile cache to said redundant array of disk memory devices in response to a number of updated data segments within said nonvolatile cache exceeding a predetermined number. A data processing system for permitting enhanced data management, said data processing system comprising: a host processor (10); and a data storage subsystem (12) as claimed in any of Claims 8 to 13.

Inventors: CHEN JAMES C, GLIDER JOSEPH S, SHIPMAN LLOYD R, STAMNESS JESSE I, CHEN, JAMES C., GLIDER, JOSEPH S., SHIPMAN, LLOYD R., STAMNESS, JESSE I.
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1995
Main classification: G06F11
IPC codes: G06F11, G06F3, G06F12