Conference
Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures
| Τίτλος: | Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures |
|---|---|
| Συγγραφείς: | Fraigniaud, Pierre, Nguyen, Minh, Paz, Ami |
| Συνεισφορές: | Pierre Fraigniaud and Minh Hang Nguyen and Ami Paz, Paz, Ami |
| Στοιχεία εκδότη: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. |
| Έτος έκδοσης: | 2024 |
| Θεματικοί όροι: | Consensus, crash failures, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Consensus set-agreement fault tolerance crash failures. Digital Object Identifier 10.4230/LIPIcs, crash failures Digital Object Identifier 10.4230/LIPIcs.DISC.2024.47, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Keywords and phrases Consensus set-agreement fault tolerance crash failures Digital Object Identifier 10.4230/LIPIcs.DISC.2024.47, [INFO] Computer Science [cs], crash failures. Digital Object Identifier 10.4230/LIPIcs, set-agreement, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Keywords and phrases Consensus, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], fault tolerance, Theory of computation → Distributed algorithms, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Consensus, ddc:004 |
| Περιγραφή: | Consensus is arguably the most studied problem in distributed computing as a whole, and particularly in distributed message-passing settings. Research on consensus has considered various failure types, memory constraints, and much more. Surprisingly, almost all of this work assumes that messages are passed in a complete network, i.e., each process has a direct link to every other process. Set agreement, a relaxed variant of consensus, has also been heavily studied in different settings, yet research on it has also been limited to complete networks. We address this situation by considering consensus and set agreement in general networks, i.e., that can have an arbitrary graph G as their communication graph. We focus on fault-prone networks, where up to t nodes may crash and irrevocably stop communicating, and present upper and lower bounds for such networks. We establish the following collection of results: - The consensus algorithm by [Castañeda et al., 2023] is optimal for all graphs, and not only for symmetric graphs. - This algorithm can be extended to a generic algorithm for k-set agreement, for every k ≥ 1. For k = 1, our generic algorithm coincides with the existing one for consensus. - All these algorithms can be extended to the case where the number t of failures exceeds the connectivity κ of the graph, while the existing consensus algorithm assumed that t < κ. |
| Τύπος εγγράφου: | Conference object Article |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| DOI: | 10.4230/lipics.disc.2024.47 |
| Σύνδεσμος πρόσβασης: | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.47 |
| Rights: | CC BY |
| Αριθμός Καταχώρησης: | edsair.dedup.wf.002..c34be8bb8287c774d1a629431dd7d5a9 |
| Βάση Δεδομένων: | OpenAIRE |
| DOI: | 10.4230/lipics.disc.2024.47 |
|---|