Online malleable job scheduling for \(m\leq 3\)

DOI10.1016/j.ipl.2010.10.010zbMath1260.68472OpenAlexW1524227203MaRDI QIDQ1944031

Jessen T. Havill

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

zbMATH Keywords

schedulingonline algorithmsparallel jobs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Improved upper bounds for online malleable job scheduling

Uses Software

• NAS Parallel Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Online malleable job scheduling for \(m\leq 3\)