Performing work with asynchronous processors, message-delay-sensitive bounds

DOI10.1145/872035.872076MaRDI QIDQ2943763zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(9)

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

This page was built for publication: Performing work with asynchronous processors, message-delay-sensitive bounds

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