The Quality of Service Satisfiability Thesis: Resource and Performance Prediction for Multi-Processor Systems and Random Schedules

Authors:
A. D. Parks
Affiliations:
Naval Surface Warfare Center, Dahlgren, Virginia
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 4
Cited 0

Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Jitter concerns in periodic task systems

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Quality of Service Satisfiability Thesis is established which provides a very general condition for determining the number of processors needed by a system in order to satisfy the quality of service required by a multi-task random schedule which is presented to the system for servicing. Since "processors" and "schedules" are abstract representations of general servicing "resources" and uncertain task "environments", the thesis has utility for studying and predicting resource requirements and associated performances in a variety of application domains. Uniformly distributed random schedules are used to illustrate the significance of the thesis.