Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compute intensive problems”

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 127 records · Page 7

Assessment of Grizzly Capabilities for Reactor Pressure Vessels and Reinforced Concrete Structures

Over the last several years, capabilities to simulate the progression and effects of degradation in critical structures in light water reactor (LWR) nuclear power plants have been under development in the Grizzly code. Age-related material degradation is important for a number of systems in LWRs, but the main focus for Grizzly development has been on reactor pressure vessels (RPVs) and concrete structures because of their central role and the difficulty of replacement of these structures if they are found to be degraded to an unacceptable degree. The capabilities for analyzing both RPVs and concrete structures in Grizzly have reached a point where the feature sets are sufficiently complete to perform credible analyses of those types of structures. Because of this, the emphasis has shifted from foundational development to assessing the accuracy of these modeling capabilities on representative problems of interest and on improving the physical basis of those models to improve their ability to predict the actual response of those structural systems. This report documents a first set of test cases that have been developed to assess the Grizzly code on real-world problems for these two types of structures. For RPVs, these test cases consist of a set of benchmark problems where Grizzly is compared to another code. For concrete structures, a set of models of experimental specimens designed to characterize the multidimensional swelling response of reinforced concrete members due to alkali-silica reaction (ASR) has been developed and compared with experimental results. Both the RPV and concrete test cases developed here are much more computationally intensive than the small regression tests that are used in the testing that Grizzly undergoes every time a proposed set of changes is made to ensure that those changes do not adversely affect previously established behavior. A system for regularly running these large problems to monitor the behavior of the code as it is developed has been instituted. While these test cases generally indicate good comparison with the benchmark results, they also indicate areas where further development is warranted.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

MCNPs Easy Sources for (α,n) (MESA):Verification with Sources4c

MESA is intended to be a direct re-implementation of the algorithms documented in the Sources manual in C++. However, some fundamental changes to the computational structure and logic were made to avoid the use of goto, require consistency in input definition, and reduce computational approximations in later steps of three-layer problems. In addition, MESA uses α-decay information from ISC libraries (based on ENDF). In most cases, differences between Sources4c and MESA are dominated by differences in decay energy spectra and intensities. To verify this we have reproduced 6 problems that are documented examples or samples in Sources4c. These problems cover the three types of problems MESA currently supports: homogeneous, interface, and three-layer.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Radiation modeling using the Uintah heterogeneous CPU/GPU runtime system. In: XSEDE '12 Proceedings of the 1st Conference of the Extreme Science and Engineering Discovery Environment: Bridging from the eXtreme to the campus and beyond, Article No. 4

The Uintah Computational Framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow solvers and particle-based methods for solids, together with a novel asynchronou task-based approach with fully automated load balancing. Uintah demonstrates excellent weak and strong scalability at full machine capacity on XSEDE resources such as Ranger and Kraken, and through the use of a hybrid memory approach based on a combination of MPI and Pthreads, Uintah now runs on up to 262k cores on the DOE Jaguar system. In order to extend Uintah to heterogeneous systems, with ever-increasing CPU core counts and additional on-node GPUs, a new dynamic CPU-GPU task scheduler is designed and evaluated in this study. This new scheduler enables Uintah to fully exploit these architectures with support for asynchronous, out-of-order scheduling of both CPU and GPU computational tasks. A new runtime system has also been implemented with an added multi-stage queuing architecture for efficient scheduling of CPU and GPU tasks. This new runtime system automatically handles the details of asynchronous memory copies to and from the GPU and introduces a novel method of pre-fetching and preparing GPU memory prior to GPU task execution. In this study this new design is examined in the context of a developing, hierarchical GPU-based ray tracing radiation transport model that provides Uintah with additional capabilities for heat transfer and electromagnetic wave propagation. The capabilities of this new scheduler design are tested by running at large scale on the modern heterogeneous systems, Keeneland and TitanDev, with up to 360 and 960 GPUs respectively. On these systems, we demonstrate significant speedups per GPU against a standard CPU core for our radiation problem.

Humphrey, Alan↗

High Order Implicit Residual-Based Spatial Discretization Error Estimation for S N Neutron Transport

