Sciweavers

ECRTS
2004
IEEE
14 years 4 months ago
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Rodolfo Pellizzoni, Giuseppe Lipari