Method of reducing the complexity of an I/O request to a RAID-4

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395441, G06F 900

Patent

active

055198490

ABSTRACT:
Data storage systems using a RAID-4 or RAID-5 organization divide an application I/O request into a number of individual I/O requests, each of which is contained within the boundaries of a single strip. The data blocks of each chunk on a strip responsive to an I/O request can form a complex geometric pattern requiring complicated operations to perform the I/O request. To simplify the necessary operations, each individual I/O request to a strip is divided into at most three requests targeted to data blocks forming a rectangle and each of these rectangles are processed as a unit. If a data block within a rectangle is unavailable, then the request to that rectangle is further subdivided into at most two requests targeted to data blocks forming smaller, non-overlapping rectangles which collectively are the original rectangle. The recursive decomposition of rectangles into smaller rectangles isolates the data block with an error and permits the selection of fewer and less complicated operation algorithms to complete the I/O request.

REFERENCES:
patent: 4092732 (1978-05-01), Ouchi
patent: 4434487 (1984-02-01), Rubinson et al.
patent: 4775978 (1988-10-01), Hartness
patent: 4914656 (1990-04-01), Dunphy et al.
patent: 4989205 (1991-01-01), Dunphy et al.
patent: 4989206 (1991-01-01), Dunphy et al.
patent: 5072378 (1991-12-01), Manka
patent: 5148432 (1992-09-01), Gordon
patent: 5166939 (1992-11-01), Jaffe et al.
patent: 5195100 (1993-03-01), Katz et al.
patent: 5202799 (1993-04-01), Hetzler et al.
patent: 5258984 (1995-08-01), Menon
patent: 5301297 (1995-08-01), Menon
patent: 5313626 (1995-08-01), Jones
"Software and Performance Issues in the Implementation of a RAID Prototype", Edward K. Lee, Report No. UCB/CSD, 90/573, May 1990, Computer Science Division, Univ. of California, Berkeley.
A Case for Redundant Array of Inexpensive Disks (RAID), David A. Patterson, Garth Gibson, Randy H. Katz, Report No. UCB/CSD 87/391, Dec. 1987, Computer Science Division (EECS), University of California, Berkeley, CA 94720.
A Case for Redundant Arrays of Inexpensive Disks (RAID), David A. Patterson, Garth Gibson, and Randy H. Katz, ACM SIGMOD Conference-Jun. 1-3, 1988, Chicago, Illinois.
Two Papers on RAIDs, Peter Chen, Garth Gibson, Randy H. Katz, David A. Patterson, Martin Schulze, Report No. UCB/CSD 88/479, Dec., 1988, Computer Science Division (EECS), University of California, Berkeley, CA 94720.
An Introduction to RAID-Redundant Arrays of Inexpensive Disks, Peter McLean, Apr. 24, 1991, Digital Equipment Corporation-CXO1-2/N26.
A Queuing Analysis of RAID Architectures, Schenze Chen and Don Towsley, COINS Tech. Report 91-71, Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003.
The Digital Guide to RAID Storage Technology, 1992, Digital Equipment Corporation.

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

Method of reducing the complexity of an I/O request to a RAID-4 does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of reducing the complexity of an I/O request to a RAID-4 , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of reducing the complexity of an I/O request to a RAID-4 will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2046830

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