329 search results - page 42 / 66 » Asynchronous Communication in Process Algebra |
TRIDENTCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
SIAMCOMP
2010
13 years 2 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
EDCC
2010
Springer
14 years 14 days 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...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
WOSP
2004
ACM
14 years 1 months ago
2004
ACM
In this paper we describe our experience in performance analysis of the software architecture of the NICE case study which is responsible for providing several secure communicatio...