187 citations · 1k across the 59 of their papers we have counts for
6 papers · 1 filter
BCL: A Cross-Platform Distributed Container Library
Benjamin Brock, Aydın Buluç, Katherine Yelick
One-sided communication is a useful paradigm for irregular parallel applications, but most one-sided programming environments, including MPI's one-sided interface and PGAS programm…
Extreme Scale De Novo Metagenome Assembly
Evangelos Georganas, Rob Egan, Steven Hofmeyr +6
Metagenome assembly is the process of transforming a set of short, overlapping, and potentially erroneous DNA segments from environmental samples into the accurate representation o…
Implementing Push-Pull Efficiently in GraphBLAS
Carl Yang, Aydin Buluc, John D. Owens
We factor Beamer's push-pull, also known as direction-optimized breadth-first-search (DOBFS) into 3 separable optimizations, and analyze them for generalizability, asymptotic speed…
High-performance sparse matrix-matrix products on Intel KNL and multicore architectures
Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad +1
Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is widely used in areas ranging from traditional numerical applications to recent big data analysis a…
Design Principles for Sparse Matrix Multiplication on the GPU
Carl Yang, Aydin Buluc, John D. Owens
We implement two novel algorithms for sparse-matrix dense-matrix multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the popular compressed-sparse-row (CSR)…
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
Ariful Azad, Aydın Buluc, Xiaoye S. Li +2
We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted bipartite graph such that weights on the edges of the matching are large. This…