This work demonstrates our novel residual source spatial discretization error estimator (LeR/TEAD) for a DGFEM-1 discretization and assesses it along with two contemporary estimators, Ragusa and Wang's h -refinement estimator (RW) and Duo, Azmy, and Zikatanov's explicit residual-based estimator (DAZ), on a suite of Method of Manufactured Solutions (MMS) 2D problems and three realistic problem geometries. LeR/TE-AD is attractive because it directly estimates the local error in the angular flux, as opposed to a mere indicator of the error's behavior, on the same mesh and method order as the original numerical solution, thus typically being less computationally intensive than a refinement-based method. On the MMS suite, LeR/TE-AD consistently displayed a reduced performance versus its DGFEM-0 results in terms of accuracy and precision metrics, though it was not typically grossly inaccurate. This is attributed to the irregularities in the true solution across singular characteristics limiting the local accuracy of the numerical flux solution, leading to poor derivative approximations used in the residual approximations. The error transport problem then spreads the error in the residual to nearby cells, causing a greater degree of imprecision that did not afflict DAZ or RW. In testing the estimators on realistic problem geometries, however, LeR/TE-AD fared better. In practice, the true error is much larger in non-idealized geometries like in MMS, and a superlinear true solution means that RW and DAZ are not beneficially biased for DGFEM-1 error estimation. LeR/TE-AD was typically first or second in accuracy, primarily competing with RW, but the latter usually consumed 2-4 times the computational time as LeR/TE-AD, and requires a solution with four times as many unknowns. Furthermore, RW and LeR/TE-AD can be used to compute direct estimates of the error in any quantity of interest that is based on the angular ux solution, such as the fission rate density in a fuel pin, whereas DAZ requires a heuristic extension due to its norm-based nature.

97 MATHEMATICS AND COMPUTING↗

An improved multi-exposure approach for high quality holographic femtosecond laser patterning

High efficiency two photon polymerization through single exposure via spatial light modulator (SLM) has been used to decrease the fabrication time and rapidly realize various micro/nanostructures, but the surface quality remains a big problem due to the speckle noise of optical intensity distribution at the defocused plane. Here, a multi-exposure approach which used tens of computer generate holograms successively loaded on SLM is presented to significantly improve the optical uniformity without losing efficiency. By applying multi-exposure, we found that the uniformity at the defocused plane was increased from ∼0.02 to ∼0.6 according to our simulation. The fabricated two series of letters “HELLO” and “USTC” under single-and multi-exposure in our experiment also verified that the surface quality was greatly improved. Moreover, by this method, several kinds of beam splitters with high quality, e.g., 2 × 2, 5 × 5 Daman, and complex nonseperate 5 × 5, gratings were fabricated with both of high quality and short time (<1 min, 95% time-saving). This multi-exposure SLM-two-photon polymerization method showed the promising prospect in rapidly fabricating and integrating various binary optical devices and their systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrated dynamic policy management methodology and system for strategic environmental assessment of golf course installation policy in Taiwan

Strategic environmental assessment (SEA) focuses primarily on assessing how policies, plans, and programs (PPPs) influence the sustainability of the involved regions. However, the processes of assessing policies and developing management strategies for pollution load and resource use are usually separate in the current SEA system. This study developed a policy management methodology to overcome the defects generated during the above processes. This work first devised a dynamic management framework using the methods of systems thinking, system dynamics, and Managing for Results (MFRs). Furthermore, a driving force-pressure-state-impact-response (DPSIR) indicator system was developed. The golf course installation policy was applied as a case study. Taiwan, counties of Taiwan, and the golf courses within those individual counties were identified as a system, subsystems, and objects, respectively. This study identified an object-linked double-layer framework with multi-stage-option to simultaneously to quantify golf courses in each subsystem and determine ratios of abatement and allocation for pollution load and resource use of each golf course. The DPSIR indicator values for each item of each golf course in each subsystem are calculated based on the options taken in the two decision layers. The summation of indicator values for all items of all golf courses in all subsystems according to various options is defined as the sustainability value of the policy. An optimization model and a system (IDPMS) were developed to obtain the greatest sustainability value of the policy, while golf course quantity, human activity intensity, total quantities of pollution load and resource use are simultaneously obtained. The solution method based on enumeration of multiple bounds for objectives and constraints (EMBOC) was developed for the problem with 1.95 x 10{sup 128} combinations of possible options to solve the optimal solution in ten minutes using a personal computer with 3.0 GHz CPU. This study obtain the policy with the optimal environmental sustainability value in Taiwan is 102 golf courses. Human activity intensity and total quantities of pollution load and resource use which are concurrently obtained are less than those of the existing policy and the existing quantities in 2006. The optimal solution remains unchanged under most sensitivity analysis conditions, unless the weights and constraints are extremely changed. The analytical results indicate that the proposed methodology can be used to assist the authorities for simultaneously generating and assessing the policy during the SEA process.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

Higher-order particle representation for particle-in-cell simulations

In this paper we present an alternative approach to the representation of simulation particles for unstructured electrostatic and electromagnetic PIC simulations. In our modified PIC algorithm we represent particles as having a smooth shape function limited by some specified finite radius, r 0 . A unique feature of our approach is the representation of this shape by surrounding simulation particles with a set of virtual particles with delta shape, with fixed offsets and weights derived from Gaussian quadrature rules and the value of r 0 . As the virtual particles are purely computational, they provide the additional benefit of increasing the arithmetic intensity of traditionally memory bound particle kernels. The modified algorithm is implemented within Sandia National Laboratories' unstructured EMPIRE-PIC code, for electrostatic and electromagnetic simulations, using periodic boundary conditions. We show results for a representative set of benchmark problems, including electron orbit, a transverse electromagnetic wave propagating through a plasma, numerical heating, and a plasma slab expansion. In this work, good error reduction across all of the chosen problems is achieved as the particles are made progressively smoother, with the optimal particle radius appearing to be problem-dependent.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A performance model for the communication in fast multipole methods on high-performance computing platforms

Exascale systems are predicted to have approximately 1 billion cores, assuming gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. The fast multipole method (FMM) was originally developed for accelerating N-body problems in astrophysics and molecular dynamics but has recently been extended to a wider range of problems. Its high arithmetic intensity combined with its linear complexity and asynchronous communication patterns make it a promising algorithm for exascale systems. In this paper, we discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on internode communication. We focus on the communication part only; the efficiency of the computational kernels are beyond the scope of the present study. We develop a performance model that considers the communication patterns of the FMM and observe a good match between our model and the actual communication time on four high-performance computing (HPC) systems, when latency, bandwidth, network topology, and multicore penalties are all taken into account. To our knowledge, this is the first formal characterization of internode communication in FMM that validates the model against actual measurements of communication time. The ultimate communication model is predictive in an absolute sense; however, on complex systems, this objective is often out of reach or of a difficulty out of proportion to its benefit when there exists a simpler model that is inexpensive and sufficient to guide coding decisions leading to improved scaling. The current model provides such guidance.

Computer Science↗

An explicit, energy-conserving particle-in-cell scheme

We present an explicit temporal discretization of particle-in-cell schemes for the non-relativistic Vlasov equation that results in exact energy conservation when combined with an appropriate spatial discretization. The scheme is inspired by a simple, second-order explicit scheme that conserves energy exactly in the Eulerian context. We show that direct translation to particle-in-cell does not result in strict conservation, but derive a simple correction based on an analytically solvable optimization problem that recovers conservation. While this optimization problem is not guaranteed to have a real solution for every particle, we provide a correction that makes imaginary values extremely rare and still admits $\mathcal{O}$(10 –12 ) fractional errors in energy for practical simulation parameters. We present the scheme in both electrostatic – where we use the Ampère formulation – and electromagnetic contexts. With an electromagnetic field solve, the field update is most naturally linearly implicit, but the more computationally intensive particle update remains fully explicit. Here, we also show how the scheme can be extended to use the fully explicit leapfrog and pseudospectral analytic time-domain (PSATD) field solvers. The scheme is tested on standard kinetic plasma problems, confirming its conservation properties.

Energy conservation↗

Design of the protoDUNE raw data management infrastructure

The Deep Underground Neutrino Experiment (DUNE) will employ a set of Liquid Argon Time Projection Chambers (LArTPC) with a total mass of 40 kt as the main components of its Far Detector. In order to validate this technology and characterize the detector performance at full scale, an ambitious experimental program (called “protoDUNE”) has been initiated which includes a test of the large-scale prototypes for the single-phase and dual-phase LArTPC technologies, which will run in a beam at CERN. The total raw data volume that is slated to be collected during the scheduled 3-month beam run is estimated to be in excess of 2.5 PB for each detector. This data volume will require that the protoDUNE experiment carefully design the DAQ, data handling and data quality monitoring systems to be capable of dealing with challenges inherent with peta-scale data management while simultaneously fulfilling the requirements of disseminating the data to a worldwide collaboration and DUNE associated computing sites. Here in this paper, we present our approach to solving these problems by leveraging the design, expertise and components created for the LHC and Intensity Frontier experiments into a unified architecture that is capable of meeting the needs of protoDUNE.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Transfer of Resonance Line Polarization with Partial Frequency Redistribution in the General Hanle–Zeeman Regime

The spectral line polarization encodes a wealth of information about the thermal and magnetic properties of the solar atmosphere. Modeling the Stokes profiles of strong resonance lines is, however, a complex problem both from a theoretical and computational point of view, especially when partial frequency redistribution (PRD) effects need to be taken into account. In this work, we consider a two-level atom in the presence of magnetic fields of arbitrary intensity (Hanle–Zeeman regime) and orientation, both deterministic and micro-structured. Working within the framework of a rigorous PRD theoretical approach, we have developed a numerical code that solves the full non-LTE radiative transfer problem for polarized radiation, in one-dimensional models of the solar atmosphere, accounting for the combined action of the Hanle and Zeeman effects, as well as for PRD phenomena. After briefly discussing the relevant equations, we describe the iterative method of solution of the problem and the numerical tools that we have developed and implemented. We finally present some illustrative applications to two resonance lines that form at different heights in the solar atmosphere, and provide a detailed physical interpretation of the calculated Stokes profiles. We find that magneto-optical effects have a strong impact on the linear polarization signals that PRD effects produce in the wings of strong resonance lines. We also show that the weak-field approximation has to be used with caution when PRD effects are considered.

79 ASTRONOMY AND ASTROPHYSICS↗

On the role of topological complexity in spontaneous development of current sheets

The computations presented in this work aim to asses the importance of field line interlacing on spontaneous development of current sheets. From Parker's magnetostatic theorem, such development of current sheets is inevitable in a topologically complex magnetofluid, with infinite electrical conductivity, at equilibrium. Relevant initial value problems are constructed by superposition of two untwisted component fields, each component field being represented by a pair of global magnetic flux surface. The intensity of field line interlacing is then specified by the relative amplitude of the two superposed fields. The computations are performed by varying this relative amplitude. Also to have a direct visualization of current sheet formation, we follow the evolution of flux surfaces instead of the vector magnetic field. An important finding of this paper is in the demonstration that initial field lines having intense interlacing tend to develop current sheets which are distributed throughout the computational domain with no preference for topologically favorable sites like magnetic nulls or field reversal layers. The onsets of these current sheets are attributed to favorable contortions of magnetic flux surfaces where two oppositely directed parts of the same field line or different field lines come to close proximity. However, for less intensely interlaced field lines, the simulations indicate development of current sheets at sites only where the magnetic topology is favorable. These current sheets originate as two sets of anti-parallel complimentary field lines press onto each other.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-ρAMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the coarse basis used to define the new two-level method of our interest. We illustrate the performance of this adaptive two-level procedure with a large set of numerical experiments that demonstrate its efficiency over building the solvers from scratch.

97 MATHEMATICS AND COMPUTING↗

TIME-DEPENDENT PHOTOIONIZATION OF GASEOUS NEBULAE: THE PURE HYDROGEN CASE

We study the problem of time-dependent photoionization of low density gaseous nebulae subjected to sudden changes in the intensity of ionizing radiation. To this end, we write a computer code that solves the full time-dependent energy balance, ionization balance, and radiation transfer equations in a self-consistent fashion for a simplified pure hydrogen case. It is shown that changes in the ionizing radiation yield ionization/thermal fronts that propagate through the cloud, but the propagation times and response times to such fronts vary widely and nonlinearly from the illuminated face of the cloud to the ionization front (IF). IF/thermal fronts are often supersonic, and in slabs initially in pressure equilibrium such fronts yield large pressure imbalances that are likely to produce important dynamical effects in the cloud. Further, we studied the case of periodic variations in the ionizing flux. It is found that the physical conditions of the plasma have complex behaviors that differ from any steady-state solution. Moreover, even the time average of ionization and temperature is different from any steady-state case. This time average is characterized by overionization and a broader IF with respect to the steady-state solution for a mean value of the radiation flux. Around the time average of physical conditions there is a large dispersion in instantaneous conditions, particularly across the IF, which increases with the period of radiation flux variations. Moreover, the variations in physical conditions are asynchronous along the slab due to the combination of nonlinear propagation times for thermal fronts/IFs and equilibration times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TIME-DEPENDENT MULTI-GROUP MULTI-DIMENSIONAL RELATIVISTIC RADIATIVE TRANSFER CODE BASED ON SPHERICAL HARMONIC DISCRETE ORDINATE METHOD

We develop a time-dependent, multi-group, multi-dimensional relativistic radiative transfer code, which is required to numerically investigate radiation from relativistic fluids that are involved in, e.g., gamma-ray bursts and active galactic nuclei. The code is based on the spherical harmonic discrete ordinate method (SHDOM) which evaluates a source function including anisotropic scattering in spherical harmonics and implicitly solves the static radiative transfer equation with ray tracing in discrete ordinates. We implement treatments of time dependence, multi-frequency bins, Lorentz transformation, and elastic Thomson and inelastic Compton scattering to the publicly available SHDOM code. Our code adopts a mixed-frame approach; the source function is evaluated in the comoving frame, whereas the radiative transfer equation is solved in the laboratory frame. This implementation is validated using various test problems and comparisons with the results from a relativistic Monte Carlo code. These validations confirm that the code correctly calculates the intensity and its evolution in the computational domain. The code enables us to obtain an Eddington tensor that relates the first and third moments of intensity (energy density and radiation pressure) and is frequently used as a closure relation in radiation hydrodynamics calculations.

79 ASTRONOMY AND ASTROPHYSICS↗