2,548 research outputs found
Computing for Perturbative QCD - A Snowmass White Paper
We present a study on high-performance computing and large-scale distributed
computing for perturbative QCD calculations.Comment: 21 pages, 5 table
Monte Carlo and Depletion Reactor Analysis for High-Performance Computing Applications
This dissertation discusses the research and development for a coupled neutron trans- port/isotopic depletion capability for use in high-preformance computing applications. Accurate neutronics modeling and simulation for \real reactor problems has been a long sought after goal in the computational community. A complementary \stretch goal to this is the ability to perform full-core depletion analysis and spent fuel isotopic characterization. This dissertation thus presents the research and development of a coupled Monte Carlo transport/isotopic depletion implementation with the Exnihilo framework geared for high-performance computing architectures to enable neutronics analysis for full-core reactor problems.
An in-depth case study of the current state of Monte Carlo neutron transport with respect to source sampling, source convergence, uncertainty underprediction and biases associated with localized tallies in Monte Carlo eigenvalue calculations was performed using MCNPand KENO. This analysis is utilized in the design and development of the statistical algorithms for Exnihilo\u27s Monte Carlo framework, Shift. To this end, a methodology has been developed in order to perform tally statistics in domain decomposed environments. This methodology has been shown to produce accurate tally uncertainty estimates in domain-decomposed environments without a significant increase in the memory requirements, processor-to-processor communications, or computational biases.
With the addition of parallel, domain-decomposed tally uncertainty estimation processes, a depletion package was developed for the Exnihilo code suite to utilize the depletion capabilities of the Oak Ridge Isotope GENeration code. This interface was designed to be transport agnostic, meaning that it can be used by any of the reactor analysis packages within Exnihilo such as Denovo or Shift. Extensive validation and testing of the ORIGEN interface and coupling with the Shift Monte Carlo transport code is performed within this dissertation, and results are presented for the calculated eigenvalues, material powers, and nuclide concentrations for the depleted materials. These results are then compared to ORIGEN and TRITON depletion calculations, and analysis shows that the Exnihilo transport-depletion capability is in good agreement with these codes
Accelerating Reconfigurable Financial Computing
This thesis proposes novel approaches to the design, optimisation, and management of reconfigurable
computer accelerators for financial computing. There are three contributions. First, we propose novel
reconfigurable designs for derivative pricing using both Monte-Carlo and quadrature methods. Such
designs involve exploring techniques such as control variate optimisation for Monte-Carlo, and multi-dimensional
analysis for quadrature methods. Significant speedups and energy savings are achieved
using our Field-Programmable Gate Array (FPGA) designs over both Central Processing Unit (CPU)
and Graphical Processing Unit (GPU) designs. Second, we propose a framework for distributing computing
tasks on multi-accelerator heterogeneous clusters. In this framework, different computational
devices including FPGAs, GPUs and CPUs work collaboratively on the same financial problem based
on a dynamic scheduling policy. The trade-off in speed and in energy consumption of different accelerator
allocations is investigated. Third, we propose a mixed precision methodology for optimising
Monte-Carlo designs, and a reduced precision methodology for optimising quadrature designs. These
methodologies enable us to optimise throughput of reconfigurable designs by using datapaths with
minimised precision, while maintaining the same accuracy of the results as in the original designs
The use of primitives in the calculation of radiative view factors
Compilations of radiative view factors (often in closed analytical form) are readily available in the open literature for commonly encountered geometries. For more complex three-dimensional (3D) scenarios, however, the effort required to solve the requisite multi-dimensional integrations needed to estimate a required view factor can be daunting to say the least. In such cases, a combination of finite element methods (where the geometry in question is sub-divided into a large number of uniform, often triangular, elements) and Monte Carlo Ray Tracing (MC-RT) has been developed, although frequently the software implementation is suitable only for a limited set of geometrical scenarios. Driven initially by a need to calculate the radiative heat transfer occurring within an operational fibre-drawing furnace, this research set out to examine options whereby MC-RT could be used to cost-effectively calculate any generic 3D radiative view factor using current vectorisation technologies
New Quantum Monte Carlo Algorithms to Efficiently Utilize Massively Parallel Computers
The exponential growth in computer power over the past few decades has been a huge boon to computational chemistry, physics, biology, and materials science. Now, a standard workstation or Linux cluster can calculate semi-quantitative properties of moderately sized systems. The next step in computational science is developing better algorithms which allow quantitative calculations of a system's properties.
A relatively new class of algorithms, known collectively as Quantum Monte Carlo (QMC), has the potential to quantitatively calculate the properties of molecular systems. Furthermore, QMC scales as O(N³) or better. This makes possible very high-level calculations on systems that are too large to be examined using standard high-level methods.
This thesis develops (1) an efficient algorithm for determining "on-the-fly" the statistical error in serially correlated data, (2) a manager-worker parallelization algorithm for QMC that allows calculations to run on heterogeneous parallel computers and computational grids, (3) a robust algorithm for optimizing Jastrow functions which have singularities for some parameter values, and (4) a proof-of-concept demonstrating that it is possible to find transferable parameter sets for large classes of compounds.</p
Fast algorithm for real-time rings reconstruction
The GAP project is dedicated to study the application of GPU in several contexts in which
real-time response is important to take decisions. The definition of real-time depends on
the application under study, ranging from answer time of μs up to several hours in case
of very computing intensive task. During this conference we presented our work in low
level triggers [1] [2] and high level triggers [3] in high energy physics experiments, and
specific application for nuclear magnetic resonance (NMR) [4] [5] and cone-beam CT [6].
Apart from the study of dedicated solution to decrease the latency due to data transport
and preparation, the computing algorithms play an essential role in any GPU application.
In this contribution, we show an original algorithm developed for triggers application, to
accelerate the ring reconstruction in RICH detector when it is not possible to have seeds
for reconstruction from external trackers
Achieving Numerical Reproducibility in the Parallelized Floating Point Dot Product
The world depends on computers every day to do accurate real-world mathematics. Computers must store real numbers in a finite representation that approximates real numbers, called floating point representation. However, simply by changing the order in which we add a list of floating point numbers can provide a different result that may even be less accurate than another ordering. This is because floating point addition is not associative. That is, (a + b) + c is not necessarily equal to a + (b + c). Parallel computing techniques introduce the ability to reorder computations, thus producing a difference in results between runs. Numerical reproducibility means attaining a bit-wise identical result every time an application is run, and is valuable for debugging and testing purposes. Because scientific applications have come to use parallel computing techniques in order to solve increasingly complex problems, non-reproducibility is often introduced in the form of basic operations these applications rely on, such as the dot product. We use the Kahan and Knuth summation algorithms to reduce rounding error in order to produce more reproducible dot product results
Development of advanced geometric models and acceleration techniques for Monte Carlo simulation in Medical Physics
Els programes de simulació Monte Carlo de caràcter general s'utilitzen actualment en una gran varietat d'aplicacions.Tot i això, els models geomètrics implementats en la majoria de programes imposen certes limitacions a la forma dels objectes que es poden definir. Aquests models no són adequats per descriure les superfícies arbitràries que es troben en estructures anatòmiques o en certs aparells mèdics i, conseqüentment, algunes aplicacions que requereixen l'ús de models geomètrics molt detallats no poden ser acuradament estudiades amb aquests programes.L'objectiu d'aquesta tesi doctoral és el desenvolupament de models geomètrics i computacionals que facilitin la descripció dels objectes complexes que es troben en aplicacions de física mèdica. Concretament, dos nous programes de simulació Monte Carlo basats en PENELOPE han sigut desenvolupats. El primer programa, penEasy, utilitza un algoritme de caràcter general estructurat i inclou diversos models de fonts de radiació i detectors que permeten simular fàcilment un gran nombre d'aplicacions. Les noves rutines geomètriques utilitzades per aquest programa, penVox, extenen el model geomètric estàndard de PENELOPE, basat en superfícices quàdriques, per permetre la utilització d'objectes voxelitzats. Aquests objectes poden ser creats utilitzant la informació anatòmica obtinguda amb una tomografia computeritzada i, per tant, aquest model geomètric és útil per simular aplicacions que requereixen l'ús de l'anatomia de pacients reals (per exemple, la planificació radioterapèutica). El segon programa, penMesh, utilitza malles de triangles per definir la forma dels objectes simulats. Aquesta tècnica, que s'utilitza freqüentment en el camp del disseny per ordinador, permet representar superfícies arbitràries i és útil per simulacions que requereixen un gran detall en la descripció de la geometria, com per exemple l'obtenció d'imatges de raig x del cos humà.Per reduir els inconvenients causats pels llargs temps d'execució, els algoritmes implementats en els nous programes s'han accelerat utilitzant tècniques sofisticades, com per exemple una estructura octree. També s'ha desenvolupat un paquet de programari per a la paral·lelització de simulacions Monte Carlo, anomentat clonEasy, que redueix el temps real de càlcul de forma proporcional al nombre de processadors que s'utilitzen.Els programes de simulació que es presenten en aquesta tesi són gratuïts i de codi lliures. Aquests programes s'han provat en aplicacions realistes de física mèdica i s'han comparat amb altres programes i amb mesures experimentals.Per tant, actualment ja estan llestos per la seva distribució pública i per la seva aplicació a problemes reals.Monte Carlo simulation of radiation transport is currently applied in a large variety of areas. However, the geometric models implemented in most general-purpose codes impose limitations on the shape of the objects that can be defined. These models are not well suited to represent the free-form (i.e., arbitrary) shapes found in anatomic structures or complex medical devices. As a result, some clinical applications that require the use of highly detailed phantoms can not be properly addressed.This thesis is devoted to the development of advanced geometric models and accelration techniques that facilitate the use of state-of-the-art Monte Carlo simulation in medical physics applications involving detailed anatomical phantoms. To this end, two new codes, based on the PENELOPE package, have been developed. The first code, penEasy, implements a modular, general-purpose main program and provides various source models and tallies that can be readily used to simulate a wide spectrum of problems. Its associated geometry routines, penVox, extend the standard PENELOPE geometry, based on quadric surfaces, to allow the definition of voxelised phantoms. This kind of phantoms can be generated using the information provided by a computed tomography and, therefore, penVox is convenient for simulating problems that require the use of the anatomy of real patients (e.g., radiotherapy treatment planning). The second code, penMesh, utilises closed triangle meshes to define the boundary of each simulated object. This approach, which is frequently used in computer graphics and computer-aided design, makes it possible to represent arbitrary surfaces and it is suitable for simulations requiring a high anatomical detail (e.g., medical imaging).A set of software tools for the parallelisation of Monte Carlo simulations, clonEasy, has also been developed. These tools can reduce the simulation time by a factor that is roughly proportional to the number of processors available and, therefore, facilitate the study of complex settings that may require unaffordable execution times in a sequential simulation.The computer codes presented in this thesis have been tested in realistic medical physics applications and compared with other Monte Carlo codes and experimental data. Therefore, these codes are ready to be publicly distributed as free and open software and applied to real-life problems.Postprint (published version
Kernel Density Estimation Techniques for Monte Carlo Reactor Analysis.
Kernel density estimators (KDEs) are developed to estimate neutron scalar flux and reaction rate densities in Monte Carlo neutron transport simulations of pressurized water reactor benchmark problems in continuous energy. Previous work introduced the collision and track-length KDE for estimating scalar flux in radiation transport problems as an alternative to traditional histogram tallies. However, these estimators were not developed to estimate reaction rates and they were they not tested in continuous energy reactor physics problems. This dissertation expands upon previous work by developing KDEs that are capable of accurately estimating reaction rates in reactor physics problems.
The current state of the art in KDEs is applied to estimate reaction rates in reactor physics problems, with significant bias observed at material interfaces. The Mean Free Path (MFP) KDE is introduced in order to reduce this bias, with results showing no significant bias in 1-D problems. The multivariate MFP KDE is derived and applied to 2-D benchmark problems. Results show that the multivariate MFP KDE produces results with significant variance resulting from particle events at resonance energies. The fractional MFP KDE is developed to reduce this variance.
An approximation to the MFP KDE is introduced to improve computational performance of the algorithm at the cost of introducing additional bias into the estimates. A volume-average KDE is derived in order to directly compare KDE and histogram results and is used to determine the bias introduced by the approximation to the MFP KDE.
A KDE is derived for cylindrical coordinates, and the cylindrical MFP KDE is derived to capture distributions in reactor pincell problems. The cylindrical MFP KDE is applied to estimate distributions on an IFBA pincell, a quarter assembly of pincells, a depleted pincell, and on an unstructured mesh representation of a pincell. The results indicate that the cylindrical MFP KDE and fractional MFP KDE are capable of accurately capturing reaction rates in reactor physics benchmark problems.
This dissertation also describes the acceleration of the KDE via heterogeneous computing with GPUs. The algorithm development is described along with optimization strategies on the GPU. Speedups of 1.4-5 are observed for several benchmark problems.PHDNuclear Engineering & Radiological SciencesUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/135841/1/tpburke_1.pd
- …