Data structures to vectorize CG algorithms for general sparsity patterns |
| |
Authors: | Gaia Valeria Paolini Giuseppe Radicati Di Brozolo |
| |
Affiliation: | (1) IBM European Center for Scientific and Engineering Computing, via Giorgione 159, 00147 Roma, Italy |
| |
Abstract: | We describe an implementation of Conjugate Gradient-type iterative algorithms for problems with general sparsity patterns on a vector processor with a hierarchy of memories, such as the IBM 3090/VF. The implementation relies on the wavefront approach to vectorize the solution of the two sparse triangular systems that arise when using ILU type preconditioners. The data structure is the key to an effective implementation of sparse computational kernels on a vector processor. A data structure is a combination of a layout of the matrix coefficients and ordering schemes for the vectors to increase data locality. With the data structure we describe, we achieve comparable performance on both the matrix-vector product and the solution of the sparse triangular systems on a variety of real problems, such as those arising from large scale reservoir simulation or structural analysis. |
| |
Keywords: | 65F10 |
本文献已被 SpringerLink 等数据库收录! |
|