Efficient algorithms for slot-scheduling and cycle-scheduling of video streams on clustered video servers

Citation
Cs. Lin et al., Efficient algorithms for slot-scheduling and cycle-scheduling of video streams on clustered video servers, MULTIMED T, 13(2), 2001, pp. 213-227
Citations number
14
Categorie Soggetti
Computer Science & Engineering
Journal title
MULTIMEDIA TOOLS AND APPLICATIONS
ISSN journal
13807501 → ACNP
Volume
13
Issue
2
Year of publication
2001
Pages
213 - 227
Database
ISI
SICI code
1380-7501(200102)13:2<213:EAFSAC>2.0.ZU;2-Q
Abstract
The granularity of scheduling video streams can be categorized as cycle-sch eduling and slot-scheduling where a time cycle is further divided into time slots. To avoid resource conflict and thereby increase throughput of clust ered video servers, slot-scheduling using conflict-free scheduling and espe cially cycle-scheduling using full-duplex scheduling and ordered scheduling are presented in the paper. Also, the analysis of the pros and cons of app lying slot-scheduling and cycle-scheduling on clustered video servers are d iscussed.