Minimizing the stretch when scheduling flows of divisible requests
From MaRDI portal
Publication:835622
DOI10.1007/s10951-008-0078-4zbMath1168.90455OpenAlexW2101083305MaRDI QIDQ835622
Arnaud Legrand, Alan Su, Frédéric Vivien
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00789419/file/OnlineDivisible.pdf
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Minimizing the stretch when scheduling flows of divisible requests ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Resource allocation algorithms for virtualized service hosting platforms ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the stretch when scheduling flows of divisible requests
- The complexity of mean flow time scheduling problems with release times
- Structure preserving reductions among convex optimization problems
- Approximation algorithms for combinatorial problems
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Approximation algorithms for average stretch scheduling
- Approximation schemes for preemptive weighted flow time
- Open Shop Scheduling to Minimize Finish Time
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Parallelization of local BLAST service on workstation clusters
- Online Scheduling to Minimize Average Stretch
- Complexity of preemptive minsum scheduling on unrelated parallel machines
