Sciweavers

IPPS
1998
IEEE

Local Enumeration Techniques for Sparse Algorithms

14 years 3 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance Fortran. These methods deal only with loops without any irregular references. However, existing techniques are not enough when the code includes sparse references. In this work, some methods for enumeration of references are proposed and tested for some linear sparse algebra algorithms. We use the BRS(k) distribution for sparse matrices, which is a generalization of the dense CYCLIC(k) distribution. Efficiency evaluation for the proposed methods has been performed on different processors.
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapata
Comments (0)