Pages that link to "Item:Q1607020"
From MaRDI portal
The following pages link to An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020):
Displaying 8 items.
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (Q917300) (← links)
- Preemptive scheduling of independent jobs on a hypercube (Q1111373) (← links)
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension (Q1391539) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems (Q2633602) (← links)
- A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES (Q3634187) (← links)