Simulations and reductions for colorless tasks

DOI10.1145/2332432.2332483zbMATH Open1301.68122OpenAlexW1975658854MaRDI QIDQ2933802FDOQ2933802

Authors: Sergio Rajsbaum, Maurice Herlihy 

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2332432.2332483

Recommendations

• The BG distributed simulation algorithm
• The multiplicative power of consensus numbers
• The extended BG-simulation and the characterization of t-resiliency
• Distributed computing through combinatorial topology
• From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement

zbMATH Keywords

simulationsdistributed computingfault-tolerancewait-freecolorless tasks

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cited In (8)

• Power and limits of distributed computing shared memory models
• Collapsibility of read/write models using discrete Morse theory
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• The topology of local computing in networks
• The topology of distributed adversaries
• Title not available (Why is that?)
• Untangling Partial Agreement: Iterated x-consensus Simulations

This page was built for publication: Simulations and reductions for colorless tasks

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