Efficient Monte Carlo Linear Solver with Chain Reduction and Optimization Using PLFG

  • Authors:
  • Maria Isabel Casas Villalba;Chih Jeng Kenneth Tan

  • Affiliations:
  • -;-

  • Venue:
  • HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we show a Monte Carlo linear solver with chain reduction and optimization, coupled with PLFG, a parallel pseudo-random generator. PLFG, designed for MIMD architectures, is highly scalable and with the default parameters chosen, it provides an astronomical period of a t lea st 229 (223209 - 1). Numerical experiment results show that Monte Carlo method with chain optimization and reduction gives much better estimates of the solution vector.