Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
From MaRDI portal
Recommendations
Cited in
(14)- A robust randomized algorithm to perform independent tasks
- Cooperative computing with fragmentable and mergeable groups
- Distributed scheduling for disconnected cooperation
- Performing work in broadcast networks
- scientific article; zbMATH DE number 1696670 (Why is no real title available?)
- Performing dynamically injected tasks on processes prone to crashes and restarts
- scientific article; zbMATH DE number 1820019 (Why is no real title available?)
- Work-competitive scheduling for cooperative computing with dynamic groups
- scientific article; zbMATH DE number 1256740 (Why is no real title available?)
- Work-competitive scheduling on task dependency graphs
- Dealing with undependable workers in decentralized network supercomputing
- Doing-it-all with bounded work and communication
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- Dynamic load balancing with group communication
This page was built for publication: Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317178)