The complexity of synchronous iterative do-all with crashes
From MaRDI portal
(Redirected from The complexity of synchronous iterative do-all with crashes)
The complexity of synchronous iterative do-all with crashes (scientific article; zbMATH DE number 2006650)
The complexity of synchronous iterative do-all with crashes (scientific article; zbMATH DE number 2006650)
Recommendations
Cited in
(9)- A robust randomized algorithm to perform independent tasks
- Performing work in broadcast networks
- Performing dynamically injected tasks on processes prone to crashes and restarts
- Bounding work and communication in robust cooperative computation
- Performing tasks on synchronous restartable message-passing processors
- The complexity of synchronous iterative do-all with crashes
- Doing-it-all with bounded work and communication
- Fully-adaptive algorithms for long-lived renaming
- Dynamic load balancing with group communication
This page was built for publication: The complexity of synchronous iterative do-all with crashes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436048)