By Topic

Mapping the preconditioned conjugate gradient algorithm for neutron diffusion applications onto parallel machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
So, J.J.E. ; Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA ; Janardhan, R. ; Downar, T.J. ; Siegel, H.J.

This is a study of the performance on different parallel machines of the solution to the system of linear equations that results from the finite-differencing of the neutron diffusion equation in the context of nuclear reactor simulation. The solution approach uses the CG (conjugate gradient) and the PCG (preconditioned CG) methods. For PCG, a block preconditioner based on the incomplete Cholesky factorization was used. The issues involved in mapping the CG and the PCG algorithms onto the mixed-mode PASM prototype, the SIMD MasPar MP-1, and the MIMD Intel Paragon XPIS are discussed. On PASM, the mixed-mode implementation outperformed either SIMD or MIMD alone. Theoretical performance predictions were analyzed and compared with the experimental results on the MasPar MP-1 and the Paragon XPIS. Other issues addressed for all three machines include the impact on execution time of the number of processors used and the impact of the interprocessor communication network on performance

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:2 )

Date of Conference:

12-16 Aug 1996