Browsing by Subject "Fault-tolerance"
Now showing items 1-8 of 8
-
Conference Object
Analyzing the number of slow reads for semifast atomic read/write register implementations
(2009)Developing fast implementations of atomic read/write registers in the message passing model is among the fundamental problems in distributed computing. Typical implementations require two communication round trips for read ...
-
Article
The complexity of synchronous iterative Do-All with crashes
(2004)The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
-
Conference Object
Confidential gossip
(2011)Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing ...
-
Conference Object
Distributed Cooperation and Adversity: Complexity Trade-Offs
(2003)The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...
-
Article
Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency
(2007)The abstract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iteratively to construct efficient simulations ...
-
Conference Object
Fault-tolerant semi fast implementations of atomic read/write registers
(2006)This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
-
Article
Fault-tolerant semifast implementations of atomic read/write registers
(2009)This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
-
Conference Object
Self-stabilizing reconfiguration
(Association for Computing Machinery, Inc, 2016)