- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources5
- Resource Type
-
0005000000000000
- More
- Availability
-
50
- Author / Contributor
- Filter by Author / Creator
-
-
Misailovic, Sasa (2)
-
Chekuri, Chandra (1)
-
Dutta, Saikat (1)
-
ElFarouk, Harb (1)
-
Fernando, Vimuth (1)
-
Heidarshenas, Azin (1)
-
Hutter, Edward (1)
-
Joshi, Keyur (1)
-
Laurel, Jacob (1)
-
Morrison, Adam (1)
-
Quanrud, Kent (1)
-
Shi, August (1)
-
Solomonik, Edgar (1)
-
Torrellas, Josep (1)
-
Yesil, Serif (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
- Filter by Editor
-
-
null (1)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Sparse Matrix-Vector Multiplication (SpMV) is an essential sparse kernel. Numerous methods have been developed to accelerate SpMV. However, no single method consistently gives the highest performance across a wide range of matrices. For this reason, a performance prediction model is needed to predict the best SpMV method for a given sparse matrix. Unfortunately, predicting SpMV’s performance is challenging due to the diversity of factors that impact it. In this work, we develop a machine learning framework called WISE that accurately predicts the magnitude of the speedups of different SpMV methods over a baseline method for a given sparse matrix. WISE relies on a novel feature set that summarizes a matrix’s size, skew, and locality traits. WISE can then select the best SpMV method for each specific matrix. With a set of nearly 1,500 matrices, we show that using WISE delivers an average speedup of 2.4× over using Intel’s MKL in a 24-core server.more » « less
-
ElFarouk, Harb; Quanrud, Kent; Chekuri, Chandra (, Conference on Neural Information Processing Systems)
-
Fernando, Vimuth; Joshi, Keyur; Laurel, Jacob; Misailovic, Sasa (, 2021 in Runtime Verification)
-
Dutta, Saikat; Shi, August; Misailovic, Sasa (, Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering)
-
Hutter, Edward; Solomonik, Edgar (, 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS))null (Ed.)
An official website of the United States government

Full Text Available