Online malleable job scheduling for \(m\leq 3\)
From MaRDI portal
Publication:1944031
DOI10.1016/j.ipl.2010.10.010zbMath1260.68472MaRDI QIDQ1944031
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.010
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W27: Online algorithms; streaming algorithms
Related Items
Improved upper bounds for online malleable job scheduling, Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
Uses Software
Cites Work
- Improved online algorithms for parallel job scheduling and strip packing
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- A note on online strip packing
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Competitive online scheduling of perfectly malleable jobs with setup times
- On-line scheduling of parallel jobs
- Unnamed Item
- Unnamed Item