Advertisement

Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model

  • Dong Xiang
  • Qi Wang
  • Yi Pan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5022)

Abstract

A new deadlock-free partially adaptive routing algorithm is proposed for 2 − dimensional (2D) tori with only two virtual channels. The deadlock avoidance technique is presented based on a new turn model for 2D tori. In order to avoid cyclic channel dependencies completely, we propose the new odd-even turn model for 2D tori. The new model is an improved algorithm of the original turn model, and sets some constraints for some special turns. As far as we know, there is no existing algorithm for deadlock-free partially adaptive routing in 2D tori using only two virtual channels in the literature up to now. Sufficient simulation results are presented to demonstrate the effectiveness of the proposed algorithm by comparing with several previous methods.

Keywords

Deadlock avoidance deadlock-free adaptive routing odd-even turn model torus turn model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allen, F., et al.: Blue gene: A vision for protein science using a petaflop supercomputer. IBM Systems Journal 40, 310–327 (2001)CrossRefGoogle Scholar
  2. 2.
    Chiu, G.M.: The odd-even turn model for adaptive routing. IEEE Trans. on Parallel and Distributed Systems 11(7), 729–738 (2000)CrossRefGoogle Scholar
  3. 3.
    Dally, W.J., Seitz, G.L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers 36(5), 547–553 (1987)zbMATHCrossRefGoogle Scholar
  4. 4.
    Duato, J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parallel and Distributed Systems 4(12), 1320–1331 (1993)CrossRefGoogle Scholar
  5. 5.
    Glass, C.J., Ni, L.: The turn model for adaptive routing. Journal of ACM 41(5), 874–902 (1994)CrossRefGoogle Scholar
  6. 6.
    Linder, D., Harden, J.: An adaptive and fault-tolerant wormhole routing strategy for k −ary n −cube. IEEE Trans. Computers 40(1), 2–12 (1991)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Mukerhjee, S., Bannon, R., Lang, S., Spink, A.: The Alpha 21364 network architecture. IEEE Micro 22, 26–35 (2002)CrossRefGoogle Scholar
  8. 8.
    Puente, V., Izu, C., Beivide, R., Gregorio, J., Vallejo, F., Prellezo, J.: The adaptive bubble router. Journal of Parallel and Distributed Computing 61, 1180–1208 (2001)zbMATHCrossRefGoogle Scholar
  9. 9.
    Scott, S., Thorson, G.: The Cray T3E network: Adaptive routing in high performance 3D torus. In: Proc. of Int. Symp. on Hot Interconnects, pp. 147–156 (1996)Google Scholar
  10. 10.
    Singh, A., Dally, W.J., Gupta, A., Towles, B.: GOAL: A load-balanced adaptive routing algorithm for torus networks. In: ACM/IEEE Int. Symp. on Computer Architecture, pp. 194–205 (2003)Google Scholar
  11. 11.
    Sullivan, H., Bashkow, T., Klappholz, D.: A large scale, homegeneous, fully distributed parallel machine. In: Proc. of ACM/IEEE Int. symp. on Computer Architecture, pp. 118–124 (1977)Google Scholar
  12. 12.
    Xiang, D., Zhang, Y., Pan, Y., Wu, J.: Deadlock-free adaptive routing in meshes based on cost-effective deadlock avoidance schemes. In: 36th Int. Conference on Parallel Processing (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dong Xiang
    • 1
  • Qi Wang
    • 2
  • Yi Pan
    • 3
  1. 1.School of SoftwareTsinghua UniversityBeijingChina
  2. 2.Dept. of CSTsinghua UniversityBeijingChina
  3. 3.Dept. of CSGeorgia State UniversityAtlantaUSA

Personalised recommendations