25 citations · 26 across the 4 of their papers we have counts for
4 papers
Flowcut Switching: High-Performance Adaptive Routing with In-Order Delivery Guarantees
Tommaso Bonato, Daniele De Sensi, Salvatore Di Girolamo +4
Network latency severely impacts the performance of applications running on supercomputers. Adaptive routing algorithms route packets over different available paths to reduce laten…
Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching
András Strausz, Flavio Vella, Salvatore Di Girolamo +2
Triangle count and local clustering coefficient are two core metrics for graph analysis. They find broad application in analyses such as community detection and link recommendation…
Network-Accelerated Non-Contiguous Memory Transfers
Salvatore Di Girolamo, Konstantin Taranov, Andreas Kurth +7
Applications often communicate data that is non-contiguous in the send- or the receive-buffer, e.g., when exchanging a column of a matrix stored in row-major order. While non-conti…
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
Maciej Besta, Marcel Schneider, Karolina Cynk +5
We introduce FatPaths: a simple, generic, and robust routing architecture that enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performanc…