Performing work with asynchronous processors

DOI10.1145/872035.872076zbMATH Open1321.68086OpenAlexW2037087469MaRDI QIDQ2943763FDOQ2943763

Authors: Dariusz R. Kowalski, Alexander A. Schwarzmann 

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

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

Recommendations

• Performing work with asynchronous processors: Message-delay-sensitive bounds
• Principles of Distributed Systems
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Two lower bounds in asynchronous distributed computation
• Doing-it-all with bounded work and communication

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Ordered and delayed adversaries and how to work against them on a shared channel
• Accelerating by idling: how speculative delays improve performance of message-oriented systems
• Randomization helps to perform independent tasks reliably
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• Formal Modeling and Analysis of Timed Systems
• Principles of Distributed Systems
• Macropipelined execution of asynchronous processes competing for a limited number of transfer channels

This page was built for publication: Performing work with asynchronous processors

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