Pages that link to "Item:Q1331960"
From MaRDI portal
The following pages link to Dynamic scheduling on parallel machines (Q1331960):
Displaying 15 items.
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← 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)
- Design and performance of a scheduling framework for resizable parallel applications (Q991070) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- On an on-line scheduling problem for parallel jobs (Q1603586) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN (Q3074794) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- Scheduling task-tree with additive scales on parallel/distributed machines (Q6085760) (← links)
