Skip to main content
SpringerLink
Log in

Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this paper, we propose a general turn model, called a Tree-turn model, for tree-based routing algorithms on irregular topologies. In the Tree-turn model, links are classified as either a tree link or a cross link and six directions are associated with the channels of links. Then we can prohibit some of the turns formed by these six directions such that an efficient deadlock-free routing algorithm, Tree-turn routing, can be derived. There are three phases to develop the Tree-turn routing. First, a coordinated tree for a given topology is created. Second, a communication graph is constructed based on the topology and the corresponding coordinated tree. Third, the forwarding table is set up by using all-pairs shortest path algorithm according to the prohibited turns in the Tree-turn model and the directions of the channels in the communication graph. To evaluate the performance of the proposed Tree-turn routing, we develop a simulator and implement Tree-turn routing along with up*/down* routing, L-turn routing, and up*/down* routing with DFS methodology. The simulation results show that Tree-turn routing outperforms other routing algorithms for all the test cases.

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. Boden NJ, Cohen D, Felderman RE, Kulawik AE, Seitz CL, Seizovic JN, Su W-K (1995) Myrinet: a gigabyte-per-second local area network. In: IEEE Micro, February 1995, pp 29–36

  2. Cherkasova L, Kotov V, Rokicki T (1996) Fibre channel fabrics: evaluation and design. In: Proceedings of annual Hawaii international conference on system science, January 1996, pp 53–62

  3. Chiu G-M (2000) The odd-even turn model for adaptive routing. IEEE Trans Parallel Distrib Syst 11(7):729–738

    Article  Google Scholar 

  4. Dally WJ (1992) Virtual-channel flow control. IEEE Trans Parallel Distrib Syst 3(2):194–205

    Article  Google Scholar 

  5. Dally WJ, Seitz CL (1987) Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput 36(5):547–553

    Article  MATH  Google Scholar 

  6. Dally WJ, Aoki H (1993) Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans Parallel Distrib Syst 4(4):466–475

    Article  Google Scholar 

  7. Duato J (1995) A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans Parallel Distrib Syst 6(10):1055–1067

    Article  Google Scholar 

  8. Duato J (1994) A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. In: Proceedings of 1994 IEEE international conference on parallel processing, August 1994, pp 142–149

  9. Duato J (1993) A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans Parallel Distrib Syst 4(12):1320–1331

    Article  Google Scholar 

  10. Duato J (1991) On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In: Proceedings of parallel architectures and languages Europe 91, vol 1, June 1991, pp 390–405

  11. Glass CJ, Ni LM (1992) Maximally fully adaptive routing in 2D meshes. In: Proceedings of IEEE international conference on parallel processing, vol 1, August 1992, pp 101–104

  12. Glass CJ, Ni LM (1994) The turn model for adaptive routing. J ACM 5:874–902

    Article  Google Scholar 

  13. Glass CJ, Ni LM (1992) The turn model for adaptive routing. In: Proceedings of the 19th international symposium on computer architecture, May 1992, pp 278–287

  14. InfiniBand Trade Association (2004) InfiniBand architecture specification, vol 1, Release 1.2, October 2004. http://infinibandta.org/specs/

  15. Jouraku A, Koibuchi M, Amano H, Funahashi A (2007) An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks. IEEE Trans Parallel Distrib Syst 18(3):320–333

    Article  Google Scholar 

  16. Jouraku A, Koibuchi M, Amano H, Funahashi A (2002) Routing algorithms based on 2D turn model for irregular networks. In: Proceedings of the IEEE international symposium on parallel architectures, algorithms, and networks, May 2002, pp 254–259

  17. Koibuchi M, Funahashi A, Jouraku A, Amano H (2001) L-turn routing: an adaptive routing in irregular networks. In: Proceedings of IEEE international conference on parallel processing, September 2001, pp 383–392

  18. Koibuchi M, Jouraku A, Watanabe K, Amano H (2003) Descending layers routing: a deadlock-free deterministic routing using virtual channels in system area networks with irregular topologies. In: Proceedings of international conference on parallel processing, October 2003, pp 527–536

  19. Lin X, McKinley PK, Ni LM (1995) The message flow model for routing in wormhole-routed networks. IEEE Trans Parallel Distrib Syst 6(7):755–760

    Article  Google Scholar 

  20. Lin XY, Chung YC, Huang TY (2004) A multiple LID routing scheme for fat-tree-based InfiniBand networks. In: Proceedings of IEEE international parallel and distributed proceeding symposiums (CD-ROM), April 2004

  21. Lysne O, Skeie T, Reinemo S-A, Theiss I (2006) Layered routing in irregular networks. IEEE Trans Parallel Distrib Syst 17(1):51–65

    Article  Google Scholar 

  22. Mejia A, Flich J, Duato J, Reinemo S-A, Skeie T (2006) Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori. In: Proceedings of international parallel and distributed processing symposium, April 2006

  23. Ni LM, McKinley PK (1993) A survey of wormhole routing techniques in direct networks. IEEE Comput 26(2):62–67

    Article  Google Scholar 

  24. Petrini F, Feng W-C, Hoisie A, Coll S, Frachtenberg E (2001) The quadrics network (QsNet): high-performance clustering technology. In: IEEE hot interconnects, August 2001, pp 125–130

  25. Puente V, Gregorio JA, Beivide R, Vallejo F, Ibanez A (2001) A new routing mechanism for networks with irregular topology. In: Proceedings of the 2001 ACM/IEEE conference on supercomputing (CDROM), pp 1–8

  26. Sancho JC, Robles A, Duato J (2000) A flexible routing scheme for networks of workstations. In: Proceedings of international conference on high performance computing, October 2000, pp 260–267

  27. Sancho JC, Robles A, Duato J (2004) An effective methodology to improve the performance of the up*/down* routing algorithms. IEEE Trans Parallel Distrib Syst 15(8):740–754

    Article  Google Scholar 

  28. Schroeder MD, Birrell AD, Burrows M, Murray H, Needham RM, Rodeheffer TL, Satterthwaite EH, Thacker CP (1990) Autonet: a high-speed, self-configuring local area network using point-to-point links. Technical Report SRC Research Report 59, DEC, April 1990

  29. Schwiebert L, Jayasimha DN (1995) A universal proof technique for deadlock-free routing in interconnection networks. In: Proceedings of symposium on parallel algorithms and architectures, July 1995, pp 175–184

  30. Silla F, Duato J (2000) High-performance routing in networks of workstations with irregular topology. IEEE Trans Parallel Distrib Syst 5(7):699–719

    Article  Google Scholar 

  31. Silla F, Duato J (1997) Improving the efficiency of adaptive routing in networks with irregular topology. In: Proceedings of the 1997 conference on high performance computing, December 1997

  32. Skeie T, Lysne O, Flich J, López P, Robles A, Duato J (2004) LASH-TOR: a generic transition-oriented routing algorithm. In: Proceedings of international conference on parallel and distributed systems, July 2004, pp 595–604

  33. Wu J (2003) A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd-even turn model. IEEE Trans Parallel Distrib Syst 52(9):1154–1169

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, 300, ROC

    Jiazheng Zhou & Yeh-Ching Chung

Authors
  1. Jiazheng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yeh-Ching Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yeh-Ching Chung.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, J., Chung, YC. Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks. J Supercomput 59, 882–900 (2012). https://doi.org/10.1007/s11227-010-0477-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0477-0

Keywords

Search

Navigation