Emulating shared-memory do-all algorithms in asynchronous message-passing systems
DOI10.1016/J.JPDC.2009.12.002zbMATH Open1233.68064OpenAlexW2037854601MaRDI QIDQ666160FDOQ666160
Authors: Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Schwarzmann 
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.12.002
Recommendations
- Principles of Distributed Systems
- scientific article; zbMATH DE number 177544
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- Sharing memory robustly in message-passing systems
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- scientific article; zbMATH DE number 1844536
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- 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
- Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
- Cooperative computing with fragmentable and mergeable groups
- Performing Work Efficiently in the Presence of Faults
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Time-optimal message-efficient work performance in the presence of faults
- Dynamic load balancing with group communication
- A robust randomized algorithm to perform independent tasks
- Efficient gossip and robust distributed computation
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Title not available (Why is that?)
- Parallel Algorithms with Processor Failures and Delays
- Distributed scheduling for disconnected cooperation
- Principles of Distributed Systems
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
Cited In (5)
- Efficient and robust sharing of memory in message-passing systems (extended abstract)
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Principles of Distributed Systems
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
This page was built for publication: Emulating shared-memory do-all algorithms in asynchronous message-passing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666160)
