Algorithms for scheduling deadline-sensitive malleable tasks
From MaRDI portal
Publication:6559486
Recommendations
Cites work
- scientific article; zbMATH DE number 1196650 (Why is no real title available?)
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 793950 (Why is no real title available?)
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A truthful mechanism for value-based scheduling in cloud computing
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Efficient approximation algorithms for scheduling moldable tasks
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Malleable scheduling for flows of jobs and applications to MapReduce
- Some simple scheduling algorithms
- The design of approximation algorithms
This page was built for publication: Algorithms for scheduling deadline-sensitive malleable tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559486)