I/O scheduling for digital continuous media

Deepak R. Kenchammana-Hosekote, Jaideep Srivastava

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

A growing set of applications require access to digital video and audio. In order to provide playback of such continuous media (CM), scheduling strategies for CM data servers (CMS) are necessary. In some domains, particularly defense and industrial process control, the timing requirements of these applications are strict and essential to their correct operation. In this paper we develop a scheduling strategy for multiple access to a CMS such that the timing guarantees are maintained at all times. First, we develop a scheduling strategy for the steady state, i.e., when there are no changes in playback rate or operation. We derive an optimal Batched SCAN (BSCAN) algorithm that requires minimum buffer space to schedule concurrent accesses. The scheduling strategy incorporates two key constraints: (1) data fetches from the storage system are assumed to be in integral multiples of the block size, and (2) playback guarantees are ensured for frame-oriented streams when each frame can span multiple blocks. We discuss modifications to the scheduling strategy to handle compressed data like motion-JPEG and MPEG. Second, we develop techniques to handle dynamic changes brought about by VCR-like operations executed by applications. We define a suite of primitive VCR-like operations that can be executed. We show that an unregulated change in the BSCAN schedule, in response to VCR-like operations, will affect playback guarantees. We develop two general techniques to ensure playback guarantees while responding to VCR-like operations: passive and active accumulation. Using user response time as a metric we show that active accumulation algorithms outperform passive accumulation algorithms. An optimal response-time algorithm in a class of active accumulation strategies is derived. The results presented here are validated by extensive simulation studies.

Original languageEnglish
Pages (from-to)213-237
Number of pages25
JournalMultimedia Systems
Volume5
Issue number4
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Videocassette recorders
Scheduling
Servers
Response Time
Timing
Schedule
Server
Digital Video
Multiple integral
Multiple Access
Storage System
Process control
Process Control
Strategy
Buffer
Concurrent
Simulation Study
Metric
Necessary
Motion

Keywords

  • Continuous media
  • Frame-oriented streams
  • I/O scheduling
  • VCR-like operations

ASJC Scopus subject areas

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

Cite this

Kenchammana-Hosekote, D. R., & Srivastava, J. (1997). I/O scheduling for digital continuous media. Multimedia Systems, 5(4), 213-237.

I/O scheduling for digital continuous media. / Kenchammana-Hosekote, Deepak R.; Srivastava, Jaideep.

In: Multimedia Systems, Vol. 5, No. 4, 1997, p. 213-237.

Research output: Contribution to journalArticle

Kenchammana-Hosekote, DR & Srivastava, J 1997, 'I/O scheduling for digital continuous media', Multimedia Systems, vol. 5, no. 4, pp. 213-237.
Kenchammana-Hosekote, Deepak R. ; Srivastava, Jaideep. / I/O scheduling for digital continuous media. In: Multimedia Systems. 1997 ; Vol. 5, No. 4. pp. 213-237.
@article{49ce801041794d3ead4f178d01e38277,
title = "I/O scheduling for digital continuous media",
abstract = "A growing set of applications require access to digital video and audio. In order to provide playback of such continuous media (CM), scheduling strategies for CM data servers (CMS) are necessary. In some domains, particularly defense and industrial process control, the timing requirements of these applications are strict and essential to their correct operation. In this paper we develop a scheduling strategy for multiple access to a CMS such that the timing guarantees are maintained at all times. First, we develop a scheduling strategy for the steady state, i.e., when there are no changes in playback rate or operation. We derive an optimal Batched SCAN (BSCAN) algorithm that requires minimum buffer space to schedule concurrent accesses. The scheduling strategy incorporates two key constraints: (1) data fetches from the storage system are assumed to be in integral multiples of the block size, and (2) playback guarantees are ensured for frame-oriented streams when each frame can span multiple blocks. We discuss modifications to the scheduling strategy to handle compressed data like motion-JPEG and MPEG. Second, we develop techniques to handle dynamic changes brought about by VCR-like operations executed by applications. We define a suite of primitive VCR-like operations that can be executed. We show that an unregulated change in the BSCAN schedule, in response to VCR-like operations, will affect playback guarantees. We develop two general techniques to ensure playback guarantees while responding to VCR-like operations: passive and active accumulation. Using user response time as a metric we show that active accumulation algorithms outperform passive accumulation algorithms. An optimal response-time algorithm in a class of active accumulation strategies is derived. The results presented here are validated by extensive simulation studies.",
keywords = "Continuous media, Frame-oriented streams, I/O scheduling, VCR-like operations",
author = "Kenchammana-Hosekote, {Deepak R.} and Jaideep Srivastava",
year = "1997",
language = "English",
volume = "5",
pages = "213--237",
journal = "Multimedia Systems",
issn = "0942-4962",
publisher = "Springer Verlag",
number = "4",

}

