skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Sparse Matrix-Vector Multiplication on Multicore and Accelerators

Abstract

This chapter consolidates recent work on the development of high performance multicore and accelerator-based implementations of sparse matrix-vector multiplication (SpMV). As an object of study, SpMV is an interesting computation for two key reasons. First, it appears widely in applications in scientific and engineering computing, financial and economic modeling, and information retrieval, among others, and is therefore of great practical interest. Secondly, it is both simple to describe but challenging to implement well, since its performance is limited by a variety of factors, including low computational intensity, potentially highly irregular memory access behavior, and a strong input dependence that be known only at run time. Thus, we believe SpMV is both practically important and provides important insights for understanding the algorithmic and implementation principles necessary to making effective use of state-of-the-art systems.

Authors:
 [1];  [2];  [3];  [2];  [1];  [3]
  1. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
  2. NVIDIA Research, Santa Clara, CA (United States)
  3. Georgia Inst. of Technology, Atlanta, GA (United States)
Publication Date:
Research Org.:
Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
OSTI Identifier:
1407092
DOE Contract Number:
AC02-05CH11231
Resource Type:
Book
Resource Relation:
Journal Volume: 20102756; Related Information: Book Title: Scientific Computing with Multicore and Accelerators
Country of Publication:
United States
Language:
English
Subject:
43 PARTICLE ACCELERATORS

Citation Formats

Williams, Samuel W., Bell, Nathan, Choi, Jee Whan, Garland, Michael, Oliker, Leonid, and Vuduc, Richard. Sparse Matrix-Vector Multiplication on Multicore and Accelerators. United States: N. p., 2010. Web. doi:10.1201/b10376-8.
Williams, Samuel W., Bell, Nathan, Choi, Jee Whan, Garland, Michael, Oliker, Leonid, & Vuduc, Richard. Sparse Matrix-Vector Multiplication on Multicore and Accelerators. United States. doi:10.1201/b10376-8.
Williams, Samuel W., Bell, Nathan, Choi, Jee Whan, Garland, Michael, Oliker, Leonid, and Vuduc, Richard. Tue . "Sparse Matrix-Vector Multiplication on Multicore and Accelerators". United States. doi:10.1201/b10376-8. https://www.osti.gov/servlets/purl/1407092.
@article{osti_1407092,
title = {Sparse Matrix-Vector Multiplication on Multicore and Accelerators},
author = {Williams, Samuel W. and Bell, Nathan and Choi, Jee Whan and Garland, Michael and Oliker, Leonid and Vuduc, Richard},
abstractNote = {This chapter consolidates recent work on the development of high performance multicore and accelerator-based implementations of sparse matrix-vector multiplication (SpMV). As an object of study, SpMV is an interesting computation for two key reasons. First, it appears widely in applications in scientific and engineering computing, financial and economic modeling, and information retrieval, among others, and is therefore of great practical interest. Secondly, it is both simple to describe but challenging to implement well, since its performance is limited by a variety of factors, including low computational intensity, potentially highly irregular memory access behavior, and a strong input dependence that be known only at run time. Thus, we believe SpMV is both practically important and provides important insights for understanding the algorithmic and implementation principles necessary to making effective use of state-of-the-art systems.},
doi = {10.1201/b10376-8},
journal = {},
number = ,
volume = 20102756,
place = {United States},
year = {Tue Dec 07 00:00:00 EST 2010},
month = {Tue Dec 07 00:00:00 EST 2010}
}

Book:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this book.

Save / Share: