279 search results - page 31 / 56 » Low Overhead Parallel Schedules for Task Graphs |
153
click to vote
PDP
2002
IEEE
15 years 10 months ago
2002
IEEE
Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature,...
160
click to vote
CJ
1999
15 years 5 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
144
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
204
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
129
click to vote
HPDC
2008
IEEE
15 years 12 months ago
2008
IEEE
This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizi...