Improved upper bounds for online malleable job scheduling
From MaRDI portal
Publication:892840
DOI10.1007/s10951-014-0406-9zbMath1328.90053OpenAlexW2054626117MaRDI QIDQ892840
Nathaniel Kell, Jessen T. Havill
Publication date: 12 November 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0406-9
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Efficient approximation algorithms for scheduling moldable tasks ⋮ Online scheduling of moldable parallel tasks
Uses Software
Cites Work
- Improved online algorithms for parallel job scheduling and strip packing
- Scheduling parallel jobs to minimize the makespan
- On-line scheduling of parallel jobs in a list
- New algorithms for an ancient scheduling problem.
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- A note on online strip packing
- A 2.5 times optimal algorithm for packing in two dimensions
- On an on-line scheduling problem for parallel jobs
- New lower and upper bounds for on-line scheduling
- Online malleable job scheduling for \(m\leq 3\)
- Malleable scheduling for flows of jobs and applications to MapReduce
- Competitive online scheduling of perfectly malleable jobs with setup times
- Improved Lower Bound for Online Strip Packing
- Complexity of Scheduling Parallel Task Systems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Smart SMART Bounds for Weighted Response Time Scheduling
- On-line scheduling of parallel jobs
- Bounds on Multiprocessing Timing Anomalies
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved upper bounds for online malleable job scheduling
