138 search results - page 2 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
ICPP
1999
IEEE
13 years 8 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...
ICPADS
1998
IEEE
13 years 8 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...
CLUSTER
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
ISPAN
1996
IEEE
1996
IEEE
Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
13 years 8 months ago
ICPP
2005
IEEE
13 years 10 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...