3 search results - page 1 / 1 » Meeting the deadline: on the complexity of fault-tolerant co... |
PODC
2010
ACM
13 years 3 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
RTCSA
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...