Pages that link to "Item:Q5470701"
From MaRDI portal
The following pages link to General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701):
Displaying 21 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- A relation between multiprocessor scheduling and linear programming (Q1267552) (← links)
- A two-pass scheduling algorithm for parallel programs (Q1334867) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- Real-time scheduling of linear speedup parallel tasks (Q1350756) (← links)
- Scheduling multiple variant programs under hard real-time constraints (Q1590048) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Scheduling parallel tasks with sequential heads and tails (Q1808180) (← links)
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme (Q1879360) (← links)
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach (Q2251376) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- General multiprocessor task scheduling (Q4238573) (← links)
- Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605) (← links)
- Applying Cilk in Provably Efficient Task Scheduling (Q4950864) (← links)
- Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times (Q5943828) (← links)
- Scheduling independent multiprocessor tasks (Q5957575) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)
- Scheduling independent multiprocessor tasks (Q6483867) (← links)
