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

DOI10.1016/J.IC.2005.08.002MaRDI QIDQ2581537zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asynchronous algorithmsDo-All

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Performing work with asynchronous processors, message-delay-sensitive bounds
• Emulating shared-memory do-all algorithms in asynchronous message-passing 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

Cites work

• Algorithms for the Certified Write-All Problem
• Bounding work and communication in robust cooperative computation
• Constructions of permutation arrays for certain scheduling cost measures
• Efficient gossip and robust distributed computation
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• Parallel Algorithms with Processor Failures and Delays
• Performing tasks on synchronous restartable message-passing processors
• Performing Work Efficiently in the Presence of Faults
• RAMBO: A reconfigurable atomic memory service for dynamic networks
• Sharing memory robustly in message-passing systems
• The do-all problem in broadcast networks
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Time-optimal message-efficient work performance in the presence of faults

Cited in

(9)

• A robust randomized algorithm to perform independent tasks
• Macropipelined execution of asynchronous processes competing for a limited number of transfer channels
• Performing work in broadcast networks
• Performing work with asynchronous processors, message-delay-sensitive bounds
• A faster-than relation for asynchronous processes
• Accelerating by idling: how speculative delays improve performance of message-oriented systems
• Doing-it-all with bounded work and communication
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems

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)