Pages that link to "Item:Q1848358"
From MaRDI portal
The following pages link to An approximation algorithm for scheduling trees of malleable tasks (Q1848358):
Displaying 4 items.
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- Idle regulation in non-clairvoyant scheduling of parallel jobs (Q1003681) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- An optimal schedule for Gaussian elimination on an MIMD architecture (Q2570029) (← links)
