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

Title: Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing.

Abstract

Abstract not provided.

Authors:
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
OSTI Identifier:
1594338
Report Number(s):
SAND2018-11134C
669602
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the ScalA18: 9th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems ScalA18: 9th Workshop on Latest Advances in Scalable Algorithm held November 11-16, 2018 in Dallas, Texas.
Country of Publication:
United States
Language:
English

Citation Formats

Elliott, James John,, and Siefert, Christopher. Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing.. United States: N. p., 2018. Web.
Elliott, James John,, & Siefert, Christopher. Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing.. United States.
Elliott, James John,, and Siefert, Christopher. Mon . "Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing.". United States. https://www.osti.gov/servlets/purl/1594338.
@article{osti_1594338,
title = {Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing.},
author = {Elliott, James John, and Siefert, Christopher},
abstractNote = {Abstract not provided.},
doi = {},
url = {https://www.osti.gov/biblio/1594338}, journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {10}
}

Conference:
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 conference proceeding.

Save / Share: