A memory-effective fault-tolerant routing strategy for direct interconnection networks

ISPDC 2005: 4th International Symposium on Parallel and Distributed Computing

Volumn 2005, Issue , 2005, Pages 341-348

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

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

Author keywords

Adaptive routing; Distributed routing; Fault tolerance; Memory effective routing; Regular topologies

Indexed keywords

ADAPTIVE ROUTING; DISTRIBUTED ROUTING; MEMORY EFFECTIVE ROUTING; REGULAR TOPOLOGIES;

FAULT TOLERANCE; INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER); TOPOLOGY;

ROUTING PROTOCOLS;

EID: 33847696189     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2005.6     Document Type: Conference Paper

References (5)

1. C. Carrion, R. Beivide, J.A. Gregorio, and F. Vallejo. A Flow Control. Mechanism to Avoid Message Deadlock in K-ary N-Cube Networks. Forfth Int. Conference on High Performance Computing, pp. 332-329, December 1997.
2. J. Duato, S. Yalamanchili and L. Ni. Interconnection Networks. An Engineering Approach. Morgan Kaufmann, 2004.
3. M.E. Gómez, J. Duato, J. Flich, P. Lopez, A. Robles, N.A. Nordbotten, T. Skeie, and O. Lysne. A New Adaptive Fault-Tolerant Routing Methodology for Direct Networks, in Proc. Int. Conference on High Performance Computing, 2004.
4. M.E. Gómez, P. Lopez, J. Duato. A Memory-Effective Routing Strategy for regular Interconnection Networks, to appear in Proc. International Parallel and Distributed Processing Symposium, 2005. Best Paper Award in the Architecture Track.
5. N. Santoro and R. Khatib. Routing without routing tables. Tech. report SCS-TR-6, School of Computer Science, Carleton University, 1982. Also as: Labelling and Implicit Routing in Networks, Computer Journal 28(1), 1985, pp. 5-8.