5 search results - page 1 / 1 » Emulating Shared-Memory Do-All Algorithms in Asynchronous Me... |
OPODIS
2003
13 years 6 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
PODC
1990
ACM
13 years 8 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...
SIAMCOMP
2010
12 years 11 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...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...