Skip to main content
SpringerLink
Log in

Optimal partitioning and granularity of uniform task graphs

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms.IEEE Trans. Software Eng. SE-3 (1977), 85–93.

    Article  Google Scholar 

  2. H. S. Stone, Critical load factor in two-processor distributed system,IEEE Trans. Software Eng., SE-4 (1978), 254–258.

    Article  Google Scholar 

  3. G. S. Raoet al., Assignment of tasks in a distributed processor system with limited memory.IEEE Trans. Computers, C-28 (1979), 291–299.

    Article  Google Scholar 

  4. W. W. Chuet al., Task allocation in distributed data processing.Computer,13: 11 (1980), 57–69.

    Article  Google Scholar 

  5. H. S. Stone, High-performance computer architecture. Addison-Wesley Publishing Company, 1987.

  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.

  7. S. H. Bokhari, Partitioning problem in parallel, pipelined, and distributed computing.IEEE Trans. Computers,37: 1 (1988), 48–57.

    Article  MathSciNet  Google Scholar 

  8. Boontee Kruatrachue and Ted Lewis, Grain size determination for parallel processing.IEEE Software, 23–32, Jan. 1988.

  9. Xia Peisuet al., The architecture of BJ parallel computer series (invited paper). Int’l. Conference on Computational Physics, June 1988.

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, Academia Sinica, 10080, Beijing

    Zhang Zhongyun & Li Guojie

Authors
  1. Zhang Zhongyun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Guojie
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported in part by the National Natural Science Foundation of China and in part by the 863 Project.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Z., Li, G. Optimal partitioning and granularity of uniform task graphs. J. of Comput. Sci. & Technol. 6, 185–194 (1991). https://doi.org/10.1007/BF02945370

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945370

Keywords

Search

Navigation