Evaluation and Comparison of Task Allocation and Scheduling Methods for Distributed Real-Time Systems

Authors:
Jan Jonsson;Jonas Vasell
Affiliations:
-;-
Venue:
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
Year:
1996

Citing 0
Cited 2

A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System

ICPP '97 Proceedings of the international Conference on Parallel Processing
Model driven scheduling framework for multiprocessor soc design

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automatic tool support for scheduling of distributed real-time applications on various platforms is of critical importance both to guarantee critical application demands, such as safety requirements, as well as to keep development costs down. It is, however, difficult to choose a proper scheduling technique from the plethora of more or less practical approaches that are available, as means for objective evaluation and comparison of scheduling approaches are lacking. In this paper we propose a framework for description, evaluation, and comparison of methods for task allocation and scheduling on distributed real-time systems. By using this framework it is possible to perform studies, both of existing techniques as well as of new combinations of existing techniques. Our framework uses a decomposition approach wherein existing scheduling methods have been analyzed and broken down into a set of independent parameter choices.