View Item 

Show simple item record

Monte Carlo Photon Transport On Shared Memory and Distributed Memory Parallel Processors

dc.contributor.authorMartin, William R.en_US
dc.contributor.authorWan, Tzu-Chiangen_US
dc.contributor.authorAbdel-Rahman, Tarek S.en_US
dc.contributor.authorMudge, Trevor N.en_US
dc.contributor.authorMiura, Kenichien_US
dc.date.accessioned2010-04-13T19:11:23Z
dc.date.available2010-04-13T19:11:23Z
dc.date.issued1987en_US
dc.identifier.citationMartin, William; Wan, Tzu-Chiang; Abdel-Rahman, Tarek; Mudge, Trevor; Miura, Kenichi (1987). "Monte Carlo Photon Transport On Shared Memory and Distributed Memory Parallel Processors." International Journal of High Performance Computing Applications 1(3): 57-74. <http://hdl.handle.net/2027.42/67146>en_US
dc.identifier.issn1094-3420en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/67146
dc.description.abstractParallelized 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.en_US
dc.format.extent3108 bytes
dc.format.extent1191775 bytes
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.publisherSage Publicationsen_US
dc.titleMonte Carlo Photon Transport On Shared Memory and Distributed Memory Parallel Processorsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUNIVERSITY OF MICHIGAN ANN ARBOR, MICHIGAN 48109en_US
dc.contributor.affiliationumUNIVERSITY OF MICHIGAN ANN ARBOR, MICHIGAN 48109en_US
dc.contributor.affiliationumUNIVERSITY OF MICHIGAN ANN ARBOR, MICHIGAN 48109en_US
dc.contributor.affiliationumUNIVERSITY OF MICHIGAN ANN ARBOR, MICHIGAN 48109en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/67146/2/10.1177_109434208700100306.pdf
dc.identifier.doi10.1177/109434208700100306en_US
dc.identifier.sourceInternational Journal of High Performance Computing Applicationsen_US
dc.identifier.citedreferenceAmdahl, G. 1967. Validity of the single processor approach to achieving large scale computing capabilities. Proc. Spring Joint Canf. AFIPS 30:483-485.en_US
dc.identifier.citedreferenceBowman, K.O., and Robinson, M.T. 1987. Studies of random number generators for parallel processing. In Hypercube Multiprocessors 1987, edited by M. T. Heath. Philadelphia: SIAM, pp. 445-453.en_US
dc.identifier.citedreferenceChauvet, Y. 1984. Multitasking a vectorized Monte Carlo algorithm on the CRAY X-MP/2. Cray Channels 6:6-9.en_US
dc.identifier.citedreferenceChauvet, Y. 1985. Vectorization and multitasking with a Monte Carlo code for neutron transport problems. Presented at the LANL-CEA Meeting on Recent Applications of the Monte Carlo Method, April 22-26, Cardarache, France. CEA-CONF 7902.en_US
dc.identifier.citedreferenceDuderstadt, J.J., and Martin, W.R. 1979. Transport theory. New York: Wiley.en_US
dc.identifier.citedreferenceFrederickson, P.F., Hiromoto, R., Jordan, T.L., Smith, B., and Warnoek, T. 1984. Pseudo-random trees in Monte Carlo. Parallel Comput. 1:175.en_US
dc.identifier.citedreferenceHayes, J.P., Jain, R., Martin, W.R., Mudge, T.N., Scott, L.R., Shin, K.G., and Stout, Q.F. 1987. Hypercube computer research at the University of Michigan. In Hypercube Multiprocessors 1987, edited by M. T. Heath. Philadelphia: SIAM, pp. 382-394.en_US
dc.identifier.citedreferenceKnuth, D.E. 1969. The art of computer programming. Vol. 2. Reading, Massachusetts: Addison-Wesley.en_US
dc.identifier.citedreferenceLos Alamos Monte Carlo Group. 1981. MCNP: A general Monte Carlo code for neutron and photon transport. LA-7396-M (revised). Los Alamos, New Mexico: Los Alamos National Laboratory, Group X-6.en_US
dc.identifier.citedreferenceMartin, W.R., and Brown, F.B. 1987. Status of vectorized Monte Carlo for particle transport analysis. Internat. J. Supercomput. Appl. 1(2):11-32.en_US
dc.identifier.citedreferenceMartin, W.R., Nowak, P.F., and Rathkopf, J.A. 1986. Monte Carlo photon transport on a vector supercomputer. IBM J. Res. Develop. 30:193-202.en_US
dc.identifier.citedreferenceMartin, W.R., Poland, D., Wan, T.C., Mudge, T.N., and Abdel-Rahman, T.S. 1987. Monte Carlo photon transport on the NCUBE. In Hypercube Multiprocessors 1987, edited by M. T. Heath. Philadelphia: SIAM, pp. 454-463.en_US
dc.identifier.citedreferenceStraker, E.W., Scott, W.H., and Byrn, N.R. 1970. The MORSE general purpose Monte Carlo multigroup neutron and gamma ray transport code with combinational geometry. USAEC Rep. ORNL-4585. Oak Ridge, Tennessee: Oak Ridge National Laboratory.en_US
dc.identifier.citedreferenceWan, T.C., and Martin, W.R. 1986. Parallel algorithms for photon transport Monte Carlo. Trans. Amer. Nucl. Soc. 53:285-286.en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10.1177_109434208700100306.pdf
Size:
1.136MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.