A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks

Zarza, Gonzalo; Lugones, Diego; Franco, Daniel; Luque, Emilio

doi:10.1007/978-3-642-03869-3_99

Cited by 4 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3.19. Our router share some design architectures with the work presented in Multipath Fault-tolerant Routing Policies to deal with Dynamic Link Failures in High Speed Interconnection Networks (FT-DRB) [65]. The main di erence with our method is that FT-DRB uses its own mechanism in the router in order to provide fault tolerance in the network.…”

Section: Pr-drb Routermentioning

confidence: 99%

Predictive and Distributed Routing Balancing for High Speed Interconnection Networks

Castillo

Lugones

Franco

et al. 2011

2011 IEEE International Conference on Cluster Computing

Self Cite

View full text Add to dashboard Cite

EnglishIn high performance clusters, current parallel application communication needs, such as tra c pattern, communication volume, etc., change along time and are di cult to know in advance. Such needs often exceed or do not match available resources causing resource use imbalance, network congestion, throughput reduction and message latency increase, thus degrading the overall system performance. Studies on parallel applications show repetitive behavior that can be characterized by a set of representative phases. This work presents a Predictive and Distributed Routing Balancing (PR-DRB) technique, a new method developed to gradually control network congestion, based on paths expansion, tra c distribution, applications pattern repetitiveness and speculative adaptive routing, in order to maintain low latency values. PR-DRB monitors messages latencies on routers and saves the found solutions to congestion, to quickly respond in future similar situations. Tra c congestion experiments were conducted in order to evaluate the performance of the method, and improvements were observed. CastellanoEn los clusters de altas prestaciones, los requerimientos actuales de las comunicaciones de las aplicaciones, como el patr on de tr a co, el vol umen de comunicaciones entre otras, pueden cambiar a lo largo del tiempo y son dif ciles de predecir. Estas necesidades generalmente exceden o no se corresponden con los recursos disponibles realmente, lo cual conlleva a una situaci on de desbalanceo de los recursos, congesti on en la red, reducci on del throughput y un incremento considerable en los valores de latencia de los mensajes. Todo esto conlleva una degradaci on general del rendimiento de todo el sistema computacional. Los estudios de las aplicaciones paralelas demuestran que estas tienen un comportamiento repetitivo. Adem as, esta repetitividad puede detectarse y caracterizarse a trav es de unas fases representativas. Este trabajo propone un Algoritmo de Encaminamiento Predictivo y Distribuido (PR-DRB). Este nuevo m etodo propone controlar la congesti on de la red de manera gradual bas andose en la expansi on controlada de caminos, la distribuci on del tr a co, la repetitividad en las aplicaciones paralelas y el encaminamiento adaptativo especulativo; de manera a mantener los valores de latencia controlados. PR-DRB monitorea la latencia de los mensajes en los encaminadores y guarda las mejores soluciones adaptativas encontradas a una situaci on de congesti on. Esto se realiza de manera a re aplicar estas mejores soluciones de manera r apida ante situaciones similares futuras. Fueron desarrollados varios experimentos que generen congesti on de tr a co a n de evaluar el rendimiento de la propuesta, y se han logrado mejoras importantes en el rendimiento global del sistema.Palabras clave: Redes de interconexi on, Computaci on de Altas Prestaciones, Encaminamiento Predictivo, Encaminamiento Basado en las Aplicaciones.vi Català En els cl usters d'altes prestacions, els requeriments actuals de les comunicacions de les apl...

show abstract

Section: Pr-drb Routermentioning

confidence: 99%

Predictive and Distributed Routing Balancing for High Speed Interconnection Networks

Castillo

Lugones

Franco

et al. 2011

2011 IEEE International Conference on Cluster Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…In a previous work, we have introduced a method capable of supporting dynamic faults appearing at random during network operation [11]. This means that the system remains operational while measures are taken to circumvent the faulty components.…”

Section: Introductionmentioning

confidence: 99%

FT-DRB: A Method for Tolerating Dynamic Faults in High-Speed Interconnection Networks

Zarza

Lugones

Franco

et al. 2010

2010 18th Euromicro Conference on Parallel, Distributed and Network-Based Processing

Self Cite

View full text Add to dashboard Cite

The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation.The interconnection network is a critical part of such systems, therefore, network faults have an extremely high impact because most routing algorithms are not designed to tolerate faults. In such algorithms, just a single fault may stall messages in the network, preventing the finalization of applications, or may lead to deadlocked configurations. This paper introduces a novel fault-tolerant routing method provided with a new deadlock avoidance technique designed to solve an unbounded number of faults appearing at random during system operation. Our method provides escape paths for the stalled messages. In addition, the routing algorithm configures alternative paths to avoid the faulty areas taking advantage of communication path redundancy by means of multipath routing approaches. Deadlock avoidance is achieved by adding a smallsized queue and applying a simple set of actions when accessing output buffers with limited free space. Experiments show that our method allows applications to successfully finalize their execution in the presence of several number of faults, with an average performance value of 96% compared to the fault-free scenarios.

show abstract

“…The fault-tolerance concern is recurrent when designing a new topology as can be found in the literature [2]- [8], [10], [12], [14]- [18], but few of these works perform a deep fault-tolerance analysis to quantify the fault-tolerance level achieved by the proposed topologies [9]. These results are very useful when selecting the topology for a new machine.…”

Section: Introductionmentioning

confidence: 99%

Speeding-up the fault-tolerance analysis of interconnection networks

Garzón

Gómez

López

et al. 2015

2015 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks

Cited by 4 publications

References 12 publications

Predictive and Distributed Routing Balancing for High Speed Interconnection Networks

Predictive and Distributed Routing Balancing for High Speed Interconnection Networks

FT-DRB: A Method for Tolerating Dynamic Faults in High-Speed Interconnection Networks

Speeding-up the fault-tolerance analysis of interconnection networks

Contact Info

Product

Resources

About