Scheduling random I/O for data storage tape

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

711158, 395826, 395861, 395863, 395732, G06F 1318

Patent

active

058453164

ABSTRACT:
A system for scheduling read-requests for a serpentine data tape. The transit time between arbitrarily selected locations in the tape is not a linear function of distance between the locations. Despite this non-linearity, a model has been developed which accurately predicts such transit times. Using the model, a list of read-requests is re-organized into a sequence requiring a minimal, or at least smaller, total time to execute.

REFERENCES:
patent: 3623006 (1971-11-01), Balakian et al.
patent: 4888691 (1989-12-01), George et al.
patent: 5644786 (1997-07-01), Gallagher et al.
"Understanding Computers: Memory and Storage", Time Life Books, Alexandria, Virginia, 1987:pp. 46-47.

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

Scheduling random I/O for data storage tape does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scheduling random I/O for data storage tape, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling random I/O for data storage tape will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2403672

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