A memory-effective routing strategy for regular interconnection networks

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Gomez M E ^a   Lopez P ^a   Duato, J ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ROUTING; FORWARDING TABLES; PARALLEL COMPUTING SYSTEM; ROUTING ALGORITHM;

ALGORITHMS; COMPUTER HARDWARE; DECISION TABLES; INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER); SWITCHES; TOPOLOGY;

ROUTERS;

EID: 33746317623     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.44     Document Type: Conference Paper

References (22)

1. B. Abali and G. Aykanat. Routing Algorithms for IBM SP1. IBM Technical Report #123, 1994.
2. ASCI Red Web Site. http://www.sandia.gov/ASCI/Red/.
3. E. Bakker, J. van Leeuwer and R.B. Tan. Linear Interval Routing Algorithms review, 2. pp. 45-61, 1991.
4. IBM BG/L Team. An Overview of BlueGene/L Supercomputer. ACM Supercomputing Conference, 2002.
5. C. Carrion, R. Beivide, J.A. Gregorio, and F. Vallejo. A Flow Control Mechanism to Avoid Message Deadlock in K-ary N-Cube Networks. 4th International Conference on High Performance Computing, pp. 332-329, December 1997.
6. http://www.psc.edu/machines/cray/t3d/t3d.html.
7. W. J. Dally, Virtual-channel flow control, IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, March 1992.
8. W.J. Dally and B. Towles. Principles and Practices of Interconnection Networks. Morgan Kaufmann, 2004.
9. J. Duato, S. Yalamanchili and L. Ni. Interconnection Networks. An Engineering Approach. Morgan Kaufmann, 2004.
10. Earth Simulator Center, http://www.es.jamstec.go.jp/esc/eng/index.html.
11. J. Duato. A Necessary and Sufficient Condition for Deadlock-Free Outgoing in Cut-Through and Store-and-Forward Networks, in Proc. of IEEE Trans. on Parallel and Distributed Systems, vol. 7, no. 8, pp. 841-854, August 1996.
12. M. Galles. Spider: A High-Speed Network Interconnect. IEEE Micro, 17(1), 1997.
13. C. Gavoille, S. Pérennès. Memory requirement for routing in distributed networks. 15th annual ACM Symposium on Principles of Distributed Computing, 1996.
14. C. Gavoille. Routing in distributed networks: overview and open problems. ACM SIGACT News- Distributed Computing Column, 32(1): 36-52, March 2001.
15. M.E. Gómez, J. Duato, J. Flich, P. Lopez, and A. Robles / N.A. Nordbotten, O. Lysne, and T. Skeie. An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori, Computer Architecture Letters, Vol. 3, May 2004.
16. InfiniBand™ Trade Association, InfiniBand™ architecture. Specification Volume 1. Release 1.0.a. Available at http://www.infinibandta.com.
17. J. van Leeuwen and R. B. Tan. Interval Routing. The Computer Journal, 30(4), pp.298-307, 1987.
18. J.C. Martinez, J. Flich, A. Robles, P. Lopez, and J. Duato. Supporting Adaptive Routing in IBA Switches. Journal of Systems Architecture, 49:441-449, 2004.
19. M.D. May, P.W. Thompson and P.H. Welch. Networks, routers and transputers: Function, performance, and applications. IOS Press, Netherlands, 1993.
20. N. J. Boden et al., Myrinet - A gigabit per second local area network, IEEE Micro, vol. 15, Feb. 1995.
21. N. Santoro and R. Khatib. Routing without routing tables. Technical report SCS-TR-6, School of Computer Science, Carleton University, 1982.
22. Also as: Labelling and Implicit Routing in Networks, Computer Journal 28(1), 1985, pp. 5-8.