Pages that link to "Item:Q3580981"

The following pages link to Multi-processor scheduling to minimize flow time with ε resource augmentation (Q3580981):

Displaying 14 items.

• Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
• Resource allocation optimization for quantitative service differentiation on server clusters (Q436881) (← links)
• Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
• Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
• Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
• Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
• The bell is ringing in speed-scaled multiprocessor scheduling (Q2441538) (← links)
• Greedy multiprocessor server scheduling (Q2466596) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
• The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
• Sleep Management on Multiple Machines for Energy and Flow Time (Q3012808) (← links)
• Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
• Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)