Authors: Md Nahid Newaz and Md Atiqul Mollah (Oakland University), Peyman Faizian (Florida State University), and Zhou Tong (Wheaton College)
Abstract: The Megaﬂy topology has recently been proposed as an eﬃcient, hierarchical way to interconnect large-scale high-performance computing systems. Megaﬂy networks may be constructed in various group sizes and conﬁgurations, but it is challenging to maintain high throughput performance on all such variants. A robust topology-speciﬁc adaptive routing scheme, therefore, is needed to utilize the topological advantages of Megaﬂy. Currently, Progressive Adaptive Routing (PAR) is the best known routing scheme for Megaﬂy networks, but its performance is not fully known across all scales and conﬁgurations. In this research poster, with the use of trace-driven simulation experiments, we show that the current PAR scheme performs sub-optimally on Megaﬂy networks with a large number of groups. As better alternatives, we propose two new practical adaptive routing schemes, KAPR and KU-GCN, that can improve the communication performance of Megaﬂy at any scale and conﬁguration.
Best Poster Finalist (BP): no
Poster summary: PDF
Back to Poster Archive Listing