Presentation
Poster 29: Optimal Routing for a Family of Scalable Interconnection Networks
Event Type
ACM Student Research Competition: Graduate Posters
ACM Student Research Competition: Undergraduate Posters
Posters
TP
EX
EXH
Student Program
TimeThursday, 21 November 20198:30am - 5pm
LocationE Concourse
DescriptionWe propose a scheme to construct a family of large and high-performance interconnection networks that are scalable, low-radix, minimum diameters. These networks, whose diameters grow linearly as their sizes grow exponentially, are generated by using the Cartesian products of smaller optimal networks of minimum diameters. For the smaller base networks, we design the vertex-balanced routing algorithm by considering the forwarding pressure at each vertex. Comparative benchmarks on a Beowulf cluster show significant improvement in performance after using the new routing algorithm. Each node of the new network generated from base graphs with low-diameter can also sustain balanced forwarding loadings if we apply optimal routing algorithms to the base network. Simulation results for larger networks show that the optimal routing algorithms achieve the gain of communication performance.
Archive
