Striping in large tape libraries
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Tapes hold data, too: challenges of tuples on tertiary store
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient organization and access of multi-dimensional datasets on tertiary storage systems
Information Systems - Special issue: scientific databases
Disk-tape joins: synchronizing disk and tape access
Proceedings of the 1995 ACM SIGMETRICS joint 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
CSIM: a C-based process-oriented simulation language
WSC '86 Proceedings of the 18th conference on Winter simulation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Log-Structured Organization for Tertiary Storage
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Efficient Organization of Large Multidimensional Arrays
Proceedings of the Tenth International Conference on Data Engineering
Query Processing in Tertiary Memory Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Scheduling Tertiary I/O in Database Applications
DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
Database systems for efficient access to tertiary memory
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
Analysis of striping techniques in robotic storage libraries
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Single Query Optimization for Tertiary Memory
Single Query Optimization for Tertiary Memory
| Hi-index | 0.00 |
The ever growing needs of large multimedia systems cannot be met by magnetic disks due to their high cost and low storage density. Consequently, cheaper and denser tertiary storage systems are being integrated into the storage hierarchies of these applications. Although tertiary storage is cheaper, the access latency is very high due to the need to load and unload media on the drives. This high latency and the bursty nature of I/O traffic result in the accumulation of I/O requests for tertiary storage. We study the problem of scheduling these requests to improve performance. In particular we address the issues of scheduling across multiple tapes or disks as opposed to most other studies which consider only one or two media. We focus on algorithms that minimize the number of switches and show through simulation that these result in near-optimal schedules. For single drive libraries an efficient algorithm that produces optimal schedules is developed. For multiple drives the problem is shown to be NP-Complete. Efficient and effective heuristics are presented for both single and multiple drives. The scheduling policies developed achieve significant performance gains over naive policies. The algorithms are simple to implement and are not restrictive. The study encompasses all types of storage libraries handling removable media, such as tapes and optical disks.