313 search results - page 21 / 63 » Computing synchronizer failure probabilities |
83
Voted
DSN
2006
IEEE
15 years 5 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
101
click to vote
FOCS
1993
IEEE
15 years 3 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
DICTA
2007
15 years 1 months ago
2007
We present an efficient method for mutual information (MI) computation between images (2D or 3D) for NVIDIA’s ‘compute unified device architecture’ (CUDA) compatible devic...
ICNP
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
ICDCS
2003
IEEE
15 years 5 months ago
2003
IEEE
In recent years there has been an increasing demand to build ”soft” real-time applications on top of asynchronous distributed systems. Designing and implementing such applicat...