scientific article; zbMATH DE number 1003247
From MaRDI portal
Publication:4335207
Recommendations
- Scheduling malleable tasks on parallel processors to minimize the makespan
- scientific article; zbMATH DE number 1241387
- scientific article; zbMATH DE number 1947422
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- scientific article; zbMATH DE number 1305441
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Online scheduling of malleable parallel jobs
- scientific article; zbMATH DE number 838793
- Scheduling malleable tasks with precedence constraints
- On contiguous and non-contiguous parallel task scheduling
Cited in
(33)- Scheduling parallel tasks with individual deadlines
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Scheduling space-sharing for internet advertising
- Approximation algorithms for general parallel task scheduling
- Scheduling parallel jobs online with convex and concave parallelizability
- Malleable scheduling for flows of jobs and applications to MapReduce
- Online scheduling of moldable parallel tasks
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- Competitive online scheduling of perfectly malleable jobs with setup times
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- Scheduling malleable tasks with precedence constraints
- scientific article; zbMATH DE number 1241387 (Why is no real title available?)
- scientific article; zbMATH DE number 1305441 (Why is no real title available?)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
- An effective approximation algorithm for the malleable parallel task scheduling problem
- scientific article; zbMATH DE number 1863269 (Why is no real title available?)
- Closing the Gap for Pseudo-Polynomial Strip Packing
- A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Malleable scheduling beyond identical machines
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Efficient approximation algorithms for scheduling moldable tasks
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- Scheduling parallel tasks with individual deadlines
- Algorithms for scheduling deadline-sensitive malleable tasks
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
- Maximizing the throughput of parallel jobs on hypercubes
- On-line scheduling mesh jobs with dependencies
- Scheduling parallel jobs to minimize the makespan
- Scheduling semi-malleable jobs to minimize mean flow time
- On contiguous and non-contiguous parallel task scheduling
- On-line scheduling of parallel jobs in a list
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335207)
