Sparse Matrix Code Dependence Analysis Simplification at Compile Time

Mahdi Soltan Mohammadi 1 Kazem Cheshmi 2 Ganesh Gopalakrishnan 3 Mary Hall 3 Maryam Mehri Dehnavi 4 Anand Venkat 3 Tomofumi Yuki 5 Michelle Mills Strout 1
1 University of Arizona
2 University of Toronto
3 University of Utah
4 RU - Rutgers, The State University of New Jersey [New Brunswick]
5 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Document type :
Reports
Complete list of metadatas
https://hal.inria.fr/hal-01942381
Contributor : Tomofumi Yuki <>
Submitted on : Monday, December 3, 2018 - 10:55:20 AM
Last modification on : Friday, September 13, 2019 - 9:49:43 AM

Identifiers

  • HAL Id : hal-01942381, version 1

Collections

CNRS | UNIV-RENNES1 | LARA | CENTRALESUPELEC | IRISA | INRIA | UNIV-RENNES | UR1-UFR-ISTIC

Citation

Mahdi Soltan Mohammadi, Kazem Cheshmi, Ganesh Gopalakrishnan, Mary Hall, Maryam Mehri Dehnavi, et al.. Sparse Matrix Code Dependence Analysis Simplification at Compile Time. [Research Report] Arxiv. 2018. ⟨hal-01942381⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

86

 

 

Contact

archive-ouverte@inria.fr