Scheduling heterogeneous multimedia servers: different QoS for hard, soft and non real-time clients

Authors:
R. M. Santos;J. Santos;J. Orozco
Affiliations:
Universidad Nacional del Sur, CONICET, Bahía Blanca, Argentina;Universidad Nacional del Sur, CONICET, Bahía Blanca, Argentina;Universidad Nacional del Sur, CONICET, Bahía Blanca, Argentina
Venue:
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Year:
2000

Citing 4
Cited 3

Overview of the p×64 kbit/s video coding standard

Communications of the ACM - Special issue on digital multimedia systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Quality of Service: Old Idea, New Options

IT Professional
Multimedia Information Systems

IEEE MultiMedia

A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters

Journal of Parallel and Distributed Computing
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to present a probabilistic model of a clients/server multimedia system based on the theory of Markov processes. The server provides different qualities of service (hard real-time, soft real-time and best effort) and is operated using a new scheduling concept based on our hybrid deterministic/probabilistic analysis. The model also provides answers to some fundamental engineering design questions related to disks' price/ performance trade-offs.