Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel simulation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,027 records · Page 57

PEBBLES Mechanics Simulation Speedup

Pebble bed reactors contain large numbers of spherical fuel elements arranged randomly. Determining the motion and location of these fuel elements is required for calculating certain parameters of pebble bed reactor operation. These simulations involve hundreds of thousands of pebbles and involve determining the entire core motion as pebbles are recirculated. Single processor algorithms for this are insufficient since they would take decades to centuries of wall-clock time. This paper describes the process of parallelizing and speeding up the PEBBLES pebble mechanics simulation code. Both shared memory programming with the Open Multi-Processing API and distributed memory programming with the Message Passing Interface API are used in simultaneously in this process. A new shared memory lock-less linear time collision detection algorithm is described. This method allows faster detection of pebbles in contact than generic methods. These combine to make full recirculations on AVR sized reactors possible in months of wall clock time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Evolution of CMS Workload Management Towards Multicore Job Support

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

Perez-Calero Yzquierdo, A.↗

Characterizing MPI matching via trace-based simulation

With the increased scale expected on future leadership-class systems, detailed information about the resource usage and performance of MPI message matching provides important insights into how to maintain application performance on next-generation systems. However, obtaining MPI message matching performance data is often not possible without significant effort. A common approach is to instrument an MPI implementation to collect relevant statistics. While this approach can provide important data, collecting matching data at runtime perturbs the application's execution, including its matching performance, and is highly dependent on the MPI library's matchlist implementation. In this paper, we introduce a trace-based simulation approach to obtain detailed MPI message matching performance data for MPI applications without perturbing their execution. Using a number of key parallel workloads, we demonstrate that this simulator approach can rapidly and accurately characterize matching behavior. Specifically, we use our simulator to collect several important statistics about the operation of the MPI posted and unexpected queues. For example, we present data about search lengths and the duration that messages spend in the queues waiting to be matched. Here, data gathered using this simulation-based approach have significant potential to aid hardware designers in determining resource allocation for MPI matching functions and provide application and middleware developers with insight into the scalability issues associated with MPI message matching.

97 MATHEMATICS AND COMPUTING↗

EXPLOSIVE INSTABILITY AND CORONAL HEATING

The observed energy-loss rate from the solar corona implies that the coronal magnetic field has a critical angle at which energy is released. It has been hypothesized that at this critical angle an 'explosive instability' would occur, leading to an enhanced conversion of magnetic energy into heat. In earlier investigations, we have shown that a shear-dependent magnetohydrodynamic process called 'secondary instability' has many of the distinctive features of the hypothetical 'explosive instability'. In this paper, we give the first demonstration that this 'secondary instability' occurs in a system with line-tied magnetic fields and boundary shearing-basically the situation described by Parker. We also show that, as the disturbance due to secondary instability attains finite amplitude, there is a transition to turbulence which leads to enhanced dissipation of magnetic and kinetic energy. These results are obtained from numerical simulations performed with a new parallelized, viscoresistive, three-dimensional code that solves the cold plasma equations. The code employs a Fourier collocation-finite difference spatial discretization, and uses a third-order Runge-Kutta temporal discretization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

First results from core-edge parallel composition in the FACETS project

FACETS (Framework Application for Core-Edge Transport Simulations), now in its second year, has achieved its first coupled core-edge transport simulations. In the process, a number of accompanying accomplishments were achieved. These include a new parallel core component, a new wall component, improvements in edge and source components, and the framework for coupling all of this together. These accomplishments were a result of an interdisciplinary collaboration among computational physics, computer scientists, and applied mathematicians on the team.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

PFLOTRAN: Reactive Flow & Transport Code for Use on Laptops to Leadership-Class Supercomputers

PFLOTRAN, a next-generation reactive flow and transport code for modeling subsurface processes, has been designed from the ground up to run efficiently on machines ranging from leadership-class supercomputers to laptops. Based on an object-oriented design, the code is easily extensible to incorporate additional processes. It can interface seamlessly with Fortran 9X, C and C++ codes. Domain decomposition parallelism is employed, with the PETSc parallel framework used to manage parallel solvers, data structures and communication. Features of the code include a modular input file, implementation of high-performance I/O using parallel HDF5, ability to perform multiple realization simulations with multiple processors per realization in a seamless manner, and multiple modes for multiphase flow and multicomponent geochemical transport. Chemical reactions currently implemented in the code include homogeneous aqueous complexing reactions and heterogeneous mineral precipitation/dissolution, ion exchange, surface complexation and a multirate kinetic sorption model. PFLOTRAN has demonstrated petascale performance using 2{sup 17} processor cores with over 2 billion degrees of freedom. Accomplishments achieved to date include applications to the Hanford 300 Area and modeling CO{sub 2} sequestration in deep geologic formations.

58 GEOSCIENCES↗

Reference guide to WPP version 2.0

WPP is a computer program for simulating seismic wave propagation on parallel machines. WPP solves the governing equations in second order formulation using a node-based finite difference approach. The basic numerical method is described in [9]. WPP implements substantial capabilities for 3-D seismic modeling, with a free surface condition on the top boundary, non-reflecting far-field boundary conditions on the other boundaries, point force and point moment tensor source terms with many predefined time dependencies, fully 3-D heterogeneous material model specification, output of synthetic seismograms in the SAC [4] format, output of GMT [11] scripts for laying out simulation information on a map, and output of 2-D slices of (derived quantites of) the solution field as well as the material model. Version 2.0 of WPP allows the free surface boundary condition to be imposed on a curved topography. For this purpose a curvilinear mesh is used near the free surface, extending into the computational domain down to a user specified level. The elastic wave equations and the free surface boundary conditions are discretized on the curvilinear mesh using the energy conserving technique described in [2]. A curvilinear mesh generator is built into WPP and the curvilinear mesh is automatically generated from the topography. Below the curvilinear grid, the elastic wave equation is discretized on Cartesian meshes, which leads to a more computationally efficient algorithm. In version 2.0 of WPP, Cartesian local mesh refinement can be used to make the computational mesh finer near the free surface, where more resolution often is needed to resolve short wave lenghts in the solution, for example in sedimentary basins. The mesh refinement is performed in the vertical direction and each Cartesian grid is constructed from user specified refinement levels. In this approach, the grid size in all three spatial directions is doubled across each mesh refinement interface, leading to substantial savings in memory and computational effort. The energy conserving mesh refinement coupling method described in [10] is used to handle the hanging nodes along the refinement interface. The examples subdirectory of the WPP source distribution contains several examples and validation tests. Many Matlab/octave scripts are provided in the tools directory.

58 GEOSCIENCES↗

NONRELATIVISTIC PARALLEL SHOCKS IN UNMAGNETIZED AND WEAKLY MAGNETIZED PLASMAS

We present results of 2D3V particle-in-cell simulations of nonrelativistic plasma collisions with absent or parallel large-scale magnetic field for parameters applicable to the conditions at young supernova remnants. We study the collision of plasma slabs of different density, leading to two different shocks and a contact discontinuity. Electron dynamics play an important role in the development of the system. While nonrelativistic shocks in both unmagnetized and magnetized plasmas can be mediated by Weibel-type instabilities, the efficiency of shock-formation processes is higher when a large-scale magnetic field is present. The electron distributions downstream of the forward and reverse shocks are generally isotropic, whereas that is not always the case for the ions. We do not see any significant evidence of pre-acceleration, neither in the electron population nor in the ion distribution.

79 ASTRONOMY AND ASTROPHYSICS↗

The global star formation law by supernova feedback

ABSTRACT We address a simple model where the Kennicutt–Schmidt (KS) relation between the macroscopic densities of star formation rate (SFR, ρsfr) and gas (n) in galactic discs emerges from self-regulation of the SFR via supernova feedback. It arises from the physics of supernova bubbles, insensitive to the microscopic SFR recipe and not explicitly dependent on gravity. The key is that the filling factor of SFR-suppressed supernova bubbles self-regulates to a constant, f ∼ 0.5. Expressing the bubble fading radius and time in terms of n, the filling factor is $f\propto S\, n^{-s}$ with s ≃ 1.5, where S is the supernova rate density. A constant f thus refers to ρsfr ∝ n1.5, with a density-independent SFR efficiency per free-fall time ∼0.01. The self-regulation to f ∼ 0.5 and the convergence to a KS relation independent of the local SFR recipe are demonstrated in cosmological and isolated-galaxy simulations using different codes and recipes. In parallel, the spherical analysis of bubble evolution is generalized to clustered supernovae, analytically and via simulations, yielding s ≃ 1.5 ± 0.5. An analysis of photoionized bubbles about pre-supernova stars yields a range of KS slopes but the KS relation is dominated by the supernova bubbles. Superbubble blowouts may lead to an alternative self-regulation by outflows and recycling. While the model is oversimplified, its simplicity and validity in the simulations may argue that it captures the origin of the KS relation.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulation of water flow in terrestrial systems

ParFlow is a parallel, variabley saturated groundwater flow code that is especially suitable for large scale problem. ParFlow simulates the three-dimensional saturated and variably saturated subsurface flow in heterogeneous porous media in three spatial dimensions. ParFlow's developemt and appkication has been on-ging for more than 10 uear. ParFlow has recently been extended to coupled surface-subsurface flow to enabel the simulation of hillslope runoff and channel routing in a truly integrated fashion. ParFlow simulates the three-dimensional varably saturated subsurface flow in strongly heterogeneous porous media in three spatial dimension.

Source record↗

Simulation of water flow in terrestrial systems

ParFlow is a parallel, variabley saturated groundwater flow code that is especially suitable for large scale problem. ParFlow simulates the three-dimensional saturated and variably saturated subsurface flow in heterogeneous porous media in three spatial dimensions. ParFlow's developemt and appkication has been on-ging for more than 10 uear. ParFlow has recently been extended to coupled surface-subsurface flow to enabel the simulation of hillslope runoff and channel routing in a truly integrated fashion. ParFlow simulates the three-dimensional varably saturated subsurface flow in strongly heterogeneous porous media in three spatial dimension.

Source record↗

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N. One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an “intelligent” mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N: One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an ''intelligent'' mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

Computer simulation of liquid-vapor coexistence of confined quantum fluids

The liquid-vapor coexistence (LV) of bulk and confined quantum fluids has been studied by Monte Carlo computer simulation for particles interacting via a semiclassical effective pair potential V{sub eff}(r) = V{sub LJ} + V{sub Q}, where V{sub LJ} is the Lennard-Jones 12-6 potential (LJ) and V{sub Q} is the first-order Wigner-Kirkwood (WK-1) quantum potential, that depends on β = 1/kT and de Boer's quantumness parameter Λ=h/σ√(mε), where k and h are the Boltzmann's and Planck's constants, respectively, m is the particle's mass, T is the temperature of the system, and σ and ε are the LJ potential parameters. The non-conformal properties of the system of particles interacting via the effective pair potential V{sub eff}(r) are due to Λ, since the LV phase diagram is modified by varying Λ. We found that the WK-1 system gives an accurate description of the LV coexistence for bulk phases of several quantum fluids, obtained by the Gibbs Ensemble Monte Carlo method (GEMC). Confinement effects were introduced using the Canonical Ensemble (NVT) to simulate quantum fluids contained within parallel hard walls separated by a distance L{sub p}, within the range 2σ ⩽ L{sub p} ⩽ 6σ. The critical temperature of the system is reduced by decreasing L{sub p} and increasing Λ, and the liquid-vapor transition is not longer observed for L{sub p}/σ < 2, in contrast to what has been observed for the classical system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-E-I-36: A KWIC and Dirty Look at Dose Savings and Perfusion Metrics in Simulated CT Neuro Perfusion Exams

Purpose: CT neuro perfusion scans are one of the highest dose exams. Methods to reduce dose include decreasing the number of projections acquired per gantry rotation, however conventional reconstruction of such scans leads to sampling artifacts. In this study we investigated a projection view-sharing reconstruction algorithm used in dynamic MRI – “K-space Weighted Image Contrast” (KWIC) – applied to simulated perfusion exams and evaluated dose savings and impacts on perfusion metrics. Methods: A FORBILD head phantom containing simulated time-varying objects was developed and a set of parallel-beam CT projection data was created. The simulated scans were 60 seconds long, 1152 projections per turn, with a rotation time of one second. No noise was simulated. 5mm, 10mm, and 50mm objects were modeled in the brain. A baseline, “full dose” simulation used all projections and reduced dose cases were simulated by downsampling the number of projections per turn from 1152 to 576 (50% dose), 288 (25% dose), and 144 (12.5% dose). KWIC was further evaluated at 72 projections per rotation (6.25%). One image per second was reconstructed using filtered backprojection (FBP) and KWIC. KWIC reconstructions utilized view cores of 36, 72, 144, and 288 views and 16, 8, 4, and 2 subapertures respectively. From the reconstructed images, time-to-peak (TTP), cerebral blood flow (CBF) and the FWHM of the perfusion curve were calculated and compared against reference values from the full-dose FBP data. Results: TTP, CBF, and the FWHM were unaffected by dose reduction (to 12.5%) and reconstruction method, however image quality was improved when using KWIC. Conclusion: This pilot study suggests that KWIC preserves image quality and perfusion metrics when under-sampling projections and that the unique contrast weighting of KWIC could provided substantial dose-savings for perfusion CT scans. Evaluation of KWIC in clinical CT data will be performed in the near future. R01 EB014922, NCI Grant U01 CA181156 (Quantitative Imaging Network), and Tobacco Related Disease Research Project grant 22RT-0131.

60 APPLIED LIFE SCIENCES↗

The AMP (Advanced MultiPhysics) Nuclear Fuel Performance Code

The AMP (Advanced MultiPhysics) Nuclear Fuel Performance code is a new, three-dimensional, multi-physics tool that uses state-of-the-art solution methods and validated nuclear fuel models to simulate the nominal operation and anticipated operational transients of nuclear fuel. The AMP Nuclear Fuel Performance code leverages existing validated material models from traditional fuel performance codes and the Scale/ORIGEN-S spent-fuel characterization code to provide an initial capability that is shown to be sufficiently accurate for a single benchmark problem and anticipated to be accurate for a broad range of problems. The thermomechanics-chemical foundation can be solved in a time-dependent or quasi-static approach with any variation of operator-split or fully-coupled solutions at each time step. The AMP Nuclear Fuel Performance code provides interoperable interfaces to leading computational mathematics tools, which will simplify the integration of the code into existing parallel code suites for reactor simulation or lower-length-scale coupling. A baseline validation of the AMP Nuclear Fuel Performance code has been performed through the modeling of an experiment in the Halden Reactor Project (IFA-432), which is the first validation problem incorporated in the FRAPCON Integral Assessment report.

Clarno, Kevin T↗

Hydrocode Development on the Ncube and the Connection Machine Hypercubes [Book Chapter]

Hydrocode simulations constitute an important tool at Sandia National Laboratories and elsewhere for analyzing complex two- and three-dimensional systems. However, current vector supercomputers do not provide a growth path to enable fast, routine, and cost-effective simulations of large problems. Future, massively-parallel computers will provide a solution. Sandia has already developed simplified versions of the production hydrocode CTH for the Connection Machine and the nCUBE massively-parallel supercomputers. The parallel versions solve problems in two-dimensional, multi-fluid, shock-wave physics. Code development strategy, coding methodology, visualization techniques and performance results for this work are described.

640410 -- Fluid Physics-- General Fluid Dynamics↗