论文部分内容阅读
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.
Task partitioning is an important technique in parallel processing. In this paper, we investigate the optimal partitioning strategies and granularities of tasks with communications based on several models of parallel 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 then program of processor using 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 possible as-de-pending only on the functions of ratio of running time to communication time R / C.