Distributed universality

DOI10.1007/S00453-015-0053-3zbMath1351.68042OpenAlexW2914751085MaRDI QIDQ329296

Gadi Taubenfeld, Julien Stainer, Michel Raynal

Publication date: 21 October 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0053-3

zbMATH Keywords

consensusuniversal constructionwait-freedom\(k\)-set agreement\(k\)-simultaneous consensusasynchronous read/write systemcontention-awarenesscrash failuresdistributed computabilityobstruction-freedomstate machine replication

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (5)

From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ The computational structure of progress conditions and shared objects ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results

Cites Work

• Unnamed Item
• Unnamed Item
• Towards a universal construction for transaction-based multiprocess programs
• On interprocess communication. I: Basic formalism
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• The weakest failure detectors to boost obstruction-freedom
• The \(k\)-simultaneous consensus problem
• Round-by-round fault detectors (extended abstract)
• Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
• Generalized Universality
• The topological structure of asynchronous computability
• Concurrent Programming: Algorithms, Principles, and Foundations
• The complexity of obstruction-free implementations
• Contention-Sensitive Data Structures and Algorithms
• Impossibility of distributed consensus with one faulty process
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Software transactional memory
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Distributed Universality
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• Distributed Computing
• Distributed Computing

This page was built for publication: Distributed universality