Unifying synchronous and asynchronous message-passing models
From MaRDI portal
Publication:2790108
DOI10.1145/277697.277722zbMath1333.68061OpenAlexW2075601083MaRDI QIDQ2790108
Sergio Rajsbaum, Mark R. Tuttle, Maurice P. Herlihy
Publication date: 2 March 2016
Published in: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/277697.277722
Related Items (19)
An Equivariance Theorem with Applications to Renaming ⋮ Synchronous condition-based consensus ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Unnamed Item ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Tight bounds for \(k\)-set agreement with limited-scope failure detectors ⋮ Hundreds of impossibility results for distributed computing ⋮ A simple characterization of asynchronous computations ⋮ An equivariance theorem with applications to renaming ⋮ A Sound Foundation for the Topological Approach to Task Solvability ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ A topological treatment of early-deciding set-agreement ⋮ The Complexity of Early Deciding Set Agreement: How can Topology help? ⋮ An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems ⋮ A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring ⋮ Structured Derivation of Semi-Synchronous Algorithms ⋮ A bivalency proof of the lower bound for uniform consensus
This page was built for publication: Unifying synchronous and asynchronous message-passing models
