Sparse Matrix Code Dependence Analysis Simplification at Compile Time - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2018

Sparse Matrix Code Dependence Analysis Simplification at Compile Time

(1) , (2) , (3) , (3) , (4) , (3) , (5) , (1)
1
2
3
4
5

Domains

Computer Science [cs] Programming Languages [cs.PL]

Tomofumi Yuki  : Connect in order to contact the contributor

https://hal.inria.fr/hal-01942381

Submitted on : Monday, December 3, 2018-10:55:20 AM

Last modification on : Wednesday, February 8, 2023-5:11:05 PM

Not file

Dates and versions

hal-01942381 , version 1 (03-12-2018)

Identifiers

  • HAL Id : hal-01942381 , version 1

Cite

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 Dublin Core DC Terms EndNote Datacite

Collections

UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA CENTRALESUPELEC INRIA2 LARA UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
39 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More