Optimal scheduling algorithms for tertiary storage

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)255-282
Number of pages28
JournalDistributed and Parallel Databases
Volume14
Issue number3
DOIs
Publication statusPublished - 1 Nov 2003
Externally publishedYes

Fingerprint

Optimal Scheduling
Scheduling algorithms
Optimal Algorithm
Scheduling Algorithm
Scheduling
Tapes
Multimedia systems
Latency
Schedule
Switches
Multimedia Systems
Scheduling Policy
Storage System
Switch
Efficient Algorithms
NP-complete problem
Traffic
Costs
Heuristics
Minimise

Keywords

  • I/O scheduling
  • Multiple drives
  • Optimal
  • Removable media
  • Single-drive
  • Tape libraries

ASJC Scopus subject areas

  • Information Systems
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Optimal scheduling algorithms for tertiary storage. / Prabhakar, Sunil; Agrawal, Divyakant; El Abbadi, Amr.

In: Distributed and Parallel Databases, Vol. 14, No. 3, 01.11.2003, p. 255-282.

Research output: Contribution to journalArticle

Prabhakar, Sunil ; Agrawal, Divyakant ; El Abbadi, Amr. / Optimal scheduling algorithms for tertiary storage. In: Distributed and Parallel Databases. 2003 ; Vol. 14, No. 3. pp. 255-282.
@article{3b8f5768197e41208209fe03e6fe8925,
title = "Optimal scheduling algorithms for tertiary storage",
abstract = "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.",
keywords = "I/O scheduling, Multiple drives, Optimal, Removable media, Single-drive, Tape libraries",
author = "Sunil Prabhakar and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2003",
month = "11",
day = "1",
doi = "10.1023/A:1025589332623",
language = "English",
volume = "14",
pages = "255--282",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Optimal scheduling algorithms for tertiary storage

AU - Prabhakar, Sunil

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2003/11/1

Y1 - 2003/11/1

N2 - 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.

AB - 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.

KW - I/O scheduling

KW - Multiple drives

KW - Optimal

KW - Removable media

KW - Single-drive

KW - Tape libraries

UR - http://www.scopus.com/inward/record.url?scp=0141732251&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141732251&partnerID=8YFLogxK

U2 - 10.1023/A:1025589332623

DO - 10.1023/A:1025589332623

M3 - Article

VL - 14

SP - 255

EP - 282

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 3

ER -