2010
DOI: 10.1016/j.procs.2010.04.016
|View full text |Cite
|
Sign up to set email alerts
|

Runtime sparse matrix format selection

Abstract: There exist many storage formats for the in-memory representation of sparse matrices. Choosing the format that yields the quickest processing of any given sparse matrix requires considering the exact non-zero structure of the matrix, as well as the current execution environment. Each of these factors can change at runtime. The matrix structure can vary as computation progresses, while the environment can change due to varying system load, the live migration of jobs across a heterogeneous cluster, etc. This pap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Reinforcement learning has also been applied to other sparse matrix problems such as selecting a storage format that leads to fast matrix-vector multiplication [13].…”
Section: Machine Learning Based Recommendation Systemsmentioning
confidence: 99%
“…Reinforcement learning has also been applied to other sparse matrix problems such as selecting a storage format that leads to fast matrix-vector multiplication [13].…”
Section: Machine Learning Based Recommendation Systemsmentioning
confidence: 99%