Sciweavers

56 search results - page 5 / 12
» Atomic Broadcast in Asynchronous Crash-Recovery Distributed ...
Sort
View
WDAG
2004
Springer
103views Algorithms» more  WDAG 2004»
14 years 21 days ago
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...
James Aspnes, Faith Ellen Fich, Eric Ruppert
FTRTFT
1998
Springer
13 years 11 months ago
Predictability in Critical Systems
Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial...
Gérard Le Lann
PODC
2011
ACM
12 years 10 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
PODC
2009
ACM
14 years 8 months ago
Dynamic atomic storage without consensus
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...
Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkh...
DSN
2006
IEEE
14 years 1 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri