Scheduling random I/O for data storage tape

摘要

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.