Pages that link to "Item:Q2304112"
From MaRDI portal
The following pages link to Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112):
Displaying 7 items.
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Scheduling MapReduce jobs under multi-round precedences (Q1693215) (← links)
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Algorithms for scheduling deadline-sensitive malleable tasks (Q6559486) (← links)