3 citations · 3 across the 4 of their papers we have counts for
8 papers
SpSYRK: Half the Work in Distributed Sparse Matrix Multiplication
Thomas McFarland, Julian Bellavita, Giulia Guidi
The symmetric rank- update (SYRK), $\C = \A\A^\top$, computes the dot product between each pair of rows of $\A$, producing the Gram matrix $\C$. Its sparse variant underpins sim…
Mixed-Precision Communication-Avoiding SGD for Generalized Linear Models on GPUs
Aditya Devarakonda, Irene Simó Muñoz, Giulia Guidi
Distributed stochastic gradient descent (SGD) is limited by communication rather than computation, since each iteration requires an AllReduce across processes. Communication-avoidi…
Rapid GPU-Based Pangenome Graph Layout
Jiajie Li, Jan-Niklas Schmelzle, Yixiao Du +6
Computational Pangenomics is an emerging field that studies genetic variation using a graph structure encompassing multiple genomes. Visualizing pangenome graphs is vital for under…
Ocean: Fast Estimation-Based Sparse General Matrix-Matrix Multiplication on GPU
Yifan Li, Giulia Guidi
In computational science and data analytics, many workloads involve irregular and sparse computations that are inherently difficult to optimize for modern hardware. A key kernel is…
Communication-Avoiding SpGEMM via Trident Partitioning on Hierarchical GPU Interconnects
Julian Bellavita, Lorenzo Pichetti, Thomas Pasquali +2
The multiplication of two sparse matrices, known as SpGEMM, is a key kernel in scientific computing and large-scale data analytics, underpinning graph algorithms, machine learning,…
Communication-Avoiding Linear Algebraic Kernel K-Means on GPUs
Julian Bellavita, Matthew Rubino, Nakul Iyer +4
Clustering is an important tool in data analysis, with K-means being popular for its simplicity and versatility. However, it cannot handle non-linearly separable clusters. Kernel K…