Name
Abstract | ||
|---|---|---|
The interprocessor communication overhead in distributed memory parallel architectures can have a significant impact on overall machine performance, so scheduling techniques that can be used to reduce this overhead are important. In this paper, we design a new priority-based scheduling algorithm in an attempt to maximize heterogeneous parallelism while minimizing communication delays, based on the concept of the increase over the execution time of a given program. To estimate the goodness of the algorithm by relating its performance to an optimal solution, we also develop a branch-and-bound algorithm using a new lower bound cost function. Finally, we present experimental results to demonstrate the effectiveness and efficiency of the optimization technique. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1145/277830.277862 | International Conference on Supercomputing 2006 |
Keywords | Field | DocType |
heterogeneous parallelism,communication delay,branch and bound algorithm,distributed memory,scheduling algorithm,lower bound,cost function | Computer science,Parallel computing,Real-time computing,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-89791-998-X | 0 | 0.34 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dingchao Li | 1 | 1 | 2.76 |
| Yuji Iwahori | 2 | 159 | 56.83 |
| Naohiro Ishii | 3 | 461 | 128.62 |