On multimedia repositories, personal computers, and hierarchical storage systems
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Tertiary storage: an evaluation of new applications
Tertiary storage: an evaluation of new applications
Dynamic batching policies for an on-demand video server
Multimedia Systems
On the modeling and performance characteristics of a serpentine tape drive
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Random I/O scheduling in online tertiary storage systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An analytical performance model of robotic storage libraries
Performance Evaluation
Challenges for tertiary storage in multimedia servers
Parallel Computing - Special issues on applications: parallel data servers and applications
A Cost-effective Near-line Storage Server for Multimedia System
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Principles of Optimally Placing Data in Tertiary Storage Libraries
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Performance Measurements of Tertiary Storage Devices
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On-Demand Data Elevation in Hierarchical Multimedia Storage Servers
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Analysis of striping techniques in robotic storage libraries
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
High performance data broadcasting systems
Mobile Networks and Applications
Hi-index | 0.01 |
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.