Performing work with asynchronous processors: Message-delay-sensitive bounds

DOI10.1016/J.IC.2005.08.002zbMATH Open1083.68004OpenAlexW3215606906MaRDI QIDQ2581537FDOQ2581537

Authors: Dariusz R. Kowalski, Alexander A. Schwarzmann 

Publication date: 10 January 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.08.002

Recommendations

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

zbMATH Keywords

asynchronous algorithmsDo-All

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sharing memory robustly in message-passing systems
• Algorithms for the Certified Write-All Problem
• Performing Work Efficiently in the Presence of Faults
• Title not available (Why is that?)
• Time-optimal message-efficient work performance in the presence of faults
• Title not available (Why is that?)
• Performing tasks on synchronous restartable message-passing processors
• Parallel Algorithms with Processor Failures and Delays
• Principles of Distributed Systems
• Constructions of permutation arrays for certain scheduling cost measures
• Efficient gossip and robust distributed computation
• The do-all problem in broadcast networks

Cited In (8)

• A robust randomized algorithm to perform independent tasks
• Title not available (Why is that?)
• Accelerating by idling: how speculative delays improve performance of message-oriented systems
• Performing work in broadcast networks
• Principles of Distributed Systems
• Macropipelined execution of asynchronous processes competing for a limited number of transfer channels
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Doing-it-all with bounded work and communication

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 Q2581537)