Data Locality Exploitation in the Decomposition of Regular Domain Problems
IEEE Transactions on Parallel and Distributed Systems
A robust multigrid solver on parallel computers
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
| Hi-index | 0.00 |
The aim of this paper is the study of different methods for the solution of alternating-line problems, taking into account the evolution of architectural parameters on modern parallel computers, i.e. processors, memory hierarchy, and interconnection network performance. Three different kinds of solvers are studied: The Pipelined Gaussian Elimination scheme, the Matrix Transposition scheme, and the new one which is presented in this paper: the Mapping Transposition scheme, whose performance clearly betters, in many cases, that obtained by all the other methods, due to its better fitting to the characteristics of modern parallel computers. The experimental results have been obtained on a Cray T3E and on an SGI Origin 2000, up to 512 and 32 processors, respectively.