Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
Journal of Computer and System Sciences
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Managing latency in embedded streaming applications under hard-real-time scheduling
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
| Hi-index | 0.00 |
The problem of feasibility analysis for asynchronous periodictask sets (i.e. where tasks can have an initial offset)is known to be co-NP-complete in the strong sense.A sufficient pseudo-polynomial test has been proposed byBaruah et al., which consists in analyzing the feasibilityof the corresponding synchronous task set (i.e. all offsetsare set equal to 0) for which a pseudo-polynomial test isknown. If the test gives a positive result, then the originalasynchronous task set is feasible; else, no definitive answercan be given. In many cases, this sufficient test is too pessimistic,i.e. it gives no response for many feasible task sets.In this paper, we present a new sufficient pseudo-polynomialtest for asynchronous periodic task sets. Ourtest reduces the pessimism by considering the value of theoffsets and obtaining a set of critical arrival patterns. Weshow, with a set of extensive simulations, that our test outperformsthe previous sufficient test.