Improved upper bounds for online malleable job scheduling
DOI10.1007/S10951-014-0406-9zbMATH Open1328.90053OpenAlexW2054626117MaRDI QIDQ892840FDOQ892840
Authors: 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
Recommendations
- Online malleable job scheduling for \(m\leq 3\)
- Online scheduling of malleable parallel jobs
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Competitive online scheduling of perfectly malleable jobs with setup times
- Improved randomized online scheduling of intervals and jobs
- Improved Bounds for the Online Scheduling Problem
- New lower and upper bounds for on-line scheduling
- Online scheduling of bounded length jobs to maximize throughput
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- Title not available (Why is that?)
- Orthogonal Packings in Two Dimensions
- New algorithms for an ancient scheduling problem.
- A note on online strip packing
- A 2.5 times optimal algorithm for packing in two dimensions
- Scheduling parallel jobs to minimize the makespan
- Improved Lower Bound for Online Strip Packing
- Improved online algorithms for parallel job scheduling and strip packing
- New lower and upper bounds for on-line scheduling
- Complexity of Scheduling Parallel Task Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Competitive online scheduling of perfectly malleable jobs with setup times
- On an on-line scheduling problem for parallel jobs
- On-line scheduling of parallel jobs
- On-line scheduling of parallel jobs in a list
- Smart SMART Bounds for Weighted Response Time Scheduling
- Online scheduling of malleable parallel jobs
- Online malleable job scheduling for \(m\leq 3\)
- Malleable scheduling for flows of jobs and applications to MapReduce
- Online scheduling of malleable parallel jobs with setup times on two identical machines
Cited In (7)
- Improved competitive algorithms for online scheduling with partial job values
- Online scheduling of malleable parallel jobs
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Online scheduling of moldable parallel tasks
- Competitive online scheduling of perfectly malleable jobs with setup times
- Online malleable job scheduling for \(m\leq 3\)
- Efficient approximation algorithms for scheduling moldable tasks
Uses Software
This page was built for publication: Improved upper bounds for online malleable job scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892840)
