Skip to main content

Vectorization and Parallelization of Transport Monte Carlo Simulation Codes

  • Conference paper
Book cover Supercomputing

Part of the book series: NATO ASI Series ((NATO ASI F,volume 62))

  • 70 Accesses

Abstract

In recent years, the demand for solving large scale scientific and engineering problems has grown enormously. Since many programs for solving these problems inherently contain a very high degree of parallelism, they can be processed very efficiently if algorithms employed therein expose the parallelism to the architecture of a supercomputer.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Fernbach (ed.), Supercomputers. North-Holland (1986).

    MATH  Google Scholar 

  2. R. Hockney and C. Jesshop, Parallel Computers 2. Adam Hilger (1988).

    MATH  Google Scholar 

  3. R. Mendez and S. Orszag (eds.), Japanese Supercomputing. Lecture notes in Engineering, 36, Springer-Verlag (1988), 111–127.

    Book  MATH  Google Scholar 

  4. K. Uchida, VP2000 Series, in this proceedings.

    Google Scholar 

  5. R. Alcouffe et al. (Eds.), Monte-Carlo Methods and Applications in Neutronics. Photonics and Statistical Physics. Lecture Notes in Physics, 240, Springer-Verlag (1985).

    Google Scholar 

  6. W.R. Nelson, H. Hirayama and D.W.O. Rogers, “The EGS4 Code System”, Stanford Linear Accelerator Center Report SLAC-265, December 1985.

    Google Scholar 

  7. F. Bobrowicz et al. “Vectorized Monte Carlo photon transport”, Parallel Computing 1 (1984) 295–305.

    Article  Google Scholar 

  8. Y. Chauvet, “Multitasking a Vectorized Monte Carlo Algorithm on the Cray X/MP2”, Cray Channels 6, No. 3 (1984) 6–9.

    Google Scholar 

  9. W. Martin and F. Brown, “Status of Vectorized Monte Carlo for Particle Transport Analysis”, The International Journal of Supercomputer Applications, 1, No. 2 (1987) 11–32.

    Article  Google Scholar 

  10. K. Miura: “Vectorization of phase space Monte Carlo code in FACOM Vector Processor VP-200”, Computing in High Energy Physics (Eds. L.O. Hertzberger, and W. Hoogland ), Elsevier Science publishers B.V. (1986).

    Google Scholar 

  11. K. Miura, “EGS4-V: Vectorization of the Monte Carlo cascade shower simulation code EGS4”, Computer Physics Communications 45 (1987) 127–136.

    Article  Google Scholar 

  12. K. Asai et al, “Vectorization of KENO-IV Code”, Nuclear Science and Engineering, 31 (1986) 298.

    Google Scholar 

  13. B. Martin, “Particle Transport Monte Carlo on Shared-Memory and Distributed-Memory Parallel Processors”, Proc. The Third International Conference on Supercomputing, 2 (1988) 348–353.

    Google Scholar 

  14. M. Kalos and P.A. Whitlock, Monte Carlo Methods. Vol.1, Wiley-InterScience, (1986).

    Book  MATH  Google Scholar 

  15. D. Knuth, The Art of Computer Programming. Vol. 2 (2nd ed.), Addison-Nesley (1981).

    MATH  Google Scholar 

  16. T. Matsuura, K. Miura and M. Makino, “Supervector Performance without Toil”, Computer Physics Communications 37 (1985) 101–107.

    Google Scholar 

  17. Vector Processor Overview, MM-142002-005 (July 1986) Amdahl Corp., Sunnyvale California.

    Google Scholar 

  18. P. Frederickson et al., “Pseudo-random trees in Monte Carlo”, Parallel Computing, 1, No. 2 (1984) 175–180.

    Article  MATH  Google Scholar 

  19. K. Miura and R. Babb II, “Tradeoffs in Granularity and Parallelization for a Monte Carlo Shower Simulation Code”, Parallel Computing 8, Nos. 1–3 (1988) 91–100.

    Article  MATH  Google Scholar 

  20. K. Miura, “An Analytical Speedup Factor for Asynchronous Model of Parallel Processing”, in preparation.

    Google Scholar 

  21. G.M. Amdahl, “Limits of Expectation”, Int. Jour. Supercomputer Applications 2, No.1 (1988) 88–94.

    Article  Google Scholar 

  22. W. Feller, An Introduction to Probability Theory and its Applications. Vol. 1, J.H.Wiley and Sons (1968).

    MATH  Google Scholar 

  23. H. Kobayashi, Modeling and Analysis. Addison Wesley (1978).

    MATH  Google Scholar 

  24. Pacific Sierra Research Corp., The FORGE EASY REFERENCE GUIDE, Sept. 1989.

    Google Scholar 

  25. D. Klappholtz and X. Kong, CFTP: A Tool to Aid in Hand-Parallelizing Sequential Code, Digest COMPCON SPRING ’89, IEEE Computer Society Press, (1989) 92–97.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miura, K. (1990). Vectorization and Parallelization of Transport Monte Carlo Simulation Codes. In: Kowalik, J.S. (eds) Supercomputing. NATO ASI Series, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75771-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-75771-6_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-75773-0

  • Online ISBN: 978-3-642-75771-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics