Pages that link to "Item:Q3069900"
From MaRDI portal
The following pages link to Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900):
Displaying 14 items.
- Greedy scheduling with custom-made objectives (Q613772) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor (Q693765) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Non-clairvoyant scheduling for minimizing mean slowdown (Q1884774) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency (Q2441506) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models (Q2896385) (← links)
- An Optimal Strategy for Online Non-uniform Length Order Scheduling (Q3511440) (← links)
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (Q5175957) (← links)
- Achievable Performance of Blind Policies in Heavy Traffic (Q5219677) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
