Multi-path data retrieval from redundant array

Details Multi-path data retrieval from redundant array Multi-path data retrieval from redundant array

2011-03-22

2011-03-22

Gilles, Jude J Jean (Department: 2447)

Electrical computers and digital processing systems: multicomput

Remote data accessing

C709S225000, C714S022000, C714S042000, C714S819000, C711S114000, C711S112000

Reexamination Certificate

active

07912918

ABSTRACT:
An optimum pathway to data stored on a data storage system having N storage devices and more than N pathways is determined in response to a read request for the data. A sorter separates the read request into an appropriate segment size for sending to the storage devices of the data storage system. An assigner generates the set of read permutations satisfying the read request. A read permutation is selected based on a metric. A collector receives the requested data from the N storage devices in response to the selected read permutation being sent to the storage devices.

REFERENCES:
patent: 5134619 (1992-07-01), Henson et al.
patent: 5148432 (1992-09-01), Gordon et al.
patent: 5257391 (1993-10-01), DuLac et al.
patent: 5301297 (1994-04-01), Menon et al.
patent: 5398253 (1995-03-01), Gordon
patent: 5506977 (1996-04-01), Jones
patent: 5579475 (1996-11-01), Blaum et al.
patent: 5592612 (1997-01-01), Birk
patent: 5758054 (1998-05-01), Katz et al.
patent: 5835938 (1998-11-01), Yamamoto et al.
patent: 5848229 (1998-12-01), Morita
patent: 5937428 (1999-08-01), Jantz
patent: 6070249 (2000-05-01), Lee
patent: 6138125 (2000-10-01), DeMoss
patent: 6154853 (2000-11-01), Kedem
patent: 6161165 (2000-12-01), Solomon et al.
patent: 6269453 (2001-07-01), Krantz
patent: 6275898 (2001-08-01), DeKoning
patent: 6279138 (2001-08-01), Jadav et al.
patent: 6321345 (2001-11-01), Mann et al.
patent: 6353895 (2002-03-01), Stephenson
patent: 6356977 (2002-03-01), Ofek et al.
patent: 6434637 (2002-08-01), D'Errico
patent: 6530004 (2003-03-01), King et al.
patent: 6629204 (2003-09-01), Tanaka et al.
patent: 7017107 (2006-03-01), Talagala et al.
patent: 7020394 (2006-03-01), Zhang et al.
patent: 7062704 (2006-06-01), Talagala et al.
patent: 7254754 (2007-08-01), Hetzler et al.
patent: 7281177 (2007-10-01), Hetzler et al.
patent: 7379974 (2008-05-01), Hetzler et al.
patent: 2002/0035667 (2002-03-01), Bruning, III et al.
patent: 2002/0107962 (2002-08-01), Richter et al.
patent: 2002/0162075 (2002-10-01), Talagala et al.
patent: 2003/0035166 (2003-02-01), Zhang et al.
patent: 2005/0015371 (2005-01-01), Hetzler et al.
patent: 06-282385 (1994-10-01), None
patent: WO 00/67250 (2000-11-01), None
G.A. Alvarez et al., Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering, Computer Architecture News (USA), V. 25, #2, pp. 62-72, May 1972.
V. Bohossian et al., Computing in the RAIN: A Reliable Array of Independent Nodes, pp. 1-20, Sep. 24, 1999.
P.M. Chen et al., RAID: High-Performance, Reliable Secondary Storage, ACM Computing Surveys, vol. 26, No. 2, pp. 146-185, Jun. 1994.
M. Holland et al., Parity Declustering for Continuous Operation in Redundant Disk Arrays, ACM 0-89791-535-6/92/0010/0023, pp. 23-35, Oct. 1992.
N.K. Ouchi, Two-Level DASD Failure Recovery Method, IBM Technical Disclosure Bulletin, vol. 36, No. 3, pp. 187-190, Mar. 1993.
D.A. Patterson et al., A Case for Redundant Arrays of Inexpensive Disks (RAID), ACM 0-89791-268-3/88/0006/0109 1998.
J.S. Plank, A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems, pp. 1-19, Feb. 19, 1999.
E.J. Schwabe et al., Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays, ACM 0-89791-813-4/96/05, pp. 41-54, 1996.
E.J. Schwabe et al., Flexible Usage of Parity Storage Space in Disk Arrays, ACM 0-89791-809-6/96/06, pp. 99-108, 1996.
L. Xu at al., X-Code: MDS Array Codes with Optimal Encoding, IEEE Trans. on Information Theory, vol. 45, No. 1, pp. 272-276, Jan. 1999.
M. Blaum et al., “MDS Array Codes with Independent Parity Symbols,” IEEE Trans. on Information Theory, vol. IT-42, pp. 529 542, Mar. 1996.
M. Blaum et al., “The EVENODD Code and its Generalization,” High Performance Mass Storage and Parallel I/O: Technologies and Applications,' edited by H. Jin et al., IEEE & Wiley Press, New York, Chapter 14, pp. 187 208, 2001.
M. Blaum et al., “EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in a RAID Architecture,” IEEE Trans. on Computers, vol. 44, No. 2, pp. 192-202, Feb. 1995.
Office Action in EP 04 741 962.7-1245 mailed Jul. 11, 2007, 6 pages.

Affiliated with

Also associated with

Rating

Multi-path data retrieval from redundant 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 Multi-path data retrieval from redundant array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-path data retrieval from redundant array will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2721883