An Implementation of the Unordered Parallel RCM for Bandwidth Reduction of Large Sparse Matrices
DOI:
https://doi.org/10.5540/03.2017.005.01.0097Palabras clave:
Parallel RCM, Sparse Matrix, Unordered Breadth-first Search, OpenMP.Resumen
This paper describes an implementation of the Unordered Parallel Reverse Cuthill-McKee algorithm which is compared with its well-known serial version. The OpenMP framework is used for supporting the parallelism and a strategy for reducing lazy threads is evaluated. Large sparse matrices are used to test sequential and parallel approaches. The computational cost reduction and the quality of matrices bandwidth minimization are validated by CPU time and speedup.
Descargas
Los datos de descargas todavía no están disponibles.
Descargas
Publicado
2017-04-14
Número
Sección
Trabalhos Completos - Computação Científica