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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schwarzfischer, T.: Quality and Utility - On the Use of Time-Value Functions to Integrate Quality and Timeliness Flexible Aspects in a Dynamic Real-Time Scheduling Environment. PhD thesis, Fakultät für Mathematik und Informatik, Universität Passau (2005)
Locke, C.: Best-Effort Decision Making for Real-Time Scheduling. PhD thesis, Carnegie-Mellon University (1986)
Jensen, E., Locke, C., Tokuda, H.: A time-driven scheduling model for real-time operating systems. In: Proceedings of the IEEE Real-Time Systems Symposium (1985)
Aldarmi, S., Burns, A.: Dynamic value-density for scheduling real-time systems. In: Proceedings of the 11th Euromicro Conference on Real-Time Systems (1999)
Mossé, D., Pollack, M., Ronén, Y.: Value-density algorithms to handle transient overloads in scheduling. In: Proceedings of the 11th Euromicro Conference on Real-Time Systems (1999)
Morton, T., Pentico, D.: Heuristic Scheduling Systems. John Wiley, Chichester (1993)
Tokuda, H., Wendorf, J., Wang, H.: Implementation of a time-driven scheduler for real-time operating systems. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 271–280 (1987)
Chen, K., Muhlethaler, P.: A scheduling algorithm for tasks described by time value functions. Real-Time Systems 10, 293–312 (1996)
Dean, T., Boddy, M.: An analysis of time-dependent planning. In: Proceedings of the Seventh National Conference on Artificial Intelligence, pp. 49–54 (1988)
Zilberstein, S.: Operational Rationality through Compilation of Anytime Algorithms. PhD thesis, University of California at Berkeley (1993)
Horvitz, E.: Reasoning about beliefs and actions under computational resource constraints. In: Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence (1987)
Bernat, G., Burns, A.: Three obstacles to flexible scheduling. In: Proceedings of the 13th Euromicro Conference on Real-Time Systems (2001)
Dey, J., Kurose, J., Towsley, D., Krishna, C., Girkar, M.: Efficient on-line processor scheduling for a class of IRIS (inreasing reward with increasing service) real-time tasks. In: Proceedings of 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 217–228 (1993)
Lu, C., Stankovic, J., Tao, G., Son, S.: Design and evaluation of a feedback control EDF scheduling algorithm. In: Proceedings of the IEEE Real-Time Systems Symposium (1999)
Schwarzfischer, T.: Quality and utility - towards a generalization of deadline and anytime scheduling. In: Proceedings of the 13th International Conference on Automated Planning and Scheduling (2003)
Schwarzfischer, T.: Using value dependencies to schedule complex soft-real-time applications with precedence constraints. In: Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA (2003)
Schwarzfischer, T.: Application of simulated annealing to anytime scheduling problems with additional timing constraints. In: Proceedings of the 5th Metaheuristics International Conference (MIC 2003) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwarzfischer, T. (2005). Adaptivity for Quality and Timeliness Flexible Real-Time Systems. In: Beigl, M., Lukowicz, P. (eds) Systems Aspects in Organic and Pervasive Computing - ARCS 2005. ARCS 2005. Lecture Notes in Computer Science, vol 3432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31967-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31967-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25273-3
Online ISBN: 978-3-540-31967-2
eBook Packages: Computer ScienceComputer Science (R0)