Skip to main content
Conference ProceedingsOPEN ACCESS

Automatic parallelization of sparse matrix computations: A static analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 340-348
DOI: 10.1007/3-540-44520-x_45
1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This article deals with the definition of a new method for the automatic parallelisation of sequential programs working on dense matrices for generating a parallel counterpart working on sparse matrices.

Author supplied keywords

Cite

CITATION STYLE

APA

Adle, R., Aiguier, M., & Delaplace, F. (2000). Automatic parallelization of sparse matrix computations: A static analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 340–348). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free