279 search results - page 9 / 56 » Low Overhead Parallel Schedules for Task Graphs |
141
Voted
PDPTA
1996
15 years 3 months ago
1996
This paper presents pTask-- a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler an...
108
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
134
Voted
ICPP
1999
IEEE
15 years 7 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
136
Voted
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
141
Voted
ICPADS
1998
IEEE
15 years 6 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...