9 papers
High-Performance Star-M SVD for Big Data Compression
Md Taufique Hussain, Grey Ballard, Aditya Devarakonda +3
In the era of big data, effectively compressing large datasets while performing complex mathematical operations is crucial. Tensor-based decomposition methods have shown superior c…
Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
Hussam Al Daas, Grey Ballard, Laura Grigori +4
Sketching is widely used in randomized linear algebra for low-rank matrix approximation, column subset selection, and many other problems, and it has gained significant traction in…
Distributed-memory Algorithms for Sparse Matrix Permutation, Extraction, and Assignment
Elaheh Hassani, Md Taufique Hussain, Ariful Azad
We present scalable distributed-memory algorithms for sparse matrix permutation, extraction, and assignment. Our methods follow an Identify-Exchange-Build (IEB) strategy where each…
Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication
Isuru Ranawaka, Md Taufique Hussain, Charles Block +3
We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant, called TS-SpGEMM, has importan…
Parallel Algorithms for Median Consensus Clustering in Complex Networks
Md Taufique Hussain, Mahantesh Halappanavar, Samrat Chatterjee +3
We develop an algorithm that finds the consensus of many different clustering solutions of a graph. We formulate the problem as a median set partitioning problem and propose a gree…
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…
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…
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…
Optimizing High Performance Markov Clustering for Pre-Exascale Architectures
Oguz Selvitopi, Md Taufique Hussain, Ariful Azad +1
HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand…