G. Chockler and D. Malkhi. Active disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), july 2002. 20 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Initial Roadmap on Middleware For Composable and Dynamically.. - Midas (2003) (Correct)
.... Computing Base) of the EU MAFTIA project [CVN02] Implementations of semi accurate failure detectors [AT00] Abstractions of a system tiers from which processes can leverage agreement, such as [BMT02, PSOC02] and shared data objects that provide safety decision making among arbitrary clients [CM02, Mal02]. Performance enhancing mechanisms and paradigms: Several research groups focused in the last decade on replication and fault tolerance, and are shifting their focus toward scalable services that tolerate benign failures as well as survive malicious penetrations. There is a growing understanding ....
G. Chockler, D. Malkhi. Active Disk Paxos with Infinitely Many Processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, August 2002.
Early-Delivery Dynamic Atomic Broadcast (Extended Abstract) - Bar-Joseph, al. (Correct)
....previous paper [2] we considered a simpler problem of dynamic totally ordered broadcast without all or nothing semantics. For this problem, the linear lower bound does not apply, and we exhibited an algorithm that solves the problem in constant time even in the presence of failures. Recent work [17, 5] considers di#erent services, including (one shot) consensus, for infinitely many processes in asynchronous shared memory models. Chockler and Malkhi [5] present a consensus algorithm for infinitely many processes using a static set of active disks, a minority of which can fail. This di#ers from ....
....bound does not apply, and we exhibited an algorithm that solves the problem in constant time even in the presence of failures. Recent work [17, 5] considers di#erent services, including (one shot) consensus, for infinitely many processes in asynchronous shared memory models. Chockler and Malkhi [5] present a consensus algorithm for infinitely many processes using a static set of active disks, a minority of which can fail. This di#ers from the model considered here, as in our model all system components may be ephemeral. Merritt and Taubenfeld [17] study consensus under di#erent concurrency ....
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In 21st ACM Symp. on Prin. of Dist. Comp. (PODC), July 2002. To appear.
From Byzantine Agreement to Practical Survivability - Malkhi (2002) (1 citation) Self-citation (Malkhi) (Correct)
No context found.
G. Chockler, D. Malkhi. Active disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), August 2002. To appear.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) Self-citation (Chockler Malkhi) (Correct)
No context found.
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), 2002.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) Self-citation (Chockler Malkhi) (Correct)
No context found.
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), 2002.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) Self-citation (Chockler Malkhi) (Correct)
No context found.
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), 2002.
Paxos At War - Zielinski (2004) (2 citations) (Correct)
No context found.
G. Chockler and D. Malkhi. Active disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), july 2002. 20
An Architecture for Dynamic Scalable Self-Managed Distributed.. - Anceaume, al. (2004) (Correct)
No context found.
G. Chockler and D. Malkhi. Active disk paxos with infinitely many processes. In Proc. of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC'02), pages 78--87, 2002.
Early-Delivery Dynamic Atomic Broadcast - Ziv Bar-Joseph Idit (Correct)
No context found.
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In 21st ACM Symposium on Principles of Distributed Computing (PODC), July 2002. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC