
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yulu Yang, Akira Funahashi, Akiya Jouraku, Hiroaki Nishi, Hideharu Amano, Toshinori Sueyoshi, "Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 7, pp. 701715, July, 2001.  
BibTex  x  
@article{ 10.1109/71.940745, author = {Yulu Yang and Akira Funahashi and Akiya Jouraku and Hiroaki Nishi and Hideharu Amano and Toshinori Sueyoshi}, title = {Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {7}, issn = {10459219}, year = {2001}, pages = {701715}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.940745}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers IS  7 SN  10459219 SP701 EP715 EPD  701715 A1  Yulu Yang, A1  Akira Funahashi, A1  Akiya Jouraku, A1  Hiroaki Nishi, A1  Hideharu Amano, A1  Toshinori Sueyoshi, PY  2001 KW  Interconnection network KW  massively parallel computer KW  routing algorithm KW  router chip KW  mesh network KW  torus network KW  message multicast. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to
[1] Paragon XP/S Product Overview. Intel Corp., 1991.
[2] H. Ishihata, T. Horie, S. Inano, T. Shimizu, S. Kato, and M. Ikesaka, “Third Generation Message Passing Computer AP1000,” Proc. Int'l Symp. Supercomputing, pp. 4655, Nov. 1991.
[3] S.L. Scott and G.M. Thorson, “The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus,” Proc. Hot Interconnect Symp. IV, pp. 147156, 1996.
[4] W.J. Dally, A. Chien, S. Fiske, W. Horwat, J. Kenn, M. Larivee, R. Lethin, P. Nuth, and S. Wills, “The JMachine: A FineGrain Concurrent Computer,” Proc. IFIP 11th Computer Congress, pp. 11471153, Aug. 1989.
[5] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[6] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[7] C.E. Leiserson, "FatTrees: Universal Networks for Hardware Efficient Supercomputing," IEEE Trans. Computers, vol. C34, no. 10, Oct. 1985, pp. 892901.
[8] S.B. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the nCube,” Proc. Int'l Conf. Parallel Processing '87, pp. 393400, Aug. 1987.
[9] Y. Yang, H. Amano, H. Shibamura, and T. Sueyoshi, “Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers,” Proc. Fifth IEEESymp. Parallel and Distributed Processing, pp. 591594, Dec. 1993.
[10] H. Tanaka, The Massively Parallel Processing System JUMP1. Int'l Organizations Services Press, 1996.
[11] Y. Yang and H. Amano, “Message Transfer Algorithms on the Recursive Diagonal Torus,” IEICE Trans. Information&Systems, vol. E79D, no. 2, pp. 107116, 1996.
[12] W.J. Dally and C.L. Seitz, “DeadlockFree Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[13] J.C. Bermond and C. Peyrat, “De Bruijn and Kautz Networks: A Competitor for the Hypercube,” Hypercube and Distributed Computers, F. Andre and J.P. Verjus, eds., pp. 279293, NorthHolland, 1989.
[14] D.K. Paradhan, “FaultTolerant Multiprocessor Link and Bus Network Architectures,” IEEE Trans. Computers, vol. 34, no. 1, pp. 3545, Jan. 1985.
[15] S. Sakai et al., "An Architecture of a Dataflow Single Chip Processor," Proc. 16th Ann. Int'l Symp. Computer Architecture, ACM Press, 1989, pp. 4653.
[16] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[17] K. Hwang and J. Ghosh, "Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, pp. 1,4501,466, 1987.
[18] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513524, Sept.Oct. 1992.
[19] R. Beivide, E. Herrada, J.L. Balcázar, and A. Arruabarrena, "Optimal Distance Networks of Low Degree for Parallel Computers," IEEE Trans. Computers, vol. 40, no. 10, pp. 1,1091,124, Oct. 1991.
[20] K.W. Tang and S.A. Padubidri, “Routing and Diameter Analysis of Diagonal Mesh Networks,” Proc. Int'l Conf. Parallel Processing '92, pp. 143150, Aug. 1992.
[21] N. Tanabe, S. Nakamura, T. Suzuoka, and S. Oyanagi, “Basem nCube: High Performance Interconnection Networks for Highly Parallel Computer PRODIGY,” Proc. Int'l Conf. Parallel Processing '91, pp. I509516, Aug. 1991.
[22] T. Szymanski, “O(LogN/LogLogN) Randomized Routing in DegreeLogN 'Hypermeshes',” Proc. Int'l Conf. Parallel Processing '91, pp. 443450, Aug. 1991.
[23] J. Duato, “A Necessary and Sufficient Condition for DeadlockFree Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1,055–1,067, Oct. 1995.
[24] A. Funahashi, T. Hanawa, T. Kudoh, and H. Amano, “Adaptive Routing on the Recursive Diagonal Torus,” Proc. Int'l Symp. High Performance Computing, pp. 171182, Nov. 1997.
[25] A. Funahashi, A. Jouraku, and H. Amano, “Adaptive Routing on the Recursive Diagonal Torus,” Proc. Int'l Symp. Parallel and Distributed Computing Systems, pp. 171177, Aug. 1999.
[26] C.J. Glass and L.M. Ni, “Maximally Fully Adaptive Routing in 2D Meshes,” Proc. Int'l Soc. Computers and Their Applications '92, pp. 278287, 1992.
[27] K. Hiraki, H. Amano, M. Kuga, T. Seuyoshi, T. Kudoh, H. Nakashima, H. Nakajo, H. Matsuda, T. Matsumoto, and S. Mori, “Overview of JUMP1, An MPP Prototype for General Purpose Parallel Computations,” Proc. IEEE Int'l Symp. Parallel Architecture, Algorithm, and Networks, pp. 427434, Dec. 1994.
[28] T. Kudoh, H. Amano, T. Matsumoto, K. Hiraki, Y. Yang, K. Nishimura, K. Yoshimura, and Y. Fukushima, “Hierarchical BitMap Directory Schemes on the RDT Interconnection Network for a Massively Parallel Processor JUMP1,” Proc. Int'l Conf. Parallel Processing '95, vol. 1, pp. 186193, Aug. 1995.
[29] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[30] K. Nishimura, T. Kudoh, H. Nishi, and H. Amano, “Pruning Cache: A Dynamic Directory Generation Scheme for Distributed Shared Memory,” Proc. ISMM Int'l Conf. Parallel and Distributed Computing and Networks, pp. 8994, 1998.
[31] H. Inoue, K. Anjo, J. Yamamoto, J. Tanabe, M. Wakabayashi, M. Sato, H. Amano, and K. Hiraki, “The Preliminary Evaluation of MBPLight with Two Protocol Policies for a Massively Parallel Processor JUMP1,” Proc. IEEE Frontiers Massively Parallel Computation, pp. 268275, Feb. 1999.
[32] Q. Fan, Y. Yang, A. Funahashi, and H. Amano, “A Torus Assignment for an Interconnection Network Recursive Diagonal Torus,” Proc. IEEE Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 7479, 1999.