EP0986000B1 - Speicherplattenteilsystem - Google Patents

Speicherplattenteilsystem Download PDF

Info

Publication number
EP0986000B1
EP0986000B1 EP96931271A EP96931271A EP0986000B1 EP 0986000 B1 EP0986000 B1 EP 0986000B1 EP 96931271 A EP96931271 A EP 96931271A EP 96931271 A EP96931271 A EP 96931271A EP 0986000 B1 EP0986000 B1 EP 0986000B1
Authority
EP
European Patent Office
Prior art keywords
data
parity
storage area
subsystem
disk array
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP96931271A
Other languages
English (en)
French (fr)
Other versions
EP0986000A4 (de
EP0986000A1 (de
Inventor
Tsunetaka Komachiya
Yoshihisa Kamo
Akira Yamamoto
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Publication of EP0986000A1 publication Critical patent/EP0986000A1/de
Publication of EP0986000A4 publication Critical patent/EP0986000A4/de
Application granted granted Critical
Publication of EP0986000B1 publication Critical patent/EP0986000B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2211/00—Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
    • G06F2211/10—Indexing scheme relating to G06F11/10
    • G06F2211/1002—Indexing scheme relating to G06F11/1076
    • G06F2211/1004—Adaptive RAID, i.e. RAID system adapts to changing circumstances, e.g. RAID1 becomes RAID5 as disks fill up
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2211/00—Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
    • G06F2211/10—Indexing scheme relating to G06F11/10
    • G06F2211/1002—Indexing scheme relating to G06F11/1076
    • G06F2211/1059—Parity-single bit-RAID5, i.e. RAID 5 implementations

Definitions

  • the present invention relates to a storage subsystem, and more particularly to a disk array subsystem for redundantizing and storing data.
  • One is a mirror method for duplexing data.
  • the other is a parity method in which parity data are generated from data.
  • Redundancy methods for data stored in a disk array subsystem are illustrated in detail in literature: A Case for Redundant Arrays of Inexpensive Disks (RAID), David A. Patterson, Garth Gibson, and Randy H. Katz, 1988 ACM 0-89791-268-3/88/0006/0109.
  • redundantizing data by a mirror-based redundancy process the data is duplexed by storing the same data in two different drives within the disk array subsystem.
  • parity data generated from the data are stored in a drive different from a drive in which the original data are stored (the parity data uses a smaller capacity than the original data).
  • the mirror method provides better performance and availability, but is less capacity-efficient and more expensive than the parity method.
  • the parity method is less expensive, but is more disadvantageous in terms of performance and availability than the mirror method.
  • JP-A-7-84732 discloses a subsystem where both mirror-based redundantized data and parity-based redundantized data are present. JP-A-7-84732 also discloses techniques by which the subsystem can dynamically change the redundancy methods from mirror to parity and vice versa for its data. The redundancy method changing techniques allow users to store data in the subsystem with the best redundancy method selected in terms of trade-offs between cost, performance and availability.
  • Fig. 9 shows a process by which the disk array subsystem changes the redundancy method from mirror to parity.
  • a disk array controller 102 (hereinafter referred to as "DKC”) transfers data from a mirror-based data storing area 207 to a parity-based data storing area 208.
  • DKC disk array controller 102
  • transfer of data blocks 0, 1 and 2 requires that a single time of reading and four times of writing be effected with respect to magnetic disk drives (hereinafter referred to as the "drive(s)”) including the generation and writing of parity data.
  • the data transfer occupies five drives 201, 203, 204, 205 and 206.
  • the performance of the disk array subsystem is significantly impaired.
  • data stored by the parity method is first read and the read data is thereafter duplexed for mirror-based redundantizing and then is written. As a result, the performance of the subsystem is similarly impaired.
  • EP-A-0 726 514 discloses a disk array subsystem with the feauture included in the preamble of claim 1. In the known system, moving data between RAIDs is done by copying data from one area into another area.
  • the object of the present invention as defined in claim 1 is to allow a disk array subsystem capable of changing the redundantizing method to reduce its loads caused by data transfer occurring when the redundancy method is changed.
  • a disk array subsystem has a plurality of drives for storing blocks of data supplied from a host apparatus, and a disk array controller for setting a plurality of storage areas each extending over the plurality of drives and for controlling the plurality of drives, and when the subsystem duplexes the blocks of data to record them in two of the storage areas, at least one of the two storage areas has data areas for storing the blocks of data included in the plurality of drives and a parity storing area for storing parity data prepared from the blocks of data included in at least one drive.
  • the disk array subsystem according to the present invention is such that when the subsystem stores data redundantized by duplexing, an area for storing parity data (hereinafter referred to as "parity storing area(s)") prepared from the data to be stored is secured in at least one of the storage areas. No parity data have to be actually generated and stored in the parity storing areas as long as the data are duplexed.
  • parity storing area(s) an area for storing parity data
  • the disk array subsystem reads one group of duplexed data, generates parity data from the read data and stores the generated parity data in the secured parity storing areas. Thereafter, of the storage areas in which the duplexed data are stored, the subsystem deletes the storage area storing no parity data.
  • the other storage area can be treated as a storage area having parity-based redundantized data by writing parity data therein.
  • the redundancy method can be changed from mirror to parity only by reading data, generating parity data and writing the generated parity data.
  • the present invention can dispense with the conventionally required steps of reading one group of duplexed data, generating parity data from the read data and writing both the read data and the generated parity data.
  • the disk array subsystem of the present invention copies data stored in one storage area that has both data areas for storing the data and parity storing areas for storing parity data generated from the data into the other storage area to thereby duplex the data both in the source storage area and in the copied-data storage area.
  • the conventional disk array subsystem first read parity-based redundantized data and thereafter duplexed the read data, and thus the duplexed data had to be written in two places.
  • a storage area having both data and parity data generated from such data is used as one of the duplexed storage areas. Therefore, there is no need to write the data in the two storage areas for duplexing. That is, the present invention can change the redundancy method only by writing the data in one storage area.
  • Fig. 2 shows a configuration of a disk array controller according to the present invention.
  • an SVP (service processor) 100 a host processor interface 902, a disk drive interface 903 and a semiconductor memory 900 are connected to a common bus 905.
  • the host processor interface 902 is connected to a host processor 101, and the disk drive interface 903 to disk drives 911 to 914.
  • the host processor interface 902 which is controlled by a control processor A901, controls data transfer between the host processor 101 and the semiconductor memory 900.
  • the host processor interface 902 transfers data stored on the semiconductor memory 900 to the host processor 101 at a read request made by the host processor. Further, if the semiconductor memory 900 does not have the data for which the read request has been made by the host processor, then the host processor interface 902 instructs the disk drive interface 903 to transfer the data in the disk drives 911 to 914 to the semiconductor memory.
  • the host processor interface 902 stores the data transferred from the host processor 101 on the semiconductor memory 900 at a write request made by the host processor 101, and informs the disk drive interface 903 that the data has been updated.
  • the disk drive interface 903 which is controlled by a control processor B904, controls data transfer between the disk drives 911 to 914 and the semiconductor memory 900.
  • the disk drive interface generates parity data from the data in the semiconductor memory as necessary, and stores the generated parity data in the semiconductor memory 900.
  • the disk drive interface 903 transfers the parity data in the semiconductor memory to the disk drives 911 to 914 as necessary.
  • a maintenance person causes the SVP to check the internal states of the host processor interface 902, the disk drive interface 903 and the semiconductor memory 900 through the common bus 905, and can therefore instruct the control processors A and B904 to, e.g., recover their faults and change their configuration.
  • Fig. 1 shows a disk array subsystem according to a first embodiment of the present invention.
  • disk array subsystems use magnetic disks as their storage media, but can also use magnetic tapes, semiconductor memories and the like.
  • the disk array subsystem according to the first embodiment uses magnetic disk drives.
  • Magnetic disk drives 103 to 106 are connected to the DKC 102.
  • the DKC 102 is connected to the host processor 101, and controls data transfer between the host processor 101 and the drives 103 to 106.
  • the service processor 100 (SVP) is connected to the DKC 102.
  • a maintenance person performs maintenance work such as failure diagnoses and configuration changes of the DKC 102 and the drives 103 to 106 through the SVP 100.
  • each of the magnetic disk drives 103 to 106 is divided into a mirror data area 107, and a parity data area A108 and a parity data area B109.
  • Data blocks 0 to 17 and parity blocks P3 to P5 in the respective areas are of the same size, and they are contiguous data area within a single drive.
  • the size of each data block or parity block is equal to the volume of a single track of each drive, and a single block corresponds to a single track.
  • Data to be mirror-redundantized in the disk array subsystem are stored in the mirror data area 107 and the parity data area A108 or B109 to be duplexed.
  • the data in the mirror data area 107 are arranged in the same placement as the conventional mirror-redundantized data.
  • Mirror-based data redundancy methods in which the same data is stored in two areas are called "RAID1.”
  • the data within the parity data area A108 or B109 are arranged in the same placement as the conventional parity-based redundantized data.
  • the parity-based data redundancy methods are available as RAID3, RAID4 and RAID5. The method called "RAID5" is used in this embodiment. Note however that if the mirror data area has a copy of the data stored in a parity data area, no parity data to be stored in the parity data area are generated, so that no parity data are written in the parity storing areas.
  • the data blocks 0 to 8 are stored in the mirror data area 107 and the parity data area A108.
  • no parity data are generated in the parity data area A108, and no parity data are therefore written to the parity storing areas 110, 111 and 112.
  • no data are duplexed for the parity data area B109 unlike for the parity data area A108. Therefore, parity data are generated and stored in the parity data area B109 as in the conventional method to make the data redundant.
  • the data in the parity data area A108 have been duplexed, and thus superior to the data in the area B109 in terms of their accessibility, and their availability at the time of a fault.
  • the parity data area B109 is superior to the parity data area A108, and thus the area B109 is superior in terms of cost.
  • the data redundancy method shown in Fig. 1 is particularly advantageous when the data in the parity data area A108 are used frequently or when serious damage can be caused at the time of a data loss.
  • the redundancy method is changed to parity so that the capacity efficiency can be improved.
  • Fig. 3 shows a process by which the DKC 102 changes the redundancy technique to improve the capacity efficiency of the parity data area A108.
  • the DKC 102 reads data from the mirror data area 107, and then generates parity data and writes the generated parity data into parity storing areas of the parity data area A108.
  • the DKC 102 invalidates the mirror data area 107 so that the invalidated area can store other data.
  • Fig. 3 shows an example in which the DKC 102 generates and writes parity data into the drive 103.
  • the DKC 102 reads the data blocks 0, 1 and 2 from the mirror data area 107 of the drive 103.
  • the DKC 102 EXCLUSIVE-ORs the read data to generate the parity block P0.
  • the DKC 102 writes the parity block P0 into the parity storing area within the parity data area A108 of the drive 103.
  • the DKC 102 invalidates the data blocks 0, 1 and 2 within the mirror data area 107 of the drive 103.
  • the DKC 102 repeats the first to fourth steps for the rest of the drives 104, 105 and 106 to write parity data in the parity storing areas of their parity data areas A108, so that all the data blocks within the mirror data area 107 are invalidated.
  • the redundancy method for the data in the parity data area A108 is changed to parity-based redundancy method (RAID5 in this embodiment).
  • Fig. 4 shows data arrangement in the disk array subsystem after the change.
  • the present invention dispenses with such copying operation by transferring one group of the groups of duplexed data to the parity data area.
  • the data blocks 0, 1 and 2 necessary for generating the parity data to be stored in the parity storing area P0 are present in the same drive 103 as the parity storing subarea P0. Therefore, the user uses only a single drive to perform a series of process steps including data reading, and parity data generation and writing.
  • the disk array subsystem according to the present invention requires only a single drive be used and that a single time of reading and a single time of writing be carried out to change the redundancy method from mirror to parity as shown in Fig 3. Therefore, the present invention can reduce the rate of use of the drives during the changing of the data redundancy method and thus prevent impairment of the performance of the disk array subsystem.
  • Fig. 5 shows a process by which the DKC 102 changes the redundancy technique to improve the accessibility and availability of data in the parity data area B109.
  • the DKC 102 reads the data from the parity data area B109, and then copies the data read into the mirror data area 107 for duplexing.
  • the DKC 102 invalidates the parity storing areas in the parity data area B109.
  • Fig. 5 shows an example in which the DKC 102 copies some of the data with respect to the drive 103 for duplexing.
  • the DKC 102 reads the data blocks 9, 10 and 11 from the parity data areas B109 of the drives 104, 105 and 106.
  • the DKC 102 copies the data blocks 9, 10 and 11 into the mirror data area 107 of the drive 103.
  • the DKC 102 invalidates the parity storing area within the parity data area B109 of the drive 103.
  • the DKC 102 repeats the first to third steps for the rest of the drives 104, 105 and 106 so that the data in these drives are copied to the mirror data area 107.
  • the data in the parity data area B109 have been duplexed.
  • Fig. 6 shows data arrangement in the disk array subsystem after the change.
  • the conventional disk array subsystem required, when changing the redundancy method from parity to mirror, that the DKC 102 further copy the data blocks into the mirror data area of another drive after the second step. Unlike such conventional subsystem, the disk array subsystem according to the present invention can dispense with the step of copying the data blocks from one mirror data area to another since the data blocks in the parity data area themselves are used as one group of the duplexed data.
  • the conventional disk array subsystem required that five drives be exclusively used and that three times of reading and two times of writing be made to change the redundancy method from parity to mirror.
  • the disk array subsystem according to the present invention can change the data redundancy means for the data blocks 9, 10 and 11 from parity to mirror by requiring that four drives be used and that three times of reading and a single time of writing be made as shown in Fig. 5.
  • the subsystem according to the present invention can reduce the utilization rate of its drives and thus prevent degradation of its performance when it changes the redundancy method.
  • mirror data area 107, and the parity data areas A108 and B109 are allocated to a same group of drives such as the drives 103 to 106 in this embodiment, each of these areas can be allocated to different groups of drives as well.
  • the size of the data block and the parity block is equal to the capacity of a single track of a drive in this embodiment. It is apparent, however, that similar advantages can be obtained by setting their size equal to a desired capacity such as the capacity of a single cylinder or any capacity smaller than a single track.
  • the redundancy method can be changed when at least one of the following three events is established in this embodiment.
  • Fig. 7 shows a configuration according to a second embodiment of the present invention. Since a disk array subsystem of this embodiment is identical in its basic configuration and operation to the subsystem of the first embodiment 1, the following describes the subsystem of the second embodiment only as distinguished from that of the first embodiment. The subsystem of this embodiment is different from the subsystem of the first embodiment in that each of drives 303 to 306 has a parity block generating function. Fig. 7 shows a process in which data redundancy means for data blocks 0, 1 and 2 are changed from mirror to parity.
  • the DKC 102 instructs the drive 303 to generate a parity block P0 from the data blocks 0, 1 and 2 and write the generated parity block P0 into a predetermined position.
  • the drive 303 In the second step, the drive 303 generates the parity block P0 and writes the generated parity block P0 as instructed by the DKC 102.
  • the drive 303 informs the DKC 102 that the generation and writing of the parity block P0 has been finished.
  • the DKC 102 can control the other drives 304 to 306 or transmit and receive commands to and from the host processor 101.
  • this embodiment reduces the processing overhead of the DKC 102 by allowing each drive to generate and write a parity block only within itself. As a result, this embodiment can improve the performance of the disk array subsystem further than the first embodiment.
  • Fig. 8 shows a configuration according to a third embodiment.
  • a disk array subsystem of this embodiment is identical in its basic configuration and operation to the subsystem of the first embodiment, and the following describes the subsystem of this embodiment only as distinguished from that of the first embodiment. What distinguishes this embodiment from the first embodiment is as follows.
  • this embodiment can reduce read/write time compared with the subsystem of the first embodiment.
  • the DKC 102 informs a host processor 101 that the write operation has finished.
  • the writing of the data blocks into the parity data area 408 is effected synchronously after the write operation has been finished. Therefore, the time required for writing the data blocks into the parity data area 408 is not counted in the write time.
  • the write time includes only the time required for writing the data blocks into the mirror data area 407. Since the mirror data area 407 is provided in the high-speed drives 401, 402 and 403, the write time can be shortened.
  • the disk array subsystems with the redundancy method changing function can reduce the frequency of accesses to magnetic disk drives required to change the redundancy method, compared with the conventional redundancy method changing techniques.
  • the present invention can change the redundancy method from duplexing to parity without involving transfer of data, and this prevents the disk array subsystems from impairing their performance when the subsystems change their redundancy methods.

Claims (10)

  1. Diskarray-Teilsystem, das bei Empfang einer Daten-Schreibanforderung von einem Hostprozessor (101) diese Daten in mehreren Plattengeräten (103-106) speichert, wobei das Teilsystem aufweist:
    eine Diskarray-Steuerung (102), die die Schreibanforderung von dem Hostprozessor (101) über eine Hostprozessor-Schnittstelle (902) empfängt,
    wobei die Diskarray-Steuerung (102) mindestens einen ersten und einen zweiten Speicherbereich definiert, die von den mehreren Plattengeräten (103-106) gebildet werden,
    dadurch gekennzeichnet, daß die Diskarray-Steuerung (102) aufweist:
    eine erste Redundanz-Implementiereinrichtung zur Ausführung einer Paritätsverarbeitung, indem die Daten in Einheiten von Datenblöcken segmentiert, für jeden von mehreren Sätzen einer vorgegebenen Anzahl von Datenblöcken ein Paritätsdatenblock gebildet, aus einer vorgegebenen Anzahl von Datenblöcken unter Hinzufügung des Paritätsdatenblocks eine Paritätsgruppe gebildet und die Daten gespeichert werden, wobei Blöcke, die die Paritätsgruppe bilden, auf die mehreren, den ersten Speicherbereich bildenden Plattengeräte (103-106) verteilt werden, und
    eine zweite Redundanz-Implementiereinrichtung zum Ausführen einer Spiegelverarbeitung an den Daten derart, daß die in der Paritätsgruppe enthaltenen mehreren Datenblöcke kontinuierlich auf eines der den zweiten Speicherbereich bildenden mehreren Plattengeräte (103-106) verteilt, ein entsprechender Speicherbereich zum Speichern von Paritätsdaten auf dem besagten einen Plattengerät (103-106) in dem ersten Speicherbereich sichergestellt und die Datenblöcke ferner auf Datenblöcke des ersten Speicherbereichs verteilt werden, die zur Speicherung von Datenblöcken des ersten Speicherbereichs vorgesehen sind,
    wobei dann, wenn von der zweiten Redundanz-Implementiereinrichtung spiegel-verarbeitete Daten in Daten geändert werden sollen, die von der ersten Redundanz-Implementiereinrichtung verarbeiteten Daten entsprechen, die Diskarray-Steuerung (102) die Datenblöcke aus dem zweiten Speicherbereich in Einheiten der vorgegebenen Anzahl von Datenblöcken ausliest, für jede vorgegebene Anzahl von Datenblöcken einen Paritätsdatenblock erzeugt, diesen in dem sichergestellten Bereich des ersten Speicherbereichs, der zur Speicherung von Paritätsdaten dient, speichert und nach Beendigung des Auslesens von Daten aus dem zweiten Speicherbereich die vorgegebene Anzahl von Datenblöcken aus dem zweiten Speicherbereich löscht.
  2. Teilsystem nach Anspruch 1, wobei Datenblöcke und ein Paritätsdatenblock in den ersten Speicherbereich so eingegeben werden, daß ein Paritätsdatenblock, der aus einer Gruppe von in dem zweiten Speicherbereich kontinuierlich angeordneten Datenblöcken erzeugt wird, in demselben Plattengerät (103-106) gespeichert wird, in dem die Gruppe von Datenblöcken kontinuierlich angeordnet ist.
  3. Teilsystem nach Anspruch 1, wobei beim Ändern von Spiegelredundanz in Paritätsredundanz die Diskarray-Steuerung (102) Paritätsdaten, die aus den Datenblöcken in dem Paritätsdatenblock in dem ersten Speicherbereich erzeugt werden, speichert und den Paritätsdatenblock sowie die Datenblöcke auf mehrere Plattengeräte (103-106) in dem ersten Speicherbereich verteilt, so daß dadurch Paritätsredundanz ausgeführt wird, während Daten in anderen Speicherbereichen, in denen dieselben Daten gespeichert sind, gelöscht werden.
  4. Teilsystem nach Anspruch 1, wobei zur Erzeugung von in dem Paritätsdatenblock in dem ersten Speicherbereich zu speichernden Paritätsdaten diejenigen Datenblöcke verwendet werden, die in demselben Plattengerät (103-106) in anderen Speicherbereichen gespeichert worden sind als dem, in dem der Paritätsdatenblock in dem ersten Speicherbereich vorgesehen ist.
  5. Teilsystem nach Anspruch 1, wobei die Diskarray-Steuerung (102) in dem Paritätsdatenblock in dem ersten Speicherbereich zu speichernde Paritätsdaten aus Daten erzeugt, die in demselben Plattengerät (103-106) in den weiteren Speicherbereichen gespeichert sind, in dem der Paritätsdatenblock in dem ersten Speicherbereich vorgesehen ist.
  6. Teilsystem nach Anspruch 4, wobei das Plattengerät (103-106), das den Paritätsdatenblock in dem ersten Speicherbereich aufweist, in dem Paritätsdatenblock zu speichernde Paritätsdaten aus Daten erzeugt, die in den anderen Speicherbereichen des Plattengerätes (103-106) gespeichert sind.
  7. Teilsystem nach Anspruch 1, wobei die Spiegelredundanz-Verarbeitung RAID1 und die Paritätsredundanz-Verarbeitung RAID5 ist.
  8. Teilsystem nach Anspruch 1, wobei die Diskarray-Steuerung (102) bei Änderung der Redundanzverarbeitung von Spiegel- auf Paritäts-Redundanzverarbeitung Paritätsdaten aus den mehreren Datenblöcken erzeugt, diese in dem Paritätsdatenblock speichert und Daten in anderen Speicherbereichen, in denen dieselben Daten wie in dem ersten Speicherbereich gespeichert sind, löscht.
  9. Teilsystem nach Anspruch 1, wobei die Diskarray-Steuerung (102) die Redundanzverarbeitung aufgrund eines von einem Hostgerät (100) abgegebenen Befehl hin ändert.
  10. Teilsystem nach Anspruch 1, wobei die Diskarray-Steuerung (102) die Redundanzverarbeitung aufgrund einer Änderung in der Zugriffsfrequenz ändert, die von einem an die Diskarray-Steuerung (102) angeschlossenen Hostgerät (100) abgegeben wird.
EP96931271A 1996-09-20 1996-09-20 Speicherplattenteilsystem Expired - Lifetime EP0986000B1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP1996/002718 WO1998012621A1 (fr) 1996-09-20 1996-09-20 Sous-systeme a piles de disques

Publications (3)

Publication Number Publication Date
EP0986000A1 EP0986000A1 (de) 2000-03-15
EP0986000A4 EP0986000A4 (de) 2002-02-20
EP0986000B1 true EP0986000B1 (de) 2006-01-04

Family

ID=14153862

Family Applications (1)

Application Number Title Priority Date Filing Date
EP96931271A Expired - Lifetime EP0986000B1 (de) 1996-09-20 1996-09-20 Speicherplattenteilsystem

Country Status (4)

Country Link
US (1) US6571314B1 (de)
EP (1) EP0986000B1 (de)
DE (1) DE69635713T2 (de)
WO (1) WO1998012621A1 (de)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6742137B1 (en) * 1999-08-17 2004-05-25 Adaptec, Inc. Object oriented fault tolerance
US6820182B1 (en) * 2000-10-18 2004-11-16 International Business Machines Corporation Support for exhaustion recovery in a data processing system with memory mirroring
US6895485B1 (en) * 2000-12-07 2005-05-17 Lsi Logic Corporation Configuring and monitoring data volumes in a consolidated storage array using one storage array to configure the other storage arrays
US20030056058A1 (en) * 2001-09-17 2003-03-20 Alistair Veitch Logical volume data migration
US7246254B2 (en) * 2003-07-16 2007-07-17 International Business Machines Corporation System and method for automatically and dynamically optimizing application data resources to meet business objectives
US7290087B2 (en) * 2003-11-26 2007-10-30 International Business Machines Corporation Adaptive grouping in object raid
US20060161752A1 (en) * 2005-01-18 2006-07-20 Burkey Todd R Method, apparatus and program storage device for providing adaptive, attribute driven, closed-loop storage management configuration and control
US7941602B2 (en) * 2005-02-10 2011-05-10 Xiotech Corporation Method, apparatus and program storage device for providing geographically isolated failover using instant RAID swapping in mirrored virtual disks
US20060218360A1 (en) * 2005-03-22 2006-09-28 Burkey Todd R Method, apparatus and program storage device for providing an optimized read methodology for synchronously mirrored virtual disk pairs
JP4862847B2 (ja) * 2008-03-07 2012-01-25 日本電気株式会社 ディスクアレイのデータ復旧方法、ディスクアレイシステム及び制御プログラム
US7971013B2 (en) * 2008-04-30 2011-06-28 Xiotech Corporation Compensating for write speed differences between mirroring storage devices by striping
US20100011176A1 (en) * 2008-07-11 2010-01-14 Burkey Todd R Performance of binary bulk IO operations on virtual disks by interleaving
US20100011371A1 (en) * 2008-07-11 2010-01-14 Burkey Todd R Performance of unary bulk IO operations on virtual disks by interleaving
WO2010119478A1 (en) * 2009-04-14 2010-10-21 Hitachi, Ltd. Storage system and control method therefor
US8463991B2 (en) * 2010-09-28 2013-06-11 Pure Storage Inc. Intra-device data protection in a raid array
JP6171478B2 (ja) 2013-03-28 2017-08-02 富士通株式会社 ストレージシステム、情報処理装置、情報処理装置の制御プログラム、および情報処理装置の制御方法
US10802749B2 (en) 2016-08-05 2020-10-13 Nutanix, Inc. Implementing hierarchical availability domain aware replication policies
US10698780B2 (en) 2016-08-05 2020-06-30 Nutanix, Inc. Implementing availability domain aware replication policies
US10678457B2 (en) * 2016-11-22 2020-06-09 Nutanix, Inc. Establishing and maintaining data apportioning for availability domain fault tolerance
EP3867759A1 (de) * 2018-10-15 2021-08-25 NetApp, Inc. Verbesserung des verfügbaren speicherplatzes in einem system mit variierenden datenredundanzschemen
CN117112288B (zh) * 2023-10-16 2024-02-09 苏州元脑智能科技有限公司 磁盘阵列的校验方法、装置、存储介质及电子设备

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5392244A (en) * 1993-08-19 1995-02-21 Hewlett-Packard Company Memory systems with data storage redundancy management
US5546558A (en) * 1994-06-07 1996-08-13 Hewlett-Packard Company Memory system with hierarchic disk array and memory map store for persistent storage of virtual mapping information
US5479653A (en) 1994-07-14 1995-12-26 Dellusa, L.P. Disk array apparatus and method which supports compound raid configurations and spareless hot sparing
US5664187A (en) * 1994-10-26 1997-09-02 Hewlett-Packard Company Method and system for selecting data for migration in a hierarchic data storage system using frequency distribution tables
US5542065A (en) * 1995-02-10 1996-07-30 Hewlett-Packard Company Methods for using non-contiguously reserved storage space for data migration in a redundant hierarchic data storage system
US5960169A (en) * 1997-02-27 1999-09-28 International Business Machines Corporation Transformational raid for hierarchical storage management system

Also Published As

Publication number Publication date
EP0986000A4 (de) 2002-02-20
EP0986000A1 (de) 2000-03-15
DE69635713T2 (de) 2006-09-14
US6571314B1 (en) 2003-05-27
DE69635713D1 (de) 2006-03-30
WO1998012621A1 (fr) 1998-03-26

Similar Documents

Publication Publication Date Title
EP0986000B1 (de) Speicherplattenteilsystem
JP2769443B2 (ja) 記憶サブシステム及び関連する装置／方法
EP0572564B1 (de) Paritätsberechnung in einer effizienten matrix von massenspeichergeräten
US5720027A (en) Redundant disc computer having targeted data broadcast
US6009481A (en) Mass storage system using internal system-level mirroring
EP0294287B1 (de) Gegen Fehler tolerantes, Fehler korrigierendes Speichersystem und Verfahren zur Speicherung digitaler Information in einem derartigen Speichersystem
US5883909A (en) Method and apparatus for reducing data transfers across a memory bus of a disk array controller
US5745671A (en) Data storage system with localized XOR function
US6886075B2 (en) Memory device system and method for copying data in memory device system
US6397348B1 (en) Redundant array of disk drives with asymmetric mirroring and asymmetric mirroring data processing method
WO1998013760A1 (en) Data storage system with selectable data protection
JP2000148403A (ja) ディスクアレイ
US5875460A (en) Disk array subsystem and data generation method therefor
US6611897B2 (en) Method and apparatus for implementing redundancy on data stored in a disk array subsystem based on use frequency or importance of the data
JPH0863298A (ja) ディスクアレイ装置
CA2220974A1 (en) Disk array system including a dual-ported staging memory and concurrent redundancy calculation capability
JP2005099995A (ja) 磁気ディスク装置のディスク共有方法及びシステム
JPH06187101A (ja) ディスクアレイ
JP3597349B2 (ja) 記憶サブシステムおよびその障害回復方法
WO1992004674A1 (en) Computer memory array control
JP3250859B2 (ja) ディスクアレイ装置、コンピュータシステム及びデータ記憶装置
JPH10312246A (ja) 記憶装置サブシステム
JPH1091363A (ja) パリティ生成方式及びそれを用いたディスクアレイ制御装置
JP2857289B2 (ja) ディスクアレイ装置
AU3091592A (en) Computer memory array control

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19990419

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB

A4 Supplementary search report drawn up and despatched

Effective date: 20020107

AK Designated contracting states

Kind code of ref document: A4

Designated state(s): DE FR GB

RIC1 Information provided on ipc code assigned before grant

Free format text: 7G 06F 3/06 A, 7G 06F 11/10 B, 7G 06F 11/20 B

17Q First examination report despatched

Effective date: 20040803

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69635713

Country of ref document: DE

Date of ref document: 20060330

Kind code of ref document: P

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20061005

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20101125 AND 20101201

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 69635713

Country of ref document: DE

Owner name: SAMSUNG ELECTRONICS CO., LTD., SUWON-SI, KR

Free format text: FORMER OWNER: HITACHI, LTD., TOKYO, JP

Effective date: 20110214

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20150820

Year of fee payment: 20

Ref country code: GB

Payment date: 20150825

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20150824

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69635713

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20160919

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20160919