Skip to main content
SpringerLink
Log in

Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

All-to-all personalized exchange occurs in many important applications in parallel processing. In the past two decades, algorithms for all-to-all personalized exchange were mainly proposed for hypercubes, meshes, and tori. Recently, Yang and Wang (IEEE Trans Parallel Distrib Syst 11:261–274, 2000) proposed an optimal all-to-all personalized exchange algorithm for binary (each switch is of size 2×2) banyan multistage interconnection networks. It was pointed out in Massini (Discret Appl Math 128:435–446, 2003) that the algorithm in Yang, Wang (IEEE Trans Parallel Distrib Syst 11:261–274, 2000) depends on the network topologies and requires pre-computation and memory allocation for a Latin square. Thus in (Discret Appl Math 128:435–446, 2003), Massini proposed a new optimal algorithm, which is independent of the network topologies and does not require pre-computation or memory allocation for a Latin square. Unfortunately, Massini’s algorithm has a flaw and does not realize all-to-all personalized exchange. In this paper, we will correct the flaw and generalize Massini’s algorithm to be applicable to d-nary (each switch is of size d×d) banyan multistage interconnection networks.

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

  • Chang GJ, Hwang FK, Tong LD (1999) Characterizing bit permutation networks. Networks 33:261–267

    Article  MATH  Google Scholar 

  • Chen Z, Liu Z, Qiu Z (2003) Bidirectional shuffle-exchange network and tag-based routing algorithm. IEEE Commun Lett 7:121–123

    Article  MATH  Google Scholar 

  • Hwang FK (2004) The mathematical theory of nonblocking switching networks. Series on applied mathematics, vol 15

  • Johnsson SL, Ho CT (1989) Optimum broadcasting and personalized communication in hypercubes. IEEE Trans Comput 38:1249–1268

    Article  Google Scholar 

  • Massini A (2003) All-to-all personalized communication on multistage interconnection networks. Discret Appl Math 128:435–446

    Article  MATH  Google Scholar 

  • Scott DS (1991) Efficient all-to-all communication patterns in hypercube and mesh topologies. In: Proceedings of the sixth distributed memory computing conference, pp 398–403

  • Suh YJ, Shin KG (1998) Efficient all-to-all personalized exchange in multidimensional torus networks. In: Proceedings of the international conference on parallel processing, pp 468–475

  • Suh YJ, Yalamanchili S (1998) All-to-all communication with minimum start-up costs in 2D/3D tori and meshes. IEEE Trans Parallel Distrib Syst 9:442–458

    Article  Google Scholar 

  • Thakur R, Choudhary A (1994) All-to-all communication on meshes with wormhole routing. In: Proceedings of the eighth IEEE international parallel processing symposium, pp 561–565

  • Tseng Y-C, Gupta S (1996) All-to-all personalized communication in a wormhole-routed torus. IEEE Trans Parallel Distrib Syst 7:498–505

    Article  Google Scholar 

  • Tseng Y-C, Lin T-H, Gupta S, Panda DK (1997) Bandwidth-optimal complete exchange on wormhole routed 2D/3D torus networks: a diagonal-propagation approach. IEEE Trans Parallel Distrib Syst 8:380–396

    Article  Google Scholar 

  • Yang Y, Wang J (1999) All-to-all personalized exchange in banyan networks. In: Proceedings of the parallel and distributed computing and systems (PDCS’99), Cambridge, MA, pp 78–86

  • Yang Y, Wang J (2000a) Optimal all-to-all personalized exchange in self-routable multistage networks. IEEE Trans Parallel Distrib Sys 11:261–274

    Article  Google Scholar 

  • Yang Y, Wang J (2000b) Optimal all-to-all personalized exchange in multistage networks. In: Proceedings of the seventh international conference on parallel and distributed systems (ICPADS’00), Iwale, Japan

  • Yang Y, Wang J (2001) Optimal all-to-all personalized exchange in a class of optical multistage networks. IEEE Trans Parallel Distrib Syst 12:567–582

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chiao Tung University, Hsinchu, 300, Taiwan

    Victor W. Liu, Chiuyuan Chen & Richard B. Chen

Authors
  1. Victor W. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chiuyuan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard B. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chiuyuan Chen.

Additional information

Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday.

This research was partially supported by the National Science Council of the Republic of China under the grant NSC94-2115-M-009-006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, V.W., Chen, C. & Chen, R.B. Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks. J Comb Optim 14, 131–142 (2007). https://doi.org/10.1007/s10878-007-9065-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9065-5

Keywords

Search

Navigation