Routers in a dynamic environment must efficiently deliver messages without knowledge of an application's process allocation. We've developed an adaptive routing system for a completely dynamic environment. Our system proposes two different strategies, depending on the application's communication patterns. In the first solution, the Hot-Spot Avoiding (HSA) algorithm, each message separately finds the route toward the destination. Even messages exchanged between the same couple of processes follow different, possibly nonminimal, paths. The HSA algorithm uses neighborhood information to choose the node to which the message is forwarded. It limits the number of hops in the source-destination path by reducing the occurrence of loops in it. The second algorithm, Virtual Path (VP), is tailored to long-lasting entities that cooperate intensively by exchanging messages. It achieves efficiency by finding a path at the beginning and following that path for several messages. For performance's sake, this algorithm partially renounces the HSA algorithm's adaptiveness

Adaptive Routing Strategies for Dynamic Applications in Massively Parallel Architectures / Boari, M.; Corradi, A; Leonardi, Letizia; Stefanelli, C.. - In: IEEE PARALLEL & DISTRIBUTED TECHNOLOGY. - ISSN 1063-6552. - STAMPA. - 3, No. 1:(1995), pp. 61-74. [10.1109/88.384585]

Adaptive Routing Strategies for Dynamic Applications in Massively Parallel Architectures

LEONARDI, Letizia;
1995-01-01

Abstract

Routers in a dynamic environment must efficiently deliver messages without knowledge of an application's process allocation. We've developed an adaptive routing system for a completely dynamic environment. Our system proposes two different strategies, depending on the application's communication patterns. In the first solution, the Hot-Spot Avoiding (HSA) algorithm, each message separately finds the route toward the destination. Even messages exchanged between the same couple of processes follow different, possibly nonminimal, paths. The HSA algorithm uses neighborhood information to choose the node to which the message is forwarded. It limits the number of hops in the source-destination path by reducing the occurrence of loops in it. The second algorithm, Virtual Path (VP), is tailored to long-lasting entities that cooperate intensively by exchanging messages. It achieves efficiency by finding a path at the beginning and following that path for several messages. For performance's sake, this algorithm partially renounces the HSA algorithm's adaptiveness
3, No. 1
61
74
Adaptive Routing Strategies for Dynamic Applications in Massively Parallel Architectures / Boari, M.; Corradi, A; Leonardi, Letizia; Stefanelli, C.. - In: IEEE PARALLEL & DISTRIBUTED TECHNOLOGY. - ISSN 1063-6552. - STAMPA. - 3, No. 1:(1995), pp. 61-74. [10.1109/88.384585]
Boari, M.; Corradi, A; Leonardi, Letizia; Stefanelli, C.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/454186
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 3
social impact