Skip to main content

Obtaining Identical Results on Varying Numbers of Processors in Domain Decomposed Particle Monte Carlo Simulations

  • Conference paper
Computational Methods in Transport

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 48))

Abstract

Domain decomposed Monte Carlo codes, like other domain-decomposed codes, are difficult to debug. Domain decomposition is prone to error, and interactions between the domain decomposition code and the rest of the algorithm often produces subtle bugs. These bugs are particularly difficult to find in a Monte Carlo algorithm, in which the results have statistical noise. Variations in the results due to statistical noise can mask errors when comparing the results to other simulations or analytic results.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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

  • Fleck, Jr., J. A., Cummings, J. D. : An Implicit Monte Carlo Scheme for Calculating time and frequency dependent nonlinear radiation transport. J. Comp Phys., 31, 313–342 (1971)

    Article  MathSciNet  Google Scholar 

  • Gentile, N. A., Keen, N., Rathkopf, J.: The KULL IMC Package, Tech. Rep. UCRL-JC-132743, Lawrence Livermore National Laboratory, Livermore CA (1998)

    Google Scholar 

  • Brunner, T. A., Mehlhorn, T. A.: A User’s Guide to Radiation Transport in ALEGRA-HEDPP, Tech. Rep. SAND-2004–5799, Sandia National Laboratories, Albuquerque, NM (2004)

    Google Scholar 

  • Brunner, T. A., Urbatsch, T. J., Evans, T. M., Gentile, N. A., Comparison of Four Parallel Algorithms for Domain Decomposed Implict Monte Carlo, Tech. Rep. SAND-2004–6694J (2004) Submitted to J. Comp. Phys.

    Google Scholar 

  • http://sprng.cs.fsu.edu/

    Google Scholar 

  • Press, W. Tuekolsky, S.A., Vetterling, W. T., Flannery, B. P.: Numerical Recipies in C++. Cambridge University Press, United Kingdom (2002)

    Google Scholar 

  • Su, B., Olson, G. L.: An analytical benchmark for non-equilibrium radiative transfer in an isotropically scattering medium. Ann. Nucl. Energy, 24, No. 13 (1035–1055 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Gentile, N., Kalos, M., Brunner, T.A. (2006). Obtaining Identical Results on Varying Numbers of Processors in Domain Decomposed Particle Monte Carlo Simulations. In: Graziani, F. (eds) Computational Methods in Transport. Lecture Notes in Computational Science and Engineering, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28125-8_19

Download citation

Publish with us

Policies and ethics