14 search results - page 3 / 3 » On Clustering Tasks in IC-Optimal Dags |
CCGRID
2010
IEEE
13 years 3 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
ICPADS
1998
IEEE
13 years 10 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...
JSA
2000
13 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
IEEEPACT
1998
IEEE
13 years 10 months ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...