Pages that link to "Item:Q1348949"
From MaRDI portal
The following pages link to Linear-Time approximation schemes for scheduling malleable parallel tasks (Q1348949):
Displaying 27 items.
- Resource loading with time windows (Q319369) (← links)
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Scheduling malleable tasks on parallel processors to minimize the makespan (Q596452) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Scheduling parallel tasks with individual deadlines (Q1285585) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Scheduling trees of malleable tasks for sparse linear algebra (Q1693050) (← links)
- An approximation algorithm for scheduling trees of malleable tasks (Q1848358) (← links)
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme (Q1879360) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
- (Q4335207) (← links)
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701) (← links)
- (Q5875469) (← links)
- Approximation and Online Algorithms (Q5896925) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Efficient approximation algorithms for scheduling moldable tasks (Q6113310) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
- Scheduling parallel tasks with individual deadlines (Q6487963) (← links)
- Algorithms for scheduling deadline-sensitive malleable tasks (Q6559486) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)