8780 search results - page 8 / 1756 » On the Feasibility of Consistent Computations |
ACMSE
2006
ACM
15 years 7 months ago
2006
ACM
SOFTWARE
1998
15 years 1 months ago
1998
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
159
Voted
PAM
2011
Springer
14 years 4 months ago
2011
Springer
128
click to vote
ECRTS
2004
IEEE
15 years 5 months ago
2004
IEEE
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...