The topology of distributed adversaries

DOI10.1007/S00446-013-0189-9zbMATH Open1285.68013OpenAlexW1976163479MaRDI QIDQ360277FDOQ360277

Authors: Sergio Rajsbaum, Maurice Herlihy 

Publication date: 26 August 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-013-0189-9

Recommendations

• Concurrent computing and shellable complexes
• The topology of shared-memory adversaries
• An asynchronous computability theorem for fair adversaries
• The topological structure of asynchronous computability
• Topology of the view complex

zbMATH Keywords

combinatorial topologydistributed computabilitycolorless tasks

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Renaming in an asynchronous environment
• Title not available (Why is that?)
• Combinatorial algebraic topology
• On interprocess communication. I: Basic formalism
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Authenticated Algorithms for Byzantine Agreement
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• Knowledge and common knowledge in a distributed environment
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The topological structure of asynchronous computability
• Title not available (Why is that?)
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• A lower bound for the time to assure interactive consistency
• A layered analysis of consensus
• Unifying synchronous and asynchronous message-passing models
• An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
• An Equivariance Theorem with Applications to Renaming
• Simulations and reductions for colorless tasks
• Fast set agreement in the presence of timing uncertainty
• Tight bounds for k -set agreement
• Structured Derivation of Semi-Synchronous Algorithms
• A combinatorial characterization of the distributed 1-solvable tasks
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Concurrent computing and shellable complexes
• Three-Processor Tasks Are Undecidable
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Algebraic spans
• Title not available (Why is that?)
• Title not available (Why is that?)
• The topology of shared-memory adversaries
• Set consensus using arbitrary objects (preliminary version)
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming
• The disagreement power of an adversary

Cited In (7)

• Concurrent computing and shellable complexes
• Collapsibility of read/write models using discrete Morse theory
• Algebraic topology and distributed computing
• Pseudospheres: combinatorics, topology and distributed systems
• The computational structure of progress conditions and shared objects
• Untangling Partial Agreement: Iterated x-consensus Simulations
• The solvability of consensus in iterated models extended with safe-consensus

This page was built for publication: The topology of distributed adversaries

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