Pages that link to "Item:Q1884774"
From MaRDI portal
The following pages link to Non-clairvoyant scheduling for minimizing mean slowdown (Q1884774):
Displaying 12 items.
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Delay-bounded scheduling without delay! (Q832185) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- Minimizing the mean slowdown in a single-server queue (Q2146415) (← links)
- Multi-core real-time scheduling for generalized parallel task models (Q2251375) (← links)
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900) (← links)
- Minimizing the Worst Slowdown: Offline, Online (Q3392122) (← links)
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (Q5175957) (← links)
- Minimizing the mean slowdown in the M/G/1 queue (Q6063268) (← links)
- Graceful Degradation in Semi-Clairvoyant Scheduling (Q6099647) (← links)