| Optimal Partitioning and Granularity of Uniform Task Graphs |
| |
| 作者姓名： | 章中云 李国杰 |
| |
| 作者单位： | Institute of Computing Technology Academia Sinica，Beijing 100080，Institute of Computing Technology，Academia Sinica，Beijing 100080 |
| |
| 基金项目： | This work is supported in part by the National Natural Science Foundation of China，in part by the 863 Project. |
| |
| 摘 要： | Task partitioning is an important technique in parallel processing.In this paper,we investigate theoptimal partitioning strategies and granularities of tasks with communications based on several models ofparallel computer systems.Different from the usual approach,we study the optimal partitioning strate-gies and granularities from the viewpoint of minimizing T as well as minimizing NT~2,where N is thenumber of processors used and T is the program execution time using N processors.Our results showthat the optimal partitioning strategies for all cases discussed in this paper are the same——either to as-sign all tasks to one processor or to distribute them among the processors as equally as possible de-pending only on the functions of ratio of running time to communication time R/C.
|
| 本文献已被 CNKI 等数据库收录！ |
