Searching. Please wait…

Polarized routing for large interconnection networks

Abstract: Supercomputers and datacenters comprise hundreds of thousands of servers. Different network topologies have been proposed to attain such a high scalability, from flattened Butterfly and Dragonfly to the most disruptive Jellyfish, which is based on a random graph. The routing problem on such networks remains a challenge that can be tackled either as a topology-aware solution or with an agnostic approach. The case of random networks is a very special one since no a priori topological clues can be exploited. In this article, we introduce the polarized routing algorithm, an adaptive nonminimal hop-by-hop mechanism that can be used in most of topologies, including Jellyfish. Polarized routing follows two design criteria: a source-destination symmetry in the routes and avoiding backtracking. Experimental evaluation proves that polarized routing not only outperforms other routings in random graphs but also attains the best performance provided by ad hoc solutions for specific outstanding low-diameter interconnection networks.

 Authorship: Camarero C., Martinez C., Beivide R.,

 Fuente: IEEE Micro, 2022, 42(2), 61-67

 Publisher: IEEE Computer Society

 Publication date: 11/01/2022

 No. of pages: 7

 Publication type: Article

 DOI: 10.1109/MM.2021.3139392

 ISSN: 0272-1732,1937-4143

 Spanish project: PID2019-105660RB- C22

 Publication Url: