Closed schedulers: a novel technique for analyzing asynchronous protocols

DOI10.1007/BF02242738zbMath1448.68143OpenAlexW2084155082MaRDI QIDQ5136996

Shlomo Moran, Ronit Lubitch

Publication date: 30 November 2020

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

Full work available at URL: https://doi.org/10.1007/bf02242738

zbMATH Keywords

asynchronous protocolsadmissible runsclosed schedulers

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Hundreds of impossibility results for distributed computing ⋮ MinMax algorithms for stabilizing consensus ⋮ Computing in totally anonymous asynchronous shared memory systems

Cites Work

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Renaming in an asynchronous environment
• A combinatorial characterization of the distributed 1-solvable tasks
• Impossibility of distributed consensus with one faulty process
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Wait-free k-set agreement is impossible
• The asynchronous computability theorem for t-resilient tasks
• Unnamed Item

This page was built for publication: Closed schedulers: a novel technique for analyzing asynchronous protocols