Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Off-Line Computation of Real-Time Schedules Using Petri Nets
Discrete Event Dynamic Systems
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
A Realistic Model of Real-Time Systems for Efficient Scheduling
SEW '09 Proceedings of the 2009 33rd Annual IEEE Software Engineering Workshop
Linear transformation of conditional real-time tasks
Proceedings of the 20th International Conference on Real-Time and Network Systems
| Hi-index | 0.00 |
We present a new approach of validation for critical real-time applications: the tree based approach. This approach explicitly takes the conditional statements and the semantics contained in the tests into account. We substitute sequential schedules by scheduling trees. We thus add new scheduling possibilities to those provided by the sequential approach. We then give conditions which make the two approaches equivalent (i.e. give same results for schedulability).