8 papers
Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
Yen-Hsiang Chang, Aydın Buluç, James Demmel
The approximate minimum degree algorithm is widely used before numerical factorization to reduce fill-in for sparse matrices. While considerable attention has been given to the num…
Fast Algorithms for Scheduling Many-body Correlation Functions on Accelerators
Oguz Selvitopi, Emin Ozturk, Jie Chen +3
Computation of correlation functions is a key operation in Lattice quantum chromodynamics (LQCD) simulations to extract nuclear physics observables. These functions involve many bi…
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…
Anonymized Network Sensing Graph Challenge
Hayden Jananthan, Michael Jones, William Arcand +26
The MIT/IEEE/Amazon GraphChallenge encourages community approaches to developing new solutions for analyzing graphs and sparse data derived from social media, sensor feeds, and sci…
Parallel GPU-Accelerated Randomized Construction of Approximate Cholesky Preconditioners
Tianyu Liang, Chao Chen, Yotam Yaniv +5
We introduce a parallel algorithm to construct a preconditioner for solving a large, sparse linear system where the coefficient matrix is a Laplacian matrix (a.k.a., graph Laplacia…
An Efficient Sparse Kernel Generator for O(3)-Equivariant Deep Networks
Vivek Bharadwaj, Austin Glover, Aydin Buluc +1
Rotation equivariant graph neural networks, i.e. networks designed to guarantee certain geometric relations between their inputs and outputs, yield state of the art performance on…