Stochastic performance guarantees for mixed workloads in a multimedia information system

Authors:
G. Nerjes;P. Muth;G. Weikum
Affiliations:
-;-;-
Venue:
RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
Year:
1997

Citing 0
Cited 7

Stochastic service guarantees for continuous data on multi-zone disks

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disk scheduling for mixed-media workloads in a multimedia server

MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Incremental Scheduling of Mixed Workloads in MultimediaInformation Servers

Multimedia Tools and Applications
An Admission Control Framework for Applications with Variable Consumption Rates in Client-Pull Architectures

MIS '98 Proceedings of the 4th International Workshop on Advances in Multimedia Information Systems
Performance Tradeoffs in Scheduling Techniques for Mixed Workloads

Multimedia Tools and Applications
A study for control of client value using cluster analysis

Journal of Network and Computer Applications
Class-based request control system in multimedia contents service

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to stochastic performance guarantees for multimedia servers with mixed workloads. Advanced multimedia applications such as digital libraries or teleteaching exhibit a mixed workload with accesses to both "continuous" and conventional, "discrete" data, where the fractions of continuous data and discrete data requests vary over time. We assume that a server shares all disks among continuous and discrete data, and we develop a stochastic performance model for the resulting mixed workload, using a combination of analytic and simulation based modeling. Based on this model we devise a round based scheduling scheme with stochastic performance guarantees: for continous data requests, we bound the probability that "glitches" occur and for discrete data requests, we bound the probability that the response time exceeds a certain tolerance threshold. We present early results of simulation studies.