Advertisement

Journal of Computer Science and Technology

, Volume 6, Issue 2, pp 185–194 | Cite as

Optimal partitioning and granularity of uniform task graphs

  • Zhang Zhongyun 
  • Li Guojie 
Regular Papers
  • 20 Downloads

Abstract

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 strategies and granularities from the viewpoint of minimizingT as well as minimizingNT 2, whereN is the number of processors used andT is the program execution time usingN processors. Our results show that the optimal partitioning strategies for all cases discussed in this paper are the same—either to assign all tasks to one processor or to distribute them among the processors as equally as possible depending only on the functions of ratio of running time to communication timeR/C.

Keywords

Execution Time Parallel Processing Communication Overhead Processor Utilization Optimal Partitioning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms.IEEE Trans. Software Eng. SE-3 (1977), 85–93.CrossRefGoogle Scholar
  2. [2]
    H. S. Stone, Critical load factor in two-processor distributed system,IEEE Trans. Software Eng., SE-4 (1978), 254–258.CrossRefGoogle Scholar
  3. [3]
    G. S. Raoet al., Assignment of tasks in a distributed processor system with limited memory.IEEE Trans. Computers, C-28 (1979), 291–299.CrossRefGoogle Scholar
  4. [4]
    W. W. Chuet al., Task allocation in distributed data processing.Computer,13: 11 (1980), 57–69.CrossRefGoogle Scholar
  5. [5]
    H. S. Stone, High-performance computer architecture. Addison-Wesley Publishing Company, 1987.Google Scholar
  6. [6]
    Li Guojie and B. W. Wah, Optimal granularity of parallel evaluation of And trees. 1986 Procedings Fall Joint Computer Conference, 297–306, Nov. 1986.Google Scholar
  7. [7]
    S. H. Bokhari, Partitioning problem in parallel, pipelined, and distributed computing.IEEE Trans. Computers,37: 1 (1988), 48–57.CrossRefMathSciNetGoogle Scholar
  8. [8]
    Boontee Kruatrachue and Ted Lewis, Grain size determination for parallel processing.IEEE Software, 23–32, Jan. 1988.Google Scholar
  9. [9]
    Xia Peisuet al., The architecture of BJ parallel computer series (invited paper). Int’l. Conference on Computational Physics, June 1988.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1991

Authors and Affiliations

  • Zhang Zhongyun 
    • 1
  • Li Guojie 
    • 1
  1. 1.Institute of Computing TechnologyAcademia SinicaBeijing

Personalised recommendations