Excavating
Patent
1992-08-12
1994-05-03
Canney, Vincent P.
Excavating
371 101, 395425, G06F 1100
Patent
active
053094514
ABSTRACT:
A method for prefetching the data and parity blocks for generating parity data of a stripe. The method uses a low and high thresholds marker indicative of a first and second level of fullness of the cache to determine whether or not to prefetch the data and parity blocks. If the cache is filled to a level exceeding the first level of fullness, the data and parity blocks are prefetched for any blocks to be written to the disk drive between the low and high threshold. The data and parity blocks are read from the disk drive at a lower processing priority in anticipation of the writing of the block.
REFERENCES:
patent: 4437155 (1984-03-01), Sawyer et al.
patent: 4489378 (1984-12-01), Dixon et al.
patent: 4636946 (1987-01-01), Hartung et al.
patent: 4882642 (1989-11-01), Tayler et al.
patent: 4972316 (1990-11-01), Dixon et al.
patent: 4972364 (1990-11-01), Barrett et al.
patent: 5109485 (1992-04-01), Smith, Jr.
patent: 5109500 (1992-04-01), Iseki et al.
patent: 5124987 (1992-06-01), Milligan et al.
patent: 5163131 (1992-11-01), Row et al.
patent: 5263145 (1993-11-01), Brady et al.
Arnott Randy M.
Noya Eric S.
Rosich Mitchell N.
Brinkman Dirk
Canney Vincent P.
Cefalo Albert P.
Digital Equipment Corporation
LandOfFree
Data and parity prefetching for redundant arrays of disk drives does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data and parity prefetching for redundant arrays of disk drives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data and parity prefetching for redundant arrays of disk drives will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2121276