Distribution of I/O requests across multiple disk units

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S112000, C711S147000, C711S148000, C711S153000, C710S043000, C710S110000, C710S111000, C709S241000

Reexamination Certificate

active

10799013

ABSTRACT:
A method of respectively reading and writing data to and from a plurality of physical disk units in response to I/O requests from a host computing system includes establishing a logical disk group having a number of logical disk elements, mapping each of the logical disk elements to corresponding physical disk units, receiving from the host computing system an I/O request for data to select a one of the number of logical disk elements, accessing the physical disk unit corresponding to the selected one logical disk to access for the data, and transferring the accessed data to the host computing system.

REFERENCES:
patent: 3889237 (1975-06-01), Alferness et al.
patent: 4152764 (1979-05-01), Connors et al.
patent: 4495567 (1985-01-01), Treen
patent: 4598362 (1986-07-01), Kinjo et al.
patent: 4718006 (1988-01-01), Nishida
patent: 4791564 (1988-12-01), Takai
patent: 4802164 (1989-01-01), Fukuoka et al.
patent: 4803653 (1989-02-01), Suzuki et al.
patent: 4837680 (1989-06-01), Crockett et al.
patent: 4881169 (1989-11-01), Tanaka et al.
patent: 4882671 (1989-11-01), Graham et al.
patent: 4888691 (1989-12-01), George et al.
patent: 5043883 (1991-08-01), Inouchi et al.
patent: 5142627 (1992-08-01), Elliot et al.
patent: 5155835 (1992-10-01), Belsan
patent: 5155845 (1992-10-01), Beal et al.
patent: 5202973 (1993-04-01), Ramanujan et al.
patent: 5276836 (1994-01-01), Fukumaru et al.
patent: 5388242 (1995-02-01), Jewett
patent: 5481694 (1996-01-01), Chao et al.
patent: 5568628 (1996-10-01), Satoh et al.
patent: 5584012 (1996-12-01), Kojima et al.
patent: 5608891 (1997-03-01), Mizuno et al.
patent: 5651132 (1997-07-01), Honda et al.
patent: 5680574 (1997-10-01), Yamamoto et al.
patent: 5742933 (1998-04-01), Kojima et al.
patent: 5813024 (1998-09-01), Saito
patent: 5835938 (1998-11-01), Yamamoto et al.
patent: 5964886 (1999-10-01), Slaughter et al.
patent: 6145067 (2000-11-01), Kuwata
patent: 6457096 (2002-09-01), Ageishi et al.
patent: 6567889 (2003-05-01), DeKoning et al.
patent: 2002/0019920 (2002-02-01), Reuter et al.
patent: 2002/0120812 (2002-08-01), Ageishi et al.
patent: 2002/0124139 (2002-09-01), Baek et al.
patent: 2 086 625 (1982-05-01), None
patent: 2086625 (1982-05-01), None
patent: 59-135563 (1984-08-01), None
patent: 59135563 (1984-08-01), None
patent: 60-114947 (1985-06-01), None
patent: 60114947 (1985-06-01), None
patent: 61-28128 (1986-06-01), None
patent: 6128128 (1986-06-01), None
patent: 63056873 (1988-03-01), None
patent: 02-037418 (1990-02-01), None
patent: 0237418 (1990-02-01), None
patent: 06-348421 (1994-12-01), None
patent: 06348421 (1994-12-01), None
patent: 0-016328 (1996-01-01), None
patent: 08016328 (1996-01-01), None
patent: 2002-298556 (2000-10-01), None
patent: 2001-230836 (2001-02-01), None
Information Process Institute Bulletin “Nishigaki et al., Analysis on Disk Cache Effects in a Sequential Access Input Process”, vol. 25, No. 2, pp. 313-320 (1984).

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

Distribution of I/O requests across multiple disk units does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distribution of I/O requests across multiple disk units, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distribution of I/O requests across multiple disk units will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3858842

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