Distributed universality

DOI10.1007/S00453-015-0053-3zbMATH1351.68042OpenAlexW2914751085MaRDI QIDQ329296FDOQ329296

Authors Michel Raynal, Julien Stainer, Gadi Taubenfeld

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

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

Mathematics Subject Classification ID

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

Recommendations

• Distributed Universality
• Distributed universal constructions: a guided tour
• The RedBlue family of universal constructions
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• scientific article; zbMATH DE number 2013827

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Concurrent programming: algorithms, principles, and foundations.
• Contention-Sensitive Data Structures and Algorithms
• Distributed Universality
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Generalized Universality
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On interprocess communication. I: Basic formalism
• On the uncontended complexity of consensus
• Resilient consensus for infinitely many processes. (Extended abstract)
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• Software transactional memory
• The \(k\)-simultaneous consensus problem
• The complexity of obstruction-free implementations
• The topological structure of asynchronous computability
• The weakest failure detectors to boost obstruction-freedom
• Towards a universal construction for transaction-based multiprocess programs
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Cited in

(15)

• A practical distributed universal construction with unknown participants
• Distributed Universality
• 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
• scientific article; zbMATH DE number 2013827 (Why is no real title available?)
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• Differential universality
• The RedBlue family of universal constructions
• Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
• Distributed universal constructions: a guided tour
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• The RedBlue Adaptive Universal Constructions
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• Generalized Universality

This page was built for publication: Distributed universality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329296)