Online scheduling of moldable parallel tasks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- A new lower bound for online strip packing
- A note on online strip packing
- Approximation algorithms for scheduling parallel jobs
- Competitive online scheduling of perfectly malleable jobs with setup times
- Improved upper bounds for online malleable job scheduling
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online scheduling of malleable parallel jobs
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(10)- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- Using moldability to improve the performance of supercomputer jobs
- scientific article; zbMATH DE number 1955826 (Why is no real title available?)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
- Scheduling parallelizable jobs online to maximize throughput
- On-line scheduling mesh jobs with dependencies
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Competitive online scheduling of perfectly malleable jobs with setup times
- 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
This page was built for publication: Online scheduling of moldable parallel tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317140)