Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleNovember 2011
The disagreement power of an adversary
Distributed Computing (DICO), Volume 24, Issue 3-4Pages 137–147https://doi.org/10.1007/s00446-010-0122-4At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any ...
- ArticleSeptember 2009
The disagreement power of an adversary
At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any ...
- short-paperAugust 2009
The disagreement power of an adversary: extended abstract
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingPages 288–289https://doi.org/10.1145/1582716.1582769At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t+1. In other words, an adversary that can crash any subset ...
- ArticleJune 2009
Fault-Tolerant Consensus in Unknown and Anonymous Networks
ICDCS '09: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing SystemsPages 368–375https://doi.org/10.1109/ICDCS.2009.36This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures. We provide algorithms to emulate registers and solve ...
- ArticleMay 2009
Message-efficient omission-tolerant consensus with limited synchrony
IPDPS '09: Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed ProcessingPages 1–8https://doi.org/10.1109/IPDPS.2009.5160899We study the problem of consensus in the general omission failure model, i.e., in systems where processes can crash and omit messages while sending or receiving. This failure model is motivated from a smart card-based security framework in which certain ...
- ArticleSeptember 2008
The Weakest Failure Detector for Message Passing Set-Agreement
DISC '08: Proceedings of the 22nd international symposium on Distributed ComputingPages 109–120https://doi.org/10.1007/978-3-540-87779-0_8In the set-agreement problem, n processes seek to agree on at most n ï 1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure ...
- ArticleSeptember 2007
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms, failure detectors, and problem specifications, one of which is weakest failure ...