317 search results - page 4 / 64 » Snap-Stabilization in Message-Passing Systems |
EDCC
2010
Springer
14 years 2 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
SEFM
2008
IEEE
14 years 4 months ago
2008
IEEE
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
PODC
1990
ACM
14 years 1 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end compu...