Distributed computability in Byzantine asynchronous systems
| Autor: | Christine Tasson, Hammurabi Mendes, Maurice Herlihy |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
FOS: Computer and information sciences
D.1.3 Relation (database) Computer science Computability Distributed computing Structure (category theory) Combinatorial topology F.1.2 Task (computing) Quantum Byzantine agreement Computer Science - Distributed Parallel and Cluster Computing Asynchronous communication Distributed Parallel and Cluster Computing (cs.DC) Byzantine fault tolerance Computer Science::Distributed Parallel and Cluster Computing |
| Zdroj: | STOC |
| DOI: | 10.1145/2591796.2591853 |
| Popis: | In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give the first theorem with necessary and sufficient conditions to solve arbitrary tasks in asynchronous Byzantine systems where an adversary chooses faulty processes. In our adversarial formulation, outputs of non-faulty processes are constrained in terms of inputs of non-faulty processes only. For colorless tasks, an important subclass of distributed problems, the general result reduces to an elegant model that effectively captures the relation between the number of processes, the number of failures, as well as the topological structure of the task's simplicial complexes. Will appear at the Proceedings of the 46th Annual Symposium on the Theory of Computing, STOC 2014 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|