Fundamentals of scheduling and performance of video tape libraries

Triantafillou, P., Georgiadis, C. and Faloutsos, C. (2002) Fundamentals of scheduling and performance of video tape libraries. Multimedia Tools and Applications, 18(2), pp. 137-158. (doi: 10.1023/A:1016207026242)

Full text not currently available from Enlighten.


Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a new scheduling algorithm, the so-called Relief, and compare it against some older/straightforward ones, like FCFS, Maximum Queue Length (MQL) and an unfair one (Bypass), roughly equivalent to Shortest Job First. The proposed algorithm incorporates an aging mechanism in order to attain fairness and we prove that, under certain assumptions, it minimizes the average start-up latency. Extensive simulation experiments show that Relief outperforms its competitors (fair and unfair alike), with up to 203% improvement in throughput, for the same rejection ratio.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Triantafillou, Professor Peter
Authors: Triantafillou, P., Georgiadis, C., and Faloutsos, C.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Multimedia Tools and Applications
ISSN (Online):1573-7721

University Staff: Request a correction | Enlighten Editors: Update this record