The following pages link to (Q4335207):
Displaying 28 items.
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← 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)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- Scheduling parallel tasks with individual deadlines (Q1285585) (← links)
- Linear-Time approximation schemes for scheduling malleable parallel tasks (Q1348949) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← 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)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← 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)
