Monte Carlo photon transport on shared memory and distributed memory parallel processors
Parallelized Monte Carlo algorithms for analyzing photon transport in an inertially confined fusion (ICF) plasma are considered. Algorithms were developed for shared memory (vector and scalar) and distributed memory (scalar) parallel processors. The shared memory algorithm was implemented on the IBM 3090/400, and timing results are presented for dedicated runs with two, three, and four processors. Two alternative distributed memory algorithms (replication and dispatching) were implemented on a hypercube 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-processor configuration.
- Research Organization:
- Univ. of Michigan, Ann Arbor, MI 48109
- OSTI ID:
- 5912643
- Journal Information:
- Int. J. Supercomput. Appl.; (United States), Journal Name: Int. J. Supercomput. Appl.; (United States) Vol. 1:3; ISSN IJSAE
- Country of Publication:
- United States
- Language:
- English
Similar Records
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Programming parallel processors
Related Subjects
700208* -- Fusion Power Plant Technology-- Inertial Confinement Technology
99 GENERAL AND MISCELLANEOUS
990210 -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTERIZED SIMULATION
COMPUTERS
CONFINEMENT
CRAY COMPUTERS
DATA PROCESSING
DIGITAL COMPUTERS
DISTRIBUTED DATA PROCESSING
EFFICIENCY
IBM COMPUTERS
INERTIAL CONFINEMENT
MATHEMATICAL LOGIC
MEMORY DEVICES
MONTE CARLO METHOD
NEUTRAL-PARTICLE TRANSPORT
PARALLEL PROCESSING
PHOTON TRANSPORT
PLASMA CONFINEMENT
PROCESSING
PROGRAMMING
RADIATION TRANSPORT
SIMULATION
SUPERCOMPUTERS