Applications of model checking at Honeywell Laboratories
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Adaptive feedback scheduling of incremental and design-to-time tasks
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Using an architecture description language for quantitative analysis of real-time systems
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Formalizing Software Architectures for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Formal Modeling and Analysis of Advanced Scheduling Features in an Avionics RTOS
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Embedded Systems Design
| Hi-index | 0.00 |
This paper presents an algorithm and its run-time performance for scheduling periodic incremental and design-to-time processes. The algorithm is based on the "slack stealer" which dynamically answers the question "how much execution time is available prior to a deadline" when all periodic processes are scheduled using Rate Monotonic Scheduling. An incremental process asks how much execution time is available after the baseline component has completed and prior to the execution of a process increment. A design-to-time process asks how much execution time is available before the process begins execution and selects a version which gives the greatest precision in the available time. For both incremental and design-to-time processes, a minimum amount of time is statically reserved so that an acceptable but suboptimal solution will always be calculated. We identify and propose solution for the practical problem of supporting criticalities when scheduling slack and analyze the run-time overheads of this algorithm. The analysis is applied to two real-world data sets. In certain cases, the execution time of this algorithm is found to be efficient.