Workshops Archive

IA^3 - Invited Talk 2: Communicating more—asynchronously—saves time

Workshop: IA^3 2025 — 15th Workshop on Irregular Applications: Architectures and Algorithms

Authors: Richard Vuduc (Georgia Institute of Technology)

Abstract: The mantra of parallel algorithms is "minimize communication." We counter this view by showing instances where communicating more, not less, saves time. While these examples come primarily from applications in graph analytics with fine-grained communication and irregular parallelism, there are also instances in dense matrix computation where a similar conclusion may hold, at least in theory. The key technique is asynchronous, aggressively overlapped communication. A question I will pose is whether overlapping is merely a performance engineering concern, or whether there is anything algorithmically deeper about it “under the hood.”

Back to IA^3 2025 — 15th Workshop on Irregular Applications: Architectures and Algorithms Archive Listing Back to Full Workshop Archive Listing