The following pages link to Scheduling in the dark (Q5918075):
Displaying 12 items.
- Energy-efficient multiprocessor scheduling for flow time and makespan (Q401300) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor (Q693765) (← links)
- A note on on-line broadcast scheduling with deadlines (Q976075) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency (Q2441506) (← links)