Scheduling Tertiary I/O in Database Applications

Authors:
Sunil Prabhakar;Divyakant Agrawal;Amr El Abbadi;Ambuj Singh
Affiliations:
-;-;-;-
Venue:
DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
Year:
1997

Citing 0
Cited 4

Efficiently sequencing tape-resident jobs

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hierarchical data placement for navigational multimedia applications

Data & Knowledge Engineering
A Flexible Real-Time Hierarchical Multimedia Archive

IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
Optimal Scheduling Algorithms for Tertiary Storage

Distributed and Parallel Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of scheduling I/O requests for tertiary storage libraries to improve performance. The focus is on scheduling policies that process all requests on a loaded medium before unloading it. For single drive settings 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 the multiple drives case. The scheduling policies developed achieve significant performance gains over more naive first come first server policies. The study is general enough to be applicable to any storage library handling removable media, such as tapes or optical disks.