Work-competitive scheduling for cooperative computing with dynamic groups
From MaRDI portal
Recommendations
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Work-competitive scheduling on task dependency graphs
- Task scheduling algorithms in cooperative design
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Group Scheduling with Two Competing Agents on a Single Machine
- Cooperative system design in scheduling
- Dynamic task assignment for throughput maximization with worksharing
- Scheduling with a constraint based cooperative solver
- Dynamic scheduling of parallel computations
Cited in
(11)- The Do-All problem with Byzantine processor failures
- Cooperative computing with fragmentable and mergeable groups
- Distributed scheduling for disconnected cooperation
- 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?)
- scientific article; zbMATH DE number 1256740 (Why is no real title available?)
- Randomization helps to perform independent tasks reliably
- Work-competitive scheduling on task dependency graphs
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- 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 Q3581245)