Sciweavers

PODC
2011
ACM
13 years 3 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...
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
14 years 6 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro