The following pages link to (Q4813028):
Displaying 10 items.
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems (Q543079) (← links)
- Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
- Contention-free communication scheduling for array redistribution (Q1575628) (← links)
- Approximating scheduling for multimedia applications under overload conditions (Q1606211) (← links)
- Improving communication scheduling for array redistribution (Q1779725) (← links)
- An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors (Q1900934) (← links)
- A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658) (← links)
- A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431) (← links)
- (Q4209155) (← links)
- (Q4737347) (← links)
