Method for dispatching work requests in a data storage hierarchy

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 364DIG2, 3649571, 3649646, 3642384, 3642543, G06F 1314

Patent

active

051406837

ABSTRACT:
A method for dispatching work requests in a data storage hierarchy in which directory data is promoted in variable length spans, the use of which are maximized even for work requests entering the work request queue after the span is chosen, is disclosed. A queue of work requests is initially scanned to determine if any requests therein require access to directory data stored in secondary storage within a prescribed proximity of that required by the next request to be dispatched. If such other work requests exist, then directory data in addition to that required by the next request to be dispatched is also promoted. To minimize seek time and rotational latency, the additional data is promoted from secondary storage in a single device I/O cycle. The additional data is chosen by adjusting the outer limits of the span as each work request in queue is scanned. After the actual promotion of the span of data, the existing work request is completed. Upon the ensuing scan of the queue the dispatch of any work requests stored therein and requiring access to data previously promoted is next completed. The additionally promoted data, known to be required by other work requests in the queue, is thus certain to be accessed before subsequent migration. The priority completed requests include those requests added to the queue after the span of data was promoted.

REFERENCES:
patent: 3623006 (1971-11-01), Balakian et al.
patent: 4056848 (1977-11-01), Gilley
patent: 4399503 (1983-08-01), Hawley
patent: 4429363 (1984-01-01), Duke et al.
patent: 4490782 (1984-12-01), Dixon et al.
patent: 4533995 (1985-08-01), Christian et al.
patent: 4583166 (1986-04-01), Hartung et al.
patent: 4636946 (1987-01-01), Hartung et al.
patent: 4638424 (1987-01-01), Beglin et al.
IBM Technical Disclosure Bulletin, "Enhanced Disk Task Sequencing", vol. 29, No. 5, Oct. 1986, pp. 1946-1948.
IBM Technical Disclosure Bulletin, "Dynamically Maintained Command Chains", vol. 24, No. 12, May 1982, pp. 6605-6606.
IBM Technical Disclosure Bulletin, "Synchronized Rotating Storage Devices Utilizing Sector Queuing", vol. 12, No. 6, Nov. 1696, pp. 818-819.
IBM Technical Disclosure Bulletin, "Priority Circuit for Servicing Requests Queued by Sector", vol. 12, No. 6, Nov. 1696, pp. 815-817.

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 for dispatching work requests in a data storage hierarchy 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 for dispatching work requests in a data storage hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for dispatching work requests in a data storage hierarchy will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1255391

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