71 citations · 129 across the 11 of their papers we have counts for
19 papers · 1 filter
Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
Gabriel Raulet, Dmitriy Morozov, Aydin Buluc +1
Computing fixed-radius near-neighbor graphs is an important first step for many data analysis algorithms. Near-neighbor graphs connect points that are close under some metric, endo…
Distributed-Memory Sparse Kernels for Machine Learning
Vivek Bharadwaj, Aydin Buluç, James Demmel
Sampled Dense Times Dense Matrix Multiplication (SDDMM) and Sparse Times Dense Matrix Multiplication (SpMM) appear in diverse settings, such as collaborative filtering, document cl…
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems
Ariful Azad, Oguz Selvitopi, Md Taufique Hussain +2
Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial B…
10 Years Later: Cloud Computing is Closing the Performance Gap
Giulia Guidi, Marquita Ellis, Aydin Buluc +2
Can cloud computing infrastructures provide HPC-competitive performance for scientific applications broadly? Despite prolific related literature, this question remains open. Answer…
Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly
Giulia Guidi, Oguz Selvitopi, Marquita Ellis +3
One of the most computationally intensive tasks in computational biology is de novo genome assembly, the decoding of the sequence of an unknown genome from redundant and erroneous…
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale
Md Taufique Hussain, Oguz Selvitopi, Aydin Buluç +1
Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs perf…