Efficient Algorithms for Slot-Scheduling and Cycle-Scheduling of Video Streams on Clustered Video Servers

  • Authors:
  • Chow-Sing Lin;Min-You Wu;Wei Shu

  • Affiliations:
  • Department of Information Management, Southern Taiwan University of Technology, Taiwan, R.O.C. mikelin@stut.edu.tw;Department of Elec. and Comp. Engr. University of New Mexico, New Mexico, U.S.A. wu@eece.unm.edu;Department of Elec. and Comp. Engr. University of New Mexico, New Mexico, U.S.A. shu@eece.unm.edu

  • Venue:
  • Multimedia Tools and Applications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The granularity of scheduling video streams can be categorized as cycle-scheduling and slot-scheduling where a time cycle is further divided into time slots. To avoid resource conflict and thereby increase throughput of clustered video servers, slot-scheduling using conflict-free scheduling and especially cycle-scheduling using full-duplex scheduling and ordered scheduling are presented in the paper. Also, the analysis of the pros and cons of applying slot-scheduling and cycle-scheduling on clustered video servers are discussed.