Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Off-Line Computation of Real-Time Schedules Using Petri Nets
Discrete Event Dynamic Systems
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
On the Complexity of Scheduling Conditional Real-Time Code
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
Tree scheduling versus sequential scheduling
Proceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety
A Realistic Model of Real-Time Systems for Efficient Scheduling
SEW '09 Proceedings of the 2009 33rd Annual IEEE Software Engineering Workshop
| Hi-index | 0.00 |
The classical schedulability theory generally considers linear tasks. Scheduling conditional task set is much more intricate. We thus propose a transformation of a conditional task set into a linear task set on which the traditional linear schedulability tools can be used. We prove that this transformation is consistent in the sense that a positive linear schedulability diagnosis is not misleading: if the linear task set is feasible, so was the conditional task set. But the converse does not hold.