Scalable Task-Based Algorithm for Multiplication of Block-Rank-Sparse Matrices

Abstract

A task-based formulation of Scalable Universal Matrix Multiplication Algorithm (SUMMA), a popular algorithm for matrix multiplication (MM), is applied to the multiplication of hierarchy-free, rank-structured matrices that appear in the domain of quantum chemistry (QC). The novel features of our formulation are: (1) concurrent scheduling of multiple SUMMA iterations, and (2) fine-grained task-based composition. These features make it tolerant of the load imbalance due to the irregular matrix structure and eliminate all artifactual sources of global synchronization.Scalability of iterative computation of square-root inverse of block-rank-sparse QC matrices is demonstrated; for full-rank (dense) matrices the performance of our SUMMA formulation usually exceeds that of the state-of-the-art dense MM implementations (ScaLAPACK and Cyclops Tensor Framework).

8 pages, 6 figures, accepted to IA3 2015. arXiv admin note: text overlap with arXiv:1504.05046

Cited by in corpus (9)

• Nuclear energy gradients for internally contracted complete active space second-order perturbation theory: Multistate extensions
• Roadmap on Electronic Structure Codes in the Exascale Era
• Exploration of Reduced Scaling Formulation of Equation of Motion Coupled-Cluster Singles and Doubles Based on State-Averaged Pair Natural Orbitals
• Clustered Low-Rank Tensor Format: Introduction and Application to Fast Construction of Hartree-Fock Exchange
• Distributed Memory, GPU Accelerated Fock Construction for Hybrid, Gaussian Basis Density Functional Theory
• Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network
• Equation Generator for Equation-of-Motion Coupled Cluster Assisted by Computer Algebra System
• "Best" iterative coupled-cluster triples model: More evidence for 3CC
• Shifting sands of hardware and software in exascale quantum mechanical simulations