Presentation
Analyzing Alltoall Algorithms with SST
DescriptionAlltoall collective operations in MPI are critical in several types of computation, including matrix multiplication and transposition, and machine learning applications. As a result, it is critical that these operations are performant for large amounts of data. Meanwhile, dragonfly networks are becoming more common in state-of-the-art supercomputers. However, there has been little analysis of the performance of alltoall operations on these networks. The hierarchical and modular nature of dragonfly networks results in distinct challenges in alltoall operations, though typical alltoall algorithms fail to account for topology. In this poster, we analyze the performance of the alltoall algorithm in four scenarios, and discuss the conditions under which each algorithm performs best.

Event Type
ACM Student Research Competition: Graduate Poster
ACM Student Research Competition: Undergraduate Poster
Doctoral Showcase
Posters
TimeTuesday, 19 November 202412pm - 5pm EST
LocationB302-B305
TP
XO/EX