Distributed universality

DOI10.1007/S00453-015-0053-3zbMATH Open1351.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

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

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)

Cites Work

• Title not available (Why is that?)
• On interprocess communication. I: Basic formalism
• Impossibility of distributed consensus with one faulty process
• 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), unifying synchrony and asynchrony
• 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
• Towards a universal construction for transaction-based multiprocess programs
• Title not available (Why is that?)
• 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
• Resilient consensus for infinitely many processes. (Extended abstract)
• On the uncontended complexity of consensus

Cited In (10)

• Differential universality
• Generalized Universality
• Title not available (Why is that?)
• Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Distributed Universality
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• The RedBlue Adaptive Universal Constructions
• The computational structure of progress conditions and shared objects
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results

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)