Pages that link to "Item:Q3521923"
From MaRDI portal
The following pages link to Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (Q3521923):
Displayed 4 items.
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)