Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
From MaRDI portal
Cites work
- A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Approximating the non-contiguous multiple organization packing problem
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Approximation algorithms for scheduling parallel jobs
- Assigning and scheduling generalized malleable jobs under subadditive or submodular processing speeds
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Complexity of Scheduling Parallel Task Systems
- Efficient approximation algorithms for scheduling moldable tasks
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters
- Linear time algorithms for multiple cluster scheduling and multiple strip packing
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Malleable scheduling beyond identical machines
- Optimal workforce assignment to operations of a paced assembly line
- Parallel Processing and Applied Mathematics
- Scheduling for parallel processing
- Scheduling parallel jobs on heterogeneous platforms
- Scheduling parallel jobs to minimize the makespan
- Task Scheduling on Adaptive Multi-Core
This page was built for publication: Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974836)
