Skip to main content
SpringerLink
Log in

Efficient indirect all-to-all personalized communication on rings and 2-D tori

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

Abstract

All-to-All personalized communication is a basic communication operation in a parallel computing environment. There are a lot of results appearing in literature. All these communication algorithms can be divided into two kinds: direct communication algorithm and indirect communication algorithm. The optimal direct all-to-all communication algorithm on rings and 2-D tori does exist. But, for indirect all-to-all communication algorithms, there is a gap between the time complexity of the already existing algorithm and the lower bound. In this paper an efficient indirect algorithm for all-to-all communication on rings and 2-D square tori with bidirection channels is presented. The algorithms is faster than any previous indirect algorithms. The main items of the time complexity of the algorithm isp 2/8 andp 3/2/8 on rings and 2-D tori respectively, both reaching the theoretical lower bound, wherep is the number of processors.

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. Kumar V, Grama A, Gupta A, Karypis G. Introduction to Parallel Computing — Design and Analysis of Algorithm. California: The Benjamin/Cummings Publishing Company, 1994.

    Google Scholar 

  2. Tseng Y C, Gupta S. All-to-all personalized communication in a wormhole-routed torus.IEEE Trans. Parallel & Distributed Systems, 1996, 7(5): 498.

    Article  Google Scholar 

  3. Scott D S. Efficient all-to-all communication patterns in hypercube and mesh topologies. InProc. 6th Conf. Distributed Memory Concurrent Computers, Protland, April, 1991, pp.398–403.

  4. Lam C C, Huang C H, Sadayappan P. Optimal algorithms for all-to-all personalized communication on rings and two dimensional tori.Journal of Parallel and Distributed Computing, 1997, 43: 3–13.

    Article  MATH  Google Scholar 

  5. Tseng Y C, Lin T H, Gupta S, Panda D. Bandwidth-optimal complete exchange on wormhole-routed 2D/3D torus networks: A diagonal-propagation approach.IEEE Trans. Parallel and Distributed Systems, 1997, 8(4): 380–396.

    Article  Google Scholar 

  6. Sundar N S, Jayasimha D N, Panda D K, Sadayappan P. Hybrid algorithms for complete exchange in 2D meshes. InProc. 1996 International Conference on Supercomputing, Philadelphia, PA, USA, May 25–28, 1996, pp. 181–188.

  7. Bokhari S H, Berryman H. Complete exchange on a circuit switched mesh. InProc. 1992 Scalable High Performance Computing Conference. Williamsburg, VA, April, 1992, pp.300–306.

  8. Johnsson S L, Ho C T. Optimal broadcasting and personalized communication in hypercubes.IEEE Trans. Computers, 1989, 38(9): 1249–1268.

    Article  MathSciNet  Google Scholar 

  9. Tseng Y C, Gupta S, Panda D. An efficient scheme for complete exchange in 2D tori. InProc. 9th International Parallel Processing Symposium, Santa Barbara, CA, April, 1995, pp.532–536.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Technology, University of Science and Technology of China, 230026, Hefei, P.R. China

    Gu Naijie

Authors
  1. Gu Naijie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gu Naijie.

Additional information

This work is supported by the Ph.D. Research Foundation The Ministry of Education, China (No.9703825).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gu, N. Efficient indirect all-to-all personalized communication on rings and 2-D tori. J. Comput. Sci. & Technol. 16, 480–483 (2001). https://doi.org/10.1007/BF02948967

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation