The topology of shared-memory adversaries
From MaRDI portal
Publication:5176193
DOI10.1145/1835698.1835724zbMath1315.68028OpenAlexW2006675966MaRDI QIDQ5176193
Sergio Rajsbaum, Maurice P. Herlihy
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835724
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Combinatorial aspects of simplicial complexes (05E45)
Related Items (8)
An Equivariance Theorem with Applications to Renaming ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ An equivariance theorem with applications to renaming ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model
Uses Software
Cites Work
This page was built for publication: The topology of shared-memory adversaries
