Adaptivity for quality and timeliness flexible real-time systems

Authors:
Thomas Schwarzfischer
Affiliations:
Institute of Computer Architecture (Prof. Dr.-Ing. W. Grass), Faculty of Mathematics and Informatics, University of Passau, Passau, Germany
Venue:
ARCS'05 Proceedings of the 18th international conference on Architecture of Computing Systems conference on Systems Aspects in Organic and Pervasive Computing
Year:
2005

Citing 6
Cited 0

Efficient on-line processor scheduling for a class of IRIS (increasing reward with increasing service) real-time tasks

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Operational rationality through compilation of anytime algorithms

Operational rationality through compilation of anytime algorithms
A scheduling algorithm for tasks described by time value function

Real-Time Systems
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Three Obstacles to Flexible Scheduling

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The basis for this work is a model for fine-granular flexibility of applications in two directions. These are the quality of computations on the one hand and their timeliness on the other hand. Dynamic scheduling of quality- and timeliness-flexible tasks on the same hardware platform as the application itself exhibits two obvious sources of trade-offs. The first one exists between the desired quality levels for individual tasks (depending on the processing time awarded to them) and the ability of these tasks to meet timing constraints. The second one can be found between the overall distribution of processing time between the application tasks and the scheduling algorithm. A high processing time allowance granted to the scheduler may leave too little resources for the actual application; however, a small scheduling allowance might prevent finding good schedules according to the given objective function. We use a control-theoretic approach to allow the scheduler to adapt to the current characteristics of the application in terms of workload and frequency and regularity of task releases automatically at run-time.