Online scheduling of moldable parallel tasks
From MaRDI portal
Publication:2317140
DOI10.1007/s10951-018-0556-2zbMath1420.90027OpenAlexW2787020575MaRDI QIDQ2317140
Deshi Ye, Danny Z. Chen, Guo-Chuan Zhang
Publication date: 8 August 2019
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-018-0556-2
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound for online strip packing
- Improved upper bounds for online malleable job scheduling
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- A note on online strip packing
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Competitive online scheduling of perfectly malleable jobs with setup times
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Shelf Algorithms for Two-Dimensional Packing Problems
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation Algorithms for Scheduling Parallel Jobs
- Online Algorithm for Parallel Job Scheduling and Strip Packing