TY - JOUR

T1 - I/O scheduling for digital continuous media

AU - Kenchammana-Hosekote, Deepak R.

AU - Srivastava, Jaideep

PY - 1997

Y1 - 1997

N2 - A growing set of applications require access to digital video and audio. In order to provide playback of such continuous media (CM), scheduling strategies for CM data servers (CMS) are necessary. In some domains, particularly defense and industrial process control, the timing requirements of these applications are strict and essential to their correct operation. In this paper we develop a scheduling strategy for multiple access to a CMS such that the timing guarantees are maintained at all times. First, we develop a scheduling strategy for the steady state, i.e., when there are no changes in playback rate or operation. We derive an optimal Batched SCAN (BSCAN) algorithm that requires minimum buffer space to schedule concurrent accesses. The scheduling strategy incorporates two key constraints: (1) data fetches from the storage system are assumed to be in integral multiples of the block size, and (2) playback guarantees are ensured for frame-oriented streams when each frame can span multiple blocks. We discuss modifications to the scheduling strategy to handle compressed data like motion-JPEG and MPEG. Second, we develop techniques to handle dynamic changes brought about by VCR-like operations executed by applications. We define a suite of primitive VCR-like operations that can be executed. We show that an unregulated change in the BSCAN schedule, in response to VCR-like operations, will affect playback guarantees. We develop two general techniques to ensure playback guarantees while responding to VCR-like operations: passive and active accumulation. Using user response time as a metric we show that active accumulation algorithms outperform passive accumulation algorithms. An optimal response-time algorithm in a class of active accumulation strategies is derived. The results presented here are validated by extensive simulation studies.

AB - A growing set of applications require access to digital video and audio. In order to provide playback of such continuous media (CM), scheduling strategies for CM data servers (CMS) are necessary. In some domains, particularly defense and industrial process control, the timing requirements of these applications are strict and essential to their correct operation. In this paper we develop a scheduling strategy for multiple access to a CMS such that the timing guarantees are maintained at all times. First, we develop a scheduling strategy for the steady state, i.e., when there are no changes in playback rate or operation. We derive an optimal Batched SCAN (BSCAN) algorithm that requires minimum buffer space to schedule concurrent accesses. The scheduling strategy incorporates two key constraints: (1) data fetches from the storage system are assumed to be in integral multiples of the block size, and (2) playback guarantees are ensured for frame-oriented streams when each frame can span multiple blocks. We discuss modifications to the scheduling strategy to handle compressed data like motion-JPEG and MPEG. Second, we develop techniques to handle dynamic changes brought about by VCR-like operations executed by applications. We define a suite of primitive VCR-like operations that can be executed. We show that an unregulated change in the BSCAN schedule, in response to VCR-like operations, will affect playback guarantees. We develop two general techniques to ensure playback guarantees while responding to VCR-like operations: passive and active accumulation. Using user response time as a metric we show that active accumulation algorithms outperform passive accumulation algorithms. An optimal response-time algorithm in a class of active accumulation strategies is derived. The results presented here are validated by extensive simulation studies.

KW - Continuous media

KW - Frame-oriented streams

KW - I/O scheduling

KW - VCR-like operations

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

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

M3 - Article

VL - 5

SP - 213

EP - 237

JO - Multimedia Systems

JF - Multimedia Systems

SN - 0942-4962

IS - 4

ER -