Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “execution time”

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 163 records · Page 9

ScalaTrace: Tracing, Analysis and Modeling of HPC Codes at Scale

Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather their communication traces and then replay them, which facilitates application tuning and future procurements. While past approaches lacked lossless scalable trace collection, we contribute an approach that provides orders of magnitude smaller, if not near constant-size, communication traces regardless of the number of nodes while preserving structural information. We introduce intra- and inter-node compression techniques of MPI events, we develop a scheme to preserve time and causality of communication events, and we present results of our implementation for BlueGene/L. Given this novel capability, we discuss its impact on communication tuning and on trace extrapolation. To the best of our knowledge, such a concise representation of MPI traces in a scalable manner combined with time-preserving deterministic MPI call replay are without any precedence.

97 MATHEMATICS AND COMPUTING↗

Mean-Field-Game Model for Botnet Defense in Cyber-Security

We initiate the analysis of the response of computer owners to various offers of defence systems against a cyber-hacker (for instance, a botnet attack), as a stochastic game of a large number of interacting agents. We introduce a simple mean-field game that models their behavior. It takes into account both the random process of the propagation of the infection (controlled by the botner herder) and the decision making process of customers. Its stationary version turns out to be exactly solvable (but not at all trivial) under an additional natural assumption that the execution time of the decisions of the customers (say, switch on or out the defence system) is much faster that the infection rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cooperative Server Clustering for a Scalable GAS Model on petascale cray XT5 Systems

Global Address Space (GAS) programming models are attractive because they retain the easy-to-use addressing model that is the characteristic of shared-memory style load and store operations. The scalability of GAS models depends directly on the design and implementation of runtime libraries on the targeted platforms. In this paper, we examine the memory requirement of a popular GAS runtime library, Aggregate Remote Memory Copy Interface (ARMCI) on petascale Cray XT 5 systems. Then we describe a new technique cooperative server clustering that enhances the memory scalability of ARMCI communication servers. In cooperative server clustering, ARMCI servers are organized into clusters, and cooperatively process incoming communication requests among them. A request intervention scheme is also designed to expedite the return of responses to the initiating processes. Our experimental results demonstrate that, with very little impact on ARMCI communication latency and bandwidth, cooperative server clustering is able to significantly reduce the memory requirement of ARMCI communication servers, thereby enabling highly scalable scientific applications. In particular, it dramatically reduces the total execution time of a scientific application, NWChem, by 45% on 2400 processes.

99 GENERAL AND MISCELLANEOUS↗

Prediction of Subsidence of Buildings as a Result of Earthquakes by Gaussian Process Regression

Subsidence of a foundation caused by liquefaction of sandy soil is a critical step in the creation of a building. Seven measured indicators of soil liquefaction in the course of an earthquake were selected as key impacting indicators that predict subsidence of a building. These indicators are the earthquake intensity EI, length–height ratio L/H, average contact pressure p, width-depth ratio, relative density D{sub R}, thickness of the non-liquefied layer, and the depth of the gravel layer. Furthermore, as a probabilistic machine learning kernel and powerful tool for solving highly nonlinear problems, Gaussian process regression (GPR model) can meet execution time requirements and assure a high level of precision of subsidence prediction due to the intrinsic defects of theoretical analysis and numerical calculation. A total of 41 groups of typical cases were first selected as a training sample and 20 groups of typical cases were defined as a test sample, where these cases possess input test value and were obtained at the yield of the prediction accuracy from the GPR model. Next, the PLS method, MLR method and LSSVM method were selected to verify the validity and reliability of the GPR model. Finally, the simulation result shows that the GPR model can improve the prediction precision for the case of the above problems and is of great value for practical applications.

58 GEOSCIENCES↗

A preconditioning technique for Schur complement systems arising in stochastic optimization

Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adversely affect the scalability of this approach. We address this issue by proposing a stochastic preconditioner for the Schur complement matrix and by using Krylov iterative methods for the solution of the dense linear systems. The stochastic preconditioner is built based on a subset of existing scenarios and can be assembled and factorized on a separate process before the computation of the Schur complement matrix finishes on the remaining processes. The expensive factorization of the Schur complement is removed from the parallel execution flow and the scaling of the optimization solver is considerably improved with this approach. The spectral analysis indicates an exponentially fast convergence in probability to 1 of the eigenvalues of the preconditioned matrix with the number of scenarios incorporated in the preconditioner. Numerical experiments performed on the relaxation of a unit commitment problem show good performance, in terms of both the accuracy of the solution and the execution time.

99 GENERAL AND MISCELLANEOUS↗

HPC Node Performance and Energy Modeling with the Co-Location of Applications

Multicore processors have become an integral part of modern large-scale and high-performance parallel and distributed computing systems. This advance became necessary as the demand for increased system performance has exceeded the limits that single core processors can provide. Unfortunately, applications co-located on multicore processors can suffer from decreased performance and increased dynamic energy use as a result of access to shared resources, such as memory. Consequently, it is increasingly important to characterize the performance of applications that execute on these architectures. This work investigates some of the disadvantages of co-location, and presents a methodology for building models capable of utilizing varying amounts of information about a target application and its co-located applications to make predictions about the target application’s execution time and the system’s energy use under arbitrary co-locations of a wide range of application types. The proposed methodology is validated on three different server class Intel Xeon multicore processors using eleven applications from two scientific benchmark suites. The model’s utility for scheduling is also demonstrated in a simulated large-scale high-performance computing environment through the creation of a co-location aware scheduling heuristic. This heuristic demonstrates that scheduling using information generated with the proposed modeling methodology is capable of making significant improvements over a scheduling heuristic that is naive to co-location interference.

performance modeling, energy modeling, resource ma↗

A new hybrid algorithm combining a new chaos optimization approach with gradient descent for high dimensional optimization problems

Chaos optimization algorithm (COA) is a recently developed method for global optimization based on chaos theory. It has the features of easy implementation, short execution time and robust mechanisms of escaping from local optima compared with the existing stochastic searching algorithm. By integrating the gradient descent method with a new COA approach using new strategies including symmetrization and levelling, a novel hybrid method, called SCGD, is proposed in this paper. The main idea is to combine the good ability of exploitation of the gradient descent with the high ability of exploration of COA. The purpose is to avoid being trapped into local optima and to improve convergence in large space and high-dimension optimization problems. The simulation results based on a set of 50 benchmark functions with diverse properties and different dimensions show the efficiency and the abilities of the proposed method in finding the global optima compared with the existing methods.

97 MATHEMATICS AND COMPUTING↗

Thermal hydraulic model of the molten salt reactor experiment with the NEAMS system analysis module

System analysis codes have a long history of providing best-estimate and conservative safety analysis for both light water and advanced reactor technologies, including molten salt reactors. As interest continues to expand with advanced reactor concepts, system analysis codes will need revisions to accommodate the behavior of these technologies. Legacy system analysis codes will need to be updated to the latest numerical techniques to shorten execution time and increase the accuracy of results. One example of a modern system analysis code that already encompasses these characteristics is the System Analysis Module (SAM). One key objective of this paper was to review available information for system code modeling of the Molten Salt Reactor Experiment (MSRE) from sources in the open literature and collect the information from these open sources in one place for the first time. This supports the potential objective of developing an open specification for system code analysis for MSRE steady state and transients with and without reactor kinetics. Data from actual MSRE tests will serve as the basis for code-to-code comparison exercises, including the MSRE zero power physics tests, the fuel pump start-up and coast down tests, and the natural circulation transient. The objective is to produce a code-to-code benchmark with a standardized set of comparison problems, recognizing the limitations of the original data. To demonstrate an initial application of this objective and the usefulness of compiling this open data, two Molten Salt Reactor Experiment (MSRE)-related models were developed to evaluate SAM for liquid fueled molten salt reactors. One model was the SAM MSRE hydraulic mockup, which provided experimental data for pressure drop measurements. The second model was the complete MSRE primary loop. The MSRE primary loop model incorporated a fluoride salt fuel/coolant with heat transfer in both the core and heat exchanger. For both the hydraulic mockup and MSRE primary loop models, a holistic 1-D system description was built using open documentation, an open description that can be readily modified and applied for any system analysis code. SAM results for the pressure drop of the hydraulic mockup model were within 6% with measurements. Coolant temperatures for the primary loop model matched the expected axial change in temperature from historical calculations. Using alternative coolant properties obtained from the literature, corresponding to salts with different actinide contents, returned similar trends in core temperature profiles. A thermal hydraulic demonstration of a loss-of-flow transient showed the importance of coupling SAM thermal hydraulic analysis to neutronics. Here, this coupling is essential for simulating MSR transients with system analysis codes.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Improved natural convection heat transfer correlations for reactor cavity cooling systems of high-temperature gas-cooled reactors: From computational fluid dynamics to Pronghorn

The Reactor Cavity Cooling System (RCCS) is a common reactor safety system in High Temperature Gas Cooled Reactors (HTGR) that removes heat from the Reactor Pressure Vessel (RPV) by radiation ($\sim 80\%$) and natural convection ($\sim 20\%$). For simulation of accident scenarios of HTGRs, intermediate fidelity and system codes models must be employed for limiting the models' execution time. While accurate quantification of the radiative heat transfer is available in these models, quantification of natural convection must rely on correlations of questionable accuracy for the Nusselt number. Commonly used correlations are based in experiments performed at low Rayleigh numbers and/or using isothermal walls in simplified geometries. Here, this work improves on the accuracy of natural convection heat transfer correlations in support for HTGR designs. These correlations include both local and average Nusselt numbers as a function of the global Rayleigh number, the local Rayleigh number, and the temperature profile at the hot wall of the RCCS. In the absence of dedicated experiments and the difficulty of performing high-fidelity simulations at realistic Rayleigh numbers, the data to fit the correlations are generated with Computational Fluid Dynamics (CFD) using Reynolds Averaged Navier-Stokes (RANS) models. First, a careful selection of the RANS turbulence model is performed by comparing the results obtained with different RANS turbulence models against high fidelity simulations of natural convection at $Ra \ 1 \times 10^{11}$ in a rectangular cavity. Next, the selected model is used to perform simulations of an HTGR cavity at different high Rayleigh numbers $\in [6.1 \times 10^{11},2.9 \times 10^{13}]$ to encompass several HTGR designs, assuming an isothermal RPV wall. The results obtained are used to fit a correlation for the average and space-varying Nusselt number as a function of the global and local Rayleigh numbers via a sparsity-promoting least-squares method. The selected RANS model is then used to perform simulations of a PBMR 400 HTGR cavity with the temperature profiles at the RPV wall obtained during a PLOFC transient. We use the results obtained to fit a temperature-dependent correction to the space-varying Nusselt number with the sparsity-promoting least-squares method. The results obtained in this work, enable system-level codes, such as Pronghorn, to perform higher-fidelity simulations of the heat exchange process in the RCCS while still maintaining a low computational cost.

42 ENGINEERING↗

Electric train energy consumption modeling

For this paper we develop an electric train energy consumption modeling framework considering instantaneous regenerative braking efficiency in support of a rail simulation system. The model is calibrated with data from Portland, Oregon using an unconstrained non-linear optimization procedure, and validated using data from Chicago, Illinois by comparing model predictions against the National Transit Database (NTD) estimates. The results demonstrate that regenerative braking efficiency varies as an exponential function of the deceleration level, rather than an average constant as assumed in previous studies. The model predictions are demonstrated to be consistent with the NTD estimates, producing a predicted error of 1.87% and -2.31%. The paper demonstrates that energy recovery reduces the overall power consumption by 20% for the tested Chicago route. Furthermore, the paper demonstrates that the proposed modeling approach is able to capture energy consumption differences associated with train, route and operational parameters, and thus is applicable for project-level analysis. The model can be easily implemented in traffic simulation software, used in smartphone applications and eco-transit programs given its fast execution time and easy integration in complex frameworks.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Discrete event cellular automata: A new approach to cellular automata for computational material science

