The Community for Technology Leaders
RSS Icon
Subscribe
Universit? of Lille 1, France
July 4, 2005 to July 6, 2005
ISBN: 0-7695-2434-6
pp: 163-172
Boguslaw Butrylo , Bialystok Technical University
Marek Tudruj , Polish-Japanese Institute of Information Technology, Poland
Lukasz Masko , Polish Academy of Sciences, Poland
Laurent Nicolas , de Lyon (CEGELY) UMR CNRS
ABSTRACT
The paper concerns efficient parallel computation methods for solving matrix linear equations using the preconditioned conjugate gradient method. Efficient parallelization methods of the preconditioner module have been proposed based on execution in a special architecture of dynamically reconfigurable shared memory clusters. The assumed system is provided with a novel efficient inter-processor communication technique called ?communication on the fly?, which is very suitable for fine grain parallel computations. Two-step parallel data decomposition is implemented in the elaborated preconditioner, which leads to the decrease of computation grain and overlapping of communication with computations. Comparative experimental results are presented of program execution efficiency in a standard distributed multicomputer cluster based on message passing and in the architecture of dynamic SMP clusters with the communication on the fly.
INDEX TERMS
null
CITATION
Boguslaw Butrylo, Marek Tudruj, Lukasz Masko, Laurent Nicolas, "SSOR Preconditioned Conjugate Gradient Algorithm in Dynamic SMP Clusters with Communication on the Fly", ISPDC, 2005, Parallel and Distributed Computing, International Symposium on, Parallel and Distributed Computing, International Symposium on 2005, pp. 163-172, doi:10.1109/ISPDC.2005.44
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool