Monte Carlo Photon Transport On Shared Memory and Distributed Memory Parallel Processors
- 1 September 1987
- journal article
- research article
- Published by SAGE Publications in The International Journal of Supercomputing Applications
- Vol. 1 (3) , 57-74
- https://doi.org/10.1177/109434208700100306
Abstract
Parallelized Monte Carlo algorithms for analyzing photon transport in an inertially confined fusion (ICF) plasma are consid ered. Algorithms were developed for shared memory (vector and scalar) and distributed memory (scalar) parallel pro cessors. The shared memory algorithm was implemented on the IBM 3090/400, and timing results are presented for dedi cated runs with two, three, and four pro cessors. Two alternative distributed memory algorithms (replication and dis patching) were implemented on a hyper cube parallel processor (1 through 64 nodes). The replication algorithm yields essentially full efficiency for all cube sizes; with the 64-node configuration, the absolute performance is nearly the same as with the CRAY X-MP The dispatching algorithm also yields efficiencies above 80% in a large simulation for the 64-pro cessor configuration.Keywords
This publication has 3 references indexed in Scilit:
- Monte Carlo photon transport on a vector supercomputerIBM Journal of Research and Development, 1986
- Pseudo-random trees in Monte CarloParallel Computing, 1984
- Validity of the single processor approach to achieving large scale computing capabilitiesPublished by Association for Computing Machinery (ACM) ,1967