System for scheduling readahead operations if new request is wit

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395438, 3642451, 3642452, 364245DIG.1, G06F 1314

Patent

active

054836417

ABSTRACT:
An improved read ahead strategy that improves the performance of a disk array subsystem. The disk controller keeps track of the last n reads to the array. If a new read request is received that is adjacent to any of the last n reads, the controller performs a look ahead read because a sequential read may be in progress. The parameter n is preferably set comparable to or greater than the number of maximum independent activites being performed by the computer system. Therefore, in a multithread system, the controller performs a readahead if any one thread is doing a sequential read.

REFERENCES:
patent: 3350694 (1967-10-01), Kusnick et al.
patent: 3593314 (1971-07-01), Moll
patent: 4347567 (1982-08-01), DeTar, Jr. et al.
patent: 4371929 (1983-02-01), Braun et al.
patent: 4618897 (1986-10-01), Johnson et al.
patent: 5133060 (1992-07-01), Weber et al.
patent: 5140592 (1992-08-01), Idleman et al.
patent: 5140683 (1992-08-01), Gallo et al.
patent: 5146578 (1992-09-01), Zangenehpour
patent: 5150465 (1992-09-01), Bush et al.
patent: 5325509 (1994-06-01), Lautzenheiser

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

System for scheduling readahead operations if new request is wit does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for scheduling readahead operations if new request is wit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for scheduling readahead operations if new request is wit will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1309121

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