8 citations · 15 across the 6 of their papers we have counts for
7 papers
A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication
Yuxi Hong, Aydin Buluc
Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and randomi…
Space Efficient Sequence Alignment for SRAM-Based Computing: X-Drop on the Graphcore IPU
Luk Burchard, Max Xiaohang Zhao, Johannes Langguth +2
Dedicated accelerator hardware has become essential for processing AI-based workloads, leading to the rise of novel accelerator architectures. Furthermore, fundamental differences…
Large Scale Enrichment and Statistical Cyber Characterization of Network Traffic (Enriquecimiento a gran escala y caracterización cibernética estadística del tráfico de red)
Ivan Kawaminami, Arminda Estrada, Youssef Elsakkary +9
Modern network sensors continuously produce enormous quantities of raw data that are beyond the capacity of human analysts. Cross-correlation of network sensors increases this chal…
Distributed-Memory Parallel Contig Generation for De Novo Long-Read Genome Assembly
Giulia Guidi, Gabriel Raulet, Daniel Rokhsar +3
De novo genome assembly, i.e., rebuilding the sequence of an unknown genome from redundant and erroneous short sequences, is a key but computationally intensive step in many genomi…
Parallel Algorithms for Adding a Collection of Sparse Matrices
Md Taufique Hussain, Guttu Sai Abhishek, Aydin Buluç +1
We develop a family of parallel algorithms for the SpKAdd operation that adds a collection of k sparse matrices. SpKAdd is a much needed operation in many applications including di…
A work-efficient parallel sparse matrix-sparse vector multiplication algorithm
Ariful Azad, Aydin Buluc
We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are…