Here, we explore the computational advantages of discrete event simulation for cellular automata models of grain growth. These benefits include a reduction in execution time by up to an order of magnitude and the elimination of numerical errors that stem from overshooting grain capture events and approximating a Poisson process with a Bernoulli process. The fundamental mechanisms speeding up the discrete event simulation are uncovered, and with these we create a speedup model that explains our experimental outcomes.

36 MATERIALS SCIENCE↗

Simulation toolkit for digital material characterization of large image-based microstructures

In this paper, an efficient image-based simulation toolkit for material characterization is presented, which is scalable to work from personal computers to workstations. The effective thermal conductivity, elasticity, and permeability are evaluated employing a computational homogenization framework based on the Finite Element Method (FEM). Two complementary open-source packages are presented: one developed in Python, which can convert digital images into voxel meshes (pyTomoviewer); the other developed in Julia, that can run numerical simulations to compute effective material properties (chpack). Also, a CUDA C version of chpack is provided (chfem_gpu). They were designed to deal with large multi-phase models, so strategies were devised to minimize their memory footprint, while avoiding a high toll on execution time. The voxel-based approach significantly simplifies the FEM meshes and allows efficient matrix-free implementations. In that sense, to handle large linear systems of equations, the element-by-element (EBE) technique is adopted, in conjunction with a low-memory implementation of the Preconditioned Conjugate Gradient (PCG) method. Finally, the code was thoroughly tested on an artificial geometry made of a square array of cylinders, for which analytical solutions exist, as well as on a real micro-tomographic reconstruction of FiberForm TM , a carbon preform commonly used in thermal protection systems.

36 MATERIALS SCIENCE↗

Development of mpi_EPIC model for global agroecosystem modeling

Models that address policy-maker concerns about multi-scale effects of food and bioenergy production systems are computationally demanding. We integrated the message passing interface algorithm into the process-based EPIC model to accelerate computation of ecosystem effects. Simulation performance was further enhanced by applying the Vampir framework. When this enhanced mpi_EPIC model was tested, total execution time for a global 30-year simulation of a switchgrass cropping system was shortened to less than 0.5 hours on a supercomputer. The results illustrate that mpi_EPIC using parallel design can balance simulation workloads and facilitate large-scale, high-resolution analysis of agricultural production systems, management alternatives and environmental effects.

54 ENVIRONMENTAL SCIENCES↗

ROOT: A C++ framework for petabyte data storage, statistical analysis and visualization

ROOT is an object-oriented C++ framework conceived in the high-energy physics (HEP) community, designed for storing and analyzing petabytes of data in an efficient way. Any instance of a C++ class can be stored into a ROOT file in a machine-independent compressed binary format. In ROOT the TTree object container is optimized for statistical data analysis over very large data sets by using vertical data storage techniques. These containers can span a large number of files on local disks, the web or a number of different shared file systems. In order to analyze this data, the user can chose out of a wide set of mathematical and statistical functions, including linear algebra classes, numerical algorithms such as integration and minimization, and various methods for performing regression analysis (fitting). In particular, the RooFit package allows the user to perform complex data modeling and fitting while the RooStats library provides abstractions and implementations for advanced statistical tools. Multivariate classification methods based on machine learning techniques are available via the TMVA package. A central piece in these analysis tools are the histogram classes which provide binning of one- and multi-dimensional data. Results can be saved in high-quality graphical formats like Postscript and PDF or in bitmap formats like JPG or GIF. The result can also be stored into ROOT macros that allow a full recreation and rework of the graphics. Users typically create their analysis macros step by step, making use of the interactive C++ interpreter CINT, while running over small data samples. Once the development is finished, they can run these macros at full compiled speed over large data sets, using on-the-fly compilation, or by creating a stand-alone batch program. Finally, if processing farms are available, the user can reduce the execution time of intrinsically parallel tasks - e.g. data mining in HEP - by using PROOF, which will take care of optimally distributing the work over the available resources in a transparent way.

99 GENERAL AND MISCELLANEOUS↗

An improved methodology for modeling short pulse buried layer x-ray emission spectra

Radiation-hydrodynamic and spectroscopic modeling are important aspects of high energy density experimental design. In this paper, we improve the performance and capabilities over those obtainable with a previous methodology used for simulating x-ray emission spectra from buried layer targets heated by short pulse lasers. The improvement incorporates post-processing HYDRA radiation-hydrodynamic output with a non-local thermodynamic equilibrium atomic-kinetics radiation transport code, Cretin. Each code uses an independent radiation field which allows decoupling HYDRA's radiation group structure from Cretin's spectral output to improve the speed and flexibility of the design methodology. The execution time decreases from 2–3 days to a few hours while the flexibility of the improved methodology allows for performing sensitivity studies including a comparison of steady-state and time-dependent atomic kinetics and differences in the radiation group structure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neural network model of neutral beam injection in the EAST tokamak to enable fast transport simulations

The neutral beam injection (NBI) system in EAST produces energetic neutral particles, which collide with electrons and ions in tokamak plasmas and heat the plasmas through Coulomb collisions. Moreover, it drives a non-inductive source of current, due to the charge-exchange collision between neutral particles and ions, and injects toroidal torque, which generates a toroidal rotation of the plasma. The effect caused by the NBI system, such as plasma heating, current drive, total neutron rate, momentum transfer, and shine-through, are modeled by a comprehensive module called NUBEAM. However, NUBEAM is computationally intensive since it relies on Monte Carlo methods. In this work, a neural network model has been developed as a surrogate model for NUBEAM in EAST. The database for neural-network model training, validation and testing is generated by running TRANSP for experimental discharges from recent EAST campaigns (after the latest NBI upgrade) while using the NUBEAM module. Simulation results illustrate that the trained neural network has the capability of replicating the predictions made by NUBEAM while demanding a significantly shorter execution time. Finally, these results indicate that surrogate models like the one proposed in this work could enable fast transport simulations for EAST after integrating them into a control-oriented predictive code such as COTSIM.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of a first-principles hybrid boiler model for oxy-combustion power generation system

The design of an oxy-combustion system for CO 2 capture involves the integration of multiple devices including air separation unit, coal-fired boiler, steam turbine, flue gas cleanup, recycle, and compression units. Thousands of design parameters for the entire system need to be optimized to achieve the lowest cost per kilowatt-hour of electricity generated. An appropriate first-principles based boiler model with short computer execution time but yet reasonable accuracy in both air-fired and oxy-fired configurations is highly desired. To this end, a hybrid boiler model with 1-D resolution for main flow and reaction related calculations and 3-D resolution for radiative heat transfer was developed as a part of the oxy-combustion subtask of the Carbon Capture and Simulation Initiative (CCSI) sponsored by U.S. Department of Energy. Furthermore, the developed model is able to automatically generate a 3-D mesh based on user-specified furnace shape for the calculation of radiative heat transfer using discrete ordinates method.

01 COAL, LIGNITE, AND PEAT↗

A fast parallel Poisson solver on irregular domains applied to beam dynamics simulations

We discuss the scalable parallel solution of the Poisson equation within a Particle-In-Cell (PIC) code for the simulation of electron beams in particle accelerators of irregular shape. The problem is discretized by Finite Differences. Depending on the treatment of the Dirichlet boundary the resulting system of equations is symmetric or 'mildly' nonsymmetric positive definite. In all cases, the system is solved by the preconditioned conjugate gradient algorithm with smoothed aggregation (SA) based algebraic multigrid (AMG) preconditioning. We investigate variants of the implementation of SA-AMG that lead to considerable improvements in the execution times. We demonstrate good scalability of the solver on distributed memory parallel processor with up to 2048 processors. We also compare our iterative solver with an FFT-based solver that is more commonly used for applications in beam dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