436 search results - page 6 / 88 » On the interconnection of message passing systems |
EDCC
2010
Springer
15 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
15 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...
89
Voted
SAC
2005
ACM
15 years 3 months ago
2005
ACM
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
PODC
1990
ACM
15 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
15 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...