Paged segment striping scheme for the dynamic scheduling of continuous media servers

Authors:
KyungOh Lee;J. B. Lee;Kee-Wook Rim
Affiliations:
Sunmoon University, ChungNam Asansi, Korea;Sunmoon University, ChungNam Asansi, Korea;Sunmoon University, ChungNam Asansi, Korea
Venue:
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
Year:
2004

Citing 3
Cited 0

Performability of disk-array-based video servers

Multimedia Systems
An effective admission control mechanism for variable-bit-rate video streams

Multimedia Systems
Generalized data retrieval for pyramid-based periodic broadcasting of videos

Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web

Quantified Score

Hi-index	0.00

Visualization

Abstract

An innovative dynamic scheduling scheme is proposed to improve the efficiency of video-on-demand servers. We first introduce a paged segment striping model that makes dynamic scheduling possible. Based on this striping scheme, we propose a dynamic scheduling scheme that adapts to frequently changing workloads. In particular, we can change the round length without any additional disk access so that it can be adapted to changing request trends with a negligible cost in performance. This dynamic scheduling scheme always shows better performance than the static scheduling scheme in simulation. Although the dynamical scheme introduces additional scheduling overhead, it is very small when compared with the performance degradation in the static scheme.