A MULTI-PATH ROUTING SCHEME FOR TORUS-BASED NOCs1

Y. Jiao, Y. Yang, M. Yang, and Y. Jiang

References

  1. [1] D. Rossi, C. Metra, A.K. Nieuwland, & A. Katoch, ExploitingECC redundancy to minimize crosstalk impact, IEEE Designand Test of Computers, 22 (1), 2005, 59–70. doi:10.1109/MDT.2005.10
  2. [2] A. Jantsch & H. Tenhunen, Networks on chip (Norwell, MA:Kluwar Academic Publishers, 2003).
  3. [3] L. Benini & G. DeMicheli, Networks on chips: A new SoCparadigm, Computer, 35 (1), 2002, 70–78. doi:10.1109/2.976921
  4. [4] W.J. Dally, A VLSI architecture for concurrent data structures,Ph.D. Dissertation, California Institute of Technology, 1986.
  5. [5] N. Kavaldjiev & G.M. Smit, An energy-efficient network-on-chip for a heterogeneous tiled reconfigurable systems-on-chip,Proc. Euromicro Symp. Digital System Design (DSD), Rennes,France, 2004, 492–498. doi:10.1109/DSD.2004.1333317
  6. [6] W.J. Dally & C.L. Seitz, Deadlock-free message routing inmultiprocessor interconnection networks, IEEE Transactionson Computers, C-36 (5), 1987, 547–553. doi:10.1109/TC.1987.1676939
  7. [7] D.H. Linder & J.C. Harden, An adaptive and fault tolerantwormhole routing strategy for k-ary n-cubes, IEEE Transac-tions on Computers, C-40 (1), 1991, 2–12. doi:10.1109/12.67315
  8. [8] J. Duato, A new theory of deadlock-free adaptive routingin wormhole networks, IEEE Transactions on Parallel andDistributed Systems, 4 (12), 1993, 1320–1331. doi:10.1109/71.250114
  9. [9] J.P. Uyemura, Introduction to VLSI circuits and systems (NewYork: John Wiley & Sons, 2002).
  10. [10] A. Chien, A cost and speed model for k-ary n-cube worm-hole routers, IEEE Transactions on Parallel and DistributedSystems, 9 (2), 1998, 150–162. doi:10.1109/71.663877
  11. [11] J. Duato, S. Yalamanchili, & L. Ni, Interconnection networks:An engineering approach (San Francisco, CA: Morgan Kauf-mann Publishers, 2003).
  12. [12] J.H. Kim & A.A. Chien, An evaluation of the planar/adaptiverouting, Proc. 4th IEEE Symp. on Parallel and DistributedProcessing, Arlington, TX, 1992, 470–478.
  13. [13] F. Petrini & M. Vanneschi, K-ary n-trees: High performancenetworks for massively parallel architectures, Proc. ParallelProcessing Symp., Geneva, Switzerland, 1997, 87–93.
  14. [14] J. Duato & P. Lopez, Performance evaluation of adaptiverouting algorithms for k-ary n-cubes, Proc. 1st Int. Workshopon Parallel Computer Routing and Communication (PCRCW),Seattle, WA, 1994, 45–59.

Important Links:

Go Back