Results for “Distributed computation” — Page 90

DOE OSTI2026

MixPI: Mixed-time slicing path integral software for quantized molecular dynamics simulations

We introduce the MixPI software to implement path integral molecular dynamics (PIMD) simulations for the study of condensed phase systems where nuclear quantum effects (NQEs) are important. In contrast to existing PIMD simulation software, MixPI enables the implementation of mixed quantum–classical path integral simulations where only a subset of system degrees of freedom (dofs) are treated quantum mechanically in an extended phase space while the remaining dofs are described classically. We expect this software to be particularly useful for simulations of electron and proton transfer in condensed phase systems, as well as for the study of biological and material systems where only a handful of dofs contribute significantly to the observed NQEs. We demonstrate the use of MixPI in two different systems. The first is a simple water model where we implement a set of mixed quantum–classical simulations to compute average energy and radial distribution functions. We use these simulations to benchmark the effectiveness of MixPI and to demonstrate how it enables systematic investigation into the origin of observed NQEs. We then compute radial distribution functions for a system where MixPI is essential: a solvated metal (M 2+ ) cation described using an explicit quantized electron localized on an M 3+ ion in water.

chemical physics↗

NASA NTRS1991

Collecting address traces from parallel computers

Trace driven simulation is a well-established method of performance analysis for single processor computer systems. However, efficient and accurate memory address tracing for parallel computer systems is not well understood. In this paper we present a critical survey of recently implemented approaches to address tracing and highlight the issues specific to collection of traces for both shared and distributed memory parallel computers. These issues include potential distortion of the relative ordering of events by the address tracing activity, realistic interleaving of addresses generated by multiple processors, and I/O and storage problems associated with collecting traces for large parallel systems. The strengths and weaknesses of the parallel tracing approaches are described.

Stunkel, Craig B.↗

NASA NTRS1989

Calculating Cumulative Binomial-Distribution Probabilities

Cumulative-binomial computer program, CUMBIN, one of set of three programs, calculates cumulative binomial probability distributions for arbitrary inputs. CUMBIN, NEWTONP (NPO-17556), and CROSSER (NPO-17557), used independently of one another. Reliabilities and availabilities of k-out-of-n systems analyzed. Used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. Used for calculations of reliability and availability. Program written in C.

Scheuer, Ernest M.↗

DOE OSTI2017

PapyrusKV: a high-performance parallel key-value store for distributed NVM architectures

This paper introduces PapyrusKV, a parallel embedded key-value store (KVS) for distributed high-performance computing (HPC) architectures that offer potentially massive pools of nonvolatile memory (NVM). PapyrusKV stores keys with their values in arbitrary byte arrays across multiple NVMs in a distributed system. PapyrusKV provides standard KVS operations such as put, get, and delete. More importantly, PapyrusKV provides advanced features for HPC such as dynamic consistency control, zero-copy workflow, and asynchronous checkpoint/restart. Beyond filesystems, PapyrusKV provides HPC programmers with a high-level interface to exploit distributed NVM in the system, and it transparently organizes data to achieve high performance. Also, it allows HPC applications to specialize PapyrusKV to meet their specific requirements. We empirically evaluate PapyrusKV on three HPC systems with real NVM devices: OLCF's Summitdev, TACC's Stampede, and NERSC's Cori. Our results show that PapyrusKV can offer high performance, scalability, and portability across these various distributed NVM architectures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

UPC++ v1.0 Programmer’s Guide (Rev. 2023.9.0)

UPC++ is a C++ library that supports Partitioned Global Address Space (PGAS) programming. It is designed for writing efficient, scalable parallel programs on distributed-memory parallel computers. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). The UPC++ control model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. The PGAS memory model additionally provides one-sided RMA communication to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. UPC++ was designed to support exascale high-performance computing, and the library interfaces and implementation are focused on maximizing scalability. In UPC++, all communication operations are syntactically explicit, which encourages programmers to consider the costs associated with communication and data movement. Moreover, all communication operations are asynchronous by default, encouraging programmers to seek opportunities for overlapping communication latencies with other useful work. UPC++ provides expressive and composable abstractions designed for efficiently managing aggressive use of asynchrony in programs. Together, these design principles are intended to enable programmers to write applications using UPC++ that perform well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

UPC++ v1.0 Programmer’s Guide (Revision 2022.3.0)

UPC++ is a C++ library that supports Partitioned Global Address Space (PGAS) programming. It is designed for writing efficient, scalable parallel programs on distributed-memory parallel computers. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). The UPC++ control model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. The PGAS memory model additionally provides one-sided RMA communication to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. UPC++ was designed to support exascale high-performance computing, and the library interfaces and implementation are focused on maximizing scalability. In UPC++, all communication operations are syntactically explicit, which encourages programmers to consider the costs associated with communication and data movement. Moreover, all communication operations are asynchronous by default, encouraging programmers to seek opportunities for overlapping communication latencies with other useful work. UPC++ provides expressive and composable abstractions designed for efficiently managing aggressive use of asynchrony in programs. Together, these design principles are intended to enable programmers to write applications using UPC++ that perform well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

UPC++ v1.0 Programmer’s Guide, Revision 2023.3.0

UPC++ is a C++ library that supports Partitioned Global Address Space (PGAS) programming. It is designed for writing efficient, scalable parallel programs on distributed-memory parallel computers. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). The UPC++ control model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. The PGAS memory model additionally provides one-sided RMA communication to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. UPC++ was designed to support exascale high-performance computing, and the library interfaces and implementation are focused on maximizing scalability. In UPC++, all communication operations are syntactically explicit, which encourages programmers to consider the costs associated with communication and data movement. Moreover, all communication operations are asynchronous by default, encouraging programmers to seek opportunities for overlapping communication latencies with other useful work. UPC++ provides expressive and composable abstractions designed for efficiently managing aggressive use of asynchrony in programs. Together, these design principles are intended to enable programmers to write applications using UPC++ that perform well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

UPC++ v1.0 Programmer’s Guide, Revision 2022.9.0

UPC++ is a C++ library that supports Partitioned Global Address Space (PGAS) programming. It is designed for writing efficient, scalable parallel programs on distributed-memory parallel computers. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). The UPC++ control model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. The PGAS memory model additionally provides one-sided RMA communication to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. UPC++ was designed to support exascale high-performance computing, and the library interfaces and implementation are focused on maximizing scalability. In UPC++, all communication operations are syntactically explicit, which encourages programmers to consider the costs associated with communication and data movement. Moreover, all communication operations are asynchronous by default, encouraging programmers to seek opportunities for overlapping communication latencies with other useful work. UPC++ provides expressive and composable abstractions designed for efficiently managing aggressive use of asynchrony in programs. Together, these design principles are intended to enable programmers to write applications using UPC++ that perform well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Multi-degree of Freedom Energy Analysis for Identification of Failure Risk in Structural Components Subjected to Random Vibration and Shock Loading

When designing or analyzing a mechanical system, energy quantities provide insight into the severity of shock and vibration environments; however, the energy methods in the literature do not address localized behavior because energy quantities are usually computed for an entire structure. The main objective of this paper is to show how to compute the energy in the components of a mechanical system. The motivation for this work is that most systems fail functionally due to component failure, not because the primary structure was overloaded, and the ability to easily compute the spatial distribution of energy helps identify failure sensitive components. The quantity of interest is input energy. That input energy can be decoupled modally is well known. What is less appreciated is that input energy can be computed at the component level exactly, using the component effective modal mass. We show the steady state input energy can be decomposed both spatially and modally and computed using input power spectra. A numerical example illustrates the spatial and modal decomposition of input energy and its utility in identifying components at risk of damage in random vibration and shock environments. Our work shows that the modal properties of the structure and the spectral content of the input must be considered together to assess damage risk. Because input energy includes absorbed energy as well as relative kinetic energy and dissipated energy, it is the recommended energy quantity for assessing the severity for both random vibration and shock environments on a structure.

42 ENGINEERING↗

DOE OSTI2015

MONTE CARLO SIMULATION OF METASTABLE OXYGEN PHOTOCHEMISTRY IN COMETARY ATMOSPHERES

Cometary atmospheres are produced by the outgassing of material, mainly H{sub 2}O, CO, and CO{sub 2} from the nucleus of the comet under the energy input from the Sun. Subsequent photochemical processes lead to the production of other species generally absent from the nucleus, such as OH. Although all comets are different, they all have a highly rarefied atmosphere, which is an ideal environment for nonthermal photochemical processes to take place and influence the detailed state of the atmosphere. We develop a Monte Carlo model of the coma photochemistry. We compute the energy distribution functions (EDF) of the metastable O({sup 1}D) and O({sup 1}S) species and obtain the red (630 nm) and green (557.7 nm) spectral line shapes of the full coma, consistent with the computed EDFs and the expansion velocity. We show that both species have a severely non-Maxwellian EDF, that results in broad spectral lines and the suprathermal broadening dominates due to the expansion motion. We apply our model to the atmosphere of comet C/1996 B2 (Hyakutake) and 103P/Hartley 2. The computed width of the green line, expressed in terms of speed, is lower than that of the red line. This result is comparable to previous theoretical analyses, but in disagreement with observations. We explain that the spectral line shape does not only depend on the exothermicity of the photochemical production mechanisms, but also on thermalization, due to elastic collisions, reducing the width of the emission line coming from the O({sup 1}D) level, which has a longer lifetime.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

SCALE 6.3 Validation: Radiation Shielding

Safe and reliable use of scientific and engineering computer codes requires validation for the types of applications in which they will be used. An example in the nuclear reactor engineering and licensing field is radiation transport employed in shielding analyses. The validity of computer codes for shielding applications is demonstrated in this report for SCALE version 6.3.0. Representative benchmarks corresponding to shielding analyses are selected for the validation study. Typical measurement results analyzed from these benchmarks include neutron fluxes, detector count rates, detector energy response functions, neutron and gamma dose rates, neutron activation rates and activities, neutron leakage fluxes, and skyshine dose rates. Thousands of points of comparison between measurement and calculation are presented in this work. Other than rare outliers typically explained by either a lack of information or large uncertainties in the experiment conditions, material, or dimensions, the Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC) radiation transport computer code with built-in variance reduction methods distributed with the SCALE computer code system agrees well with the measurement results. In selected benchmarks, MAVRIC is also compared to Monte Carlo N- Particle® (MCNP® ) 1 calculations. Both computer codes generally agree well within the estimated uncertainties. With the release of SCALE 6.3.0, Shift was integrated as an alternative transport solver in MAVRIC, denoted MAVRIC-Shift. Although the traditional MAVRIC using Monaco was used primarily in this validation study, many results have also been generated using MAVRIC-Shift. Agreement between MAVRIC-Monaco and MAVRIC-Shift is generally very good. The benchmarks presented in this report were obtained from reliable sources such as the International Criticality Safety Benchmark Evaluation Project Handbook, the Shielding Integral Benchmark Archive & Database, and other shielding validation work found in the literature. Additional datapoints and benchmarks will be added to future versions of this report to expand the shielding validation suite.

61 RADIATION PROTECTION AND DOSIMETRY↗

NASA NTRS1966

Lunar occultation and provisional identification of MSH 19-27.

Lunar occultation and identification of MSH 19-27 radio source, noting computer analysis of brightness distribution

BRIGHTNESS DISCRIMINATION↗

NASA NTRS1979

Supercritical flow about a thick circular-arc airfoil

The supercritical flow about a biconvex circular-arc airfoil is being thoroughly documented at Ames Research Center in order to provide experimental test cases suitable for guiding and evaluating current and future computer codes. The effects of angle of attack, effects of leading and trailing-edge splitter plates, additional unsteady pressure fluctuation (buffeting) measurements and glow-field shadowgraphs, and application of an oil-film technique to display separated-wake streamlines were studied. Computed and measured pressure distributions for steady and unsteady flows, using a recent computer code representative of current methodology, are compared. It was found that the numerical solutions are often fundamentally incorrect in that only strong (shock-polar terminology) shocks are captured, whereas experimentally, both strong and weak shock waves appear.

Mcdevitt, J. B.↗

NASA NTRS1990

An analysis of the viscous flow through a compact radial turbine by the average passage approach

A steady, three-dimensional viscous average passage computer code is used to analyze the flow through a compact radial turbine rotor. The code models the flow as spatially periodic from blade passage to blade passage. Results from the code using varying computational models are compared with each other and with experimental data. These results include blade surface velocities and pressures, exit vorticity and entropy contour plots, shroud pressures, and spanwise exit total temperature, total pressure, and swirl distributions. The three computational models used are inviscid, viscous with no blade clearance, and viscous with blade clearance. It is found that modeling viscous effects improves correlation with experimental data, while modeling hub and tip clearances further improves some comparisons. Experimental results such as a local maximum of exit swirl, reduced exit total pressures at the walls, and exit total temperature magnitudes are explained by interpretation of the flow physics and computed secondary flows. Trends in the computed blade loading diagrams are similarly explained.

Heidmann, James D.↗

NASA NTRS1990

An analysis of the viscous flow through a compact radial turbine by the average passage approach

A steady, three-dimensional viscous average passage computer code is used to analyze the flow through a compact radial turbine rotor. The code models the flow as spatially periodic from blade passage to blade passage. Results from the code using varying computational models are compared with each other and with experimental data. These results include blade surface velocities and pressures, exit vorticity and entropy contour plots, shroud pressures, and spanwise exit total temperature, total pressure, and swirl distributions. The three computational models used are inviscid, viscous with no blade clearance, and viscous with blade clearance. It is found that modeling viscous effects improves correlation with experimental data, while modeling hub and tip clearances further improves some comparisons. Experimental results such as a local maximum of exit swirl, reduced exit total pressures at the walls, and exit total temperature magnitudes are explained by interpretation of the flow physics and computed secondary flows. Trends in the computed blade loading diagrams are similarly explained.

Heidmann, James D.↗

DOE OSTI2014

STRUMPACK -- STRUctured Matrices PACKage

STRUMPACK - STRUctured Matrices PACKage - is a package for computations with sparse and dense structured matrix, i.e., matrices that exhibit some kind of low-rank property, in particular Hierarchically Semi Separable structure (HSS). Such matrices appear in many applications, e.g., FEM, BEM, Integral equations. etc. Exploiting this structure using certain compression algorithms allow for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. STRUMPACK has presently two main components: a distributed-memory dense matrix computations package and a shared-memory sparse direct solver.

Source record↗

DOE OSTI2015

VERA 3.3 Release Notes

The Virtual Environment for Reactor Applications components included in this distribution include selected computational tools and supporting infrastructure that solve neutronics, thermal-hydraulics, fuel performance, and coupled neutronics-thermal hydraulics-fuel performance problems. The infrastructure components provide a simplified common user input capability and provide for the physics integration with data transfer and coupled-physics iterative solution algorithms. Neutronics analysis can be performed for 2D lattices, 2D core and 3D core problems for pressurized water reactor geometries that can be used to calculate criticality and fission rate distributions by pin for input fuel compositions. Two neutronics capabilities are provided in this distribution including MPACT (from the University of Michigan) that supports 2D lattices and Insilico (from Oak Ridge National Laboratory) that supports 2D lattices, 2D core planes, and 3D core geometries. Both codes include integrated cross section capabilities that provide problem-specific cross sections for the problems defined. A thermal-hydraulics capability is provided with CTF (an updated version of the COBRA-TF code developed by the Pennsylvania State University) that allows thermal-hydraulics analyses for single and multiple assemblies using the simplified VERA common input. This distribution also includes an initial coupled neutronics/thermal-hydraulics capability to allow calculations of single assemblies using Insilico or MPACT coupled with CTF. The VERA fuel rod performance subcomponent BISON-CASL calculates, on a 3D basis, fuel rod temperature, fuel rod internal pressure, free gas volume, clad integrity and fuel rod waterside diameter. These capabilities allow simulation of power cycling, fuel conditioning and deconditioning, high burnup performance, power uprate scoping studies, and accident performance. Specifically targeted at VERA’s core simulator functionality (VERA-CS), the existing VERA subchannel-neutronics capability based on CTF and Insilico has been extended to use the axisymmetric 2D R-Z fuel rod modeling functionality of BISON-CASL to produce a three-way coupled neutronics, thermal-hydraulics and fuel performance capability known as Tiamat. This distribution is intended to be used for testing and evaluation of the released components of VERA. Testing within CASL has focused specifically on Westinghouse four-loop reactor geometries and conditions with example problems included in the distribution.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2019

Reconstructing parton distribution functions from Ioffe time data: from Bayesian methods to neural networks

The computation of the parton distribution functions (PDF) or distribution amplitudes (DA) of hadrons from first principles lattice QCD constitutes a central open problem in high energy nuclear physics. In this study, we present and evaluate the efficiency of several numerical methods, well established in the study of inverse problems, to reconstruct the full x-dependence of PDFs. Our starting point are the so called Ioffe time PDFs, which are accessible from Euclidean time simulations in conjunction with a matching procedure. Using realistic mock data tests, we find that the ill-posed incomplete Fourier transform underlying the reconstruction requires careful regularization, for which both the Bayesian approach as well as neural networks are efficient and flexible choices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