107 search results - page 3 / 22 » A New Approach to Scheduling Parallel Programs Using Task Du... |
ICPP
2005
IEEE
13 years 11 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
ICPP
1993
IEEE
13 years 9 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...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
As multi-cores arrive for mainstream desktop systems, developers must invest the effort to parallelize their applications. We present Parallel Task (short ParaTask), a solution to ...
ICPP
1999
IEEE
13 years 9 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...
ICS
1998
Tsinghua U.
13 years 9 months ago
1998
Tsinghua U.
The goal of High Performance Fortran (HPF) is to "address the problems of writing data parallel programs where the distribution of data affects performance", providing t...