Two-dimensional disk array

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Other Related Categories

364DIG1, 3642437, 3642464, 371 404, 371 511, 395428, 395575, G06F 1110, G06F 1120

Type

Patent

Status

active

Patent number

054126614

Description

ABSTRACT:
A data storage system architecture having an array of small data storage disks, organized into logical rows and columns, with each disk coupled to two disk controllers via two independent controller-disk interconnects. No two disks are coupled to the same pair of controllers. In this data storage system architecture, the component disks are arranged in parity groups of variable size. Within each parity group, failure of one disk sector can be recovered through data reconstruction using data from other disks in the parity group. One or more disks can be reserved as hot standbys for substitution on failure, automatically replacing any failing disk.

REFERENCES:
patent: 3725864 (1973-04-01), Clark et al.
patent: 4993030 (1991-02-01), Krakauer et al.
patent: 5148432 (1992-09-01), Gordon et al.
patent: 5303244 (1994-04-01), Watson
"How Reilable is Raid?" by Martin Schulze et al; Computer Science Division, University of California Berkeley; IEEE 1989; pp. 118-123.
"A Case for Redundant Arrays of Inexpensive Disks (RAID)" D. A. Patterson et al; ACM SIGMOID Conference, Jun. 1988; pp. 109-116.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Two-dimensional disk array does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Two-dimensional disk array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-dimensional disk array will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1143473

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.