Task period selection and schedulability in real-time systems
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 188-198
- https://doi.org/10.1109/real.1998.739745
Abstract
In many real time applications, especially those involving computer controlled systems, the application tasks often have a maximal acceptable latency, and small latency is preferred to large. The interaction between choosing task periods to meet the individual latency requirements and scheduling the resulting task set was investigated by D. Seto et al. (1996) using dynamic priority scheduling methods. We present algorithms based on static priority scheduling methods to determine optimal periods for each task in the task set. The solution to the period selection problem optimizes a system wide performance measure, subject to meeting the maximal acceptable latency requirements of each task. The paper also contributes to a new aspect of rate monotonic scheduling, the optimal design of task periods in connection with application related timing specifications and task set schedulability.Keywords
This publication has 3 references indexed in Scilit:
- On task schedulability in real-time control systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Assignment and scheduling communicating periodic tasks in distributed real-time systemsIEEE Transactions on Software Engineering, 1997
- Guaranteeing end-to-end timing constraints by calibrating intermediate processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994