Load-balanced Routing for Nested Interconnection Networks

Abstract

We introduced the load-balanced routing algorithms, for interconnection networks resulting from nesting, by considering the pressure of the data forwarding in each node. Benchmarks on a small cluster with various network topologies, and simulations for several larger clusters whose prototypes are too costly to construct, demonstrated substantial gains of communication performance with our routing on these networks over other mainstream routing algorithms.

Parts of the results in this manuscript were presented as a Poster at the SC'19 ACM Student Research Competition.(https://sc19.supercomputing.org/proceedings/src_poster/src_poster_pages/spostg138.html). This version of manuscript has been heavily improved with feedbacks from the Poster review committee and visitors to our Poster during SC'19