Optimal Partitioning and Granularity of Uniform Task Graphs

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 the number of processors used and T is the program execution time using N processors.Our results show that t…