Node aware sparse matrix–vector multiplication

Bienz, Amanda; Gropp, William D.; Olson, Luke N.

doi:10.1016/j.jpdc.2019.03.016

Title: Node aware sparse matrix–vector multiplication

Full Record
Other Related Research

Authors:

;

Publication Date:: Thu Aug 01 00:00:00 EDT 2019

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1547559

Grant/Contract Number:: NA0002374

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Journal of Parallel and Distributed Computing

Additional Journal Information:: Journal Name: Journal of Parallel and Distributed Computing Journal Volume: 130 Journal Issue: C; Journal ID: ISSN 0743-7315

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Citation Formats


                    Bienz, Amanda, Gropp, William D., and Olson, Luke N. Node aware sparse matrix–vector multiplication.  United States: N. p., 2019. 
Web.  doi:10.1016/j.jpdc.2019.03.016.

Copy to clipboard


                    Bienz, Amanda, Gropp, William D., & Olson, Luke N. Node aware sparse matrix–vector multiplication.  United States.  https://doi.org/10.1016/j.jpdc.2019.03.016

Copy to clipboard


                    Bienz, Amanda, Gropp, William D., and Olson, Luke N. Thu .  
"Node aware sparse matrix–vector multiplication".  United States.  https://doi.org/10.1016/j.jpdc.2019.03.016.

Copy to clipboard


                    
@article{osti_1547559,

  title        = {Node aware sparse matrix–vector multiplication},

  author       = {Bienz, Amanda and Gropp, William D. and Olson, Luke N.},

  abstractNote = {},

  doi          = {10.1016/j.jpdc.2019.03.016},

  journal      = {Journal of Parallel and Distributed Computing},

  number       = C,

  volume       = 130,

  place        = {United States},

  year         = {Thu Aug 01 00:00:00 EDT 2019},

  month        = {Thu Aug 01 00:00:00 EDT 2019}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.jpdc.2019.03.016

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 10 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Node aware sparse matrix–vector multiplication

Journal Article Bienz, Amanda ; Gropp, William D. ; Olson, Luke N. - Journal of Parallel and Distributed Computing

Not provided.
https://doi.org/10.1016/j.jpdc.2019.03.016
A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

Journal Article Ghale, Purnima ; Johnson, Harley T. - Computer Physics Communications

Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in themore »« less
Cited by 3
https://doi.org/10.1016/j.cpc.2018.02.008

Full Text Available
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm

Journal Article Azad, Ariful ; Buluc, Aydin - Proceedings - IEEE International Parallel and Distributed Processing Symposium (IPDPS)

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 all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work efficient in the sense that its total work is proportional to the number of arithmetic operations required.more »« less
Cited by 21
https://doi.org/10.1109/IPDPS.2017.76

Full Text Available
SIMD extensions to "block sparse matrix" assembly and matrix-vector multiplication.

Conference Tupek, Michael R. ; Pierson, Kendall H ; Howard, Micah.

Abstract not provided.
Full Text Available
Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations

Conference Aktulga, Hasan Metin ; Buluc, Aydin ; Williams, Samuel ; ...

Obtaining highly accurate predictions on the properties of light atomic nuclei using the configuration interaction (CI) approach requires computing a few extremal Eigen pairs of the many-body nuclear Hamiltonian matrix. In the Many-body Fermion Dynamics for nuclei (MFDn) code, a block Eigen solver is used for this purpose. Due to the large size of the sparse matrices involved, a significant fraction of the time spent on the Eigen value computations is associated with the multiplication of a sparse matrix (and the transpose of that matrix) with multiple vectors (SpMM and SpMM-T). Existing implementations of SpMM and SpMM-T significantly underperform expectations.more »« less
https://doi.org/10.1109/IPDPS.2014.125

Full Text Available

Similar Records