Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance computing systems”

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,423 records · Page 79

Applications of Ensemble-based Data Assimilation Techniques for Aquifer Characterization using Tracer Data at Hanford 300 Area

Subsurface aquifer characterization often involves high parameter dimensionality and requires tremendous computational resources if employing a full Bayesian approach. Ensemble-based data assimilation techniques, including filtering and smoothing, are computationally efficient alternatives. Despite the increasing number of applications of ensemble-based methods in assimilating flow and transport related data for subsurface aquifer charaterization, most are limited to either synthetic studies or two-dimensional problems. In this study, we applied ensemble-based techniques for assimilating field tracer experimental data obtained from the Integrated Field Research Challenge (IFRC) site at the Hanford 300 Area. The forward problem was simulated using the massively-parallel three-dimensional flow and transport code PFLOTRAN to effectively deal with the highly transient flow boundary conditions at the site and to meet the computational demands of ensemble-based methods. This study demonstrates the effectiveness of ensemble-based methods for characterizing a heterogeneous aquifer by sequentially assimilating multiple types of data. The necessity of employing high performance computing is shown to enable increasingly mechanistic non-linear forward simulations to be performed within the data assimilation framework for a complex system with reasonable turnaround time.

data assimilation, ensemble kalman filter, inverse↗

Quantum Chemical Density Matrix Renormalization Group Method Boosted by Machine Learning

The use of machine learning (ML) to refine low-level theoretical calculations to achieve higher accuracy is a promising and actively evolving approach known as Δ-ML. The density matrix renormalization group (DMRG) is a powerful variational approach widely used for studying strongly correlated quantum systems. High computational efficiency can be achieved without compromising accuracy. Here, we demonstrate the potential of a simple ML model to significantly enhance the performance of the quantum chemical DMRG method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantification, Trade-off Analysis, and Optimal Checkpoint Placement for Reliability and Availability

Checkpointing is the most widely used technique in high-performance computing (HPC) to ensure the application progress in the presence of failures. In this paper, we present mathematical models of the checkpointing systems to quantify their reliability and availability. We perform trade-off analysis with respect to resource costs and reliability. Then, we explore the optimal checkpoint placement for checkpointing systems to maximize system availability. Finally, in a rigorous manner, we comparatively analyze the behavior of redundant systems where replication and repair mechanisms are employed. We postulate that the proposed models can aid system designers, who can instantiate our models to assess and quantify the availability and reliability of systems of interest. Our study demonstrates that the configuration with most reliable and available systems depends on the parameter settings.

Subasi, Omer↗

The Evolution of the Pegasus Workflow Management Software

Since 2001 the Pegasus Workflow Management System has evolved into a robust and scalable system that automates the execution of a number of complex applications running on a variety of heterogeneous, distributed high-throughput, and high-performance computing environments. Pegasus was built on the principle of separation between the workflow description and workflow execution, providing the ability to port and adapt the workflow based on the target execution environment. Through its user-driven research and development it has adapted to the needs of a number of scientific communities, utilizing and developing novel algorithms and software engineering solutions. This paper describes the evolution of Pegasus over time and provides motivations behind the design decisions. The paper concludes with selected lessons learned.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Counter-Based Dynamic Load Balancing Schemes for Massive Contingency Analysis on Over 10,000 Cores

Contingency analysis studies are necessary to assess the impact of possible power system component failures. The results of the contingency analysis are used to ensure the grid reliability, and in power market operation for the feasibility test of market solutions. Currently, these studies are performed in real time based on the current operating conditions of the grid with a set of pre-selected contingency list, which might result in overlooking some critical contingencies caused by variable system status. To have a complete picture of a power grid, more contingencies need to be studied to improve grid reliability. High-performance computing techniques hold the promise of being able to perform the analysis for more contingency cases within a much shorter time frame. This paper evaluates the performance of counter-based dynamic load balancing schemes for a massive contingency analysis program on 10,000+ cores. One million N-2 contingency analysis cases with a Western Electricity Coordinating Council power grid model have been used to demonstrate the performance. The speedup of 3964 with 4096 cores and 7877 with 10240 cores are obtained. This paper reports the performance of the load balancing scheme with a single counter and two counters, describes disk I/O issues, and discusses other potential techniques for further improving the performance.

Balancing Schemes for Massive Contingency↗

A scalable framework for the global offline community land model ensemble simulation

Current earth system models have a large range of uncertainty, owing to differences in the simulation of feedbacks and insufficient information to constrain model parameters. Parameter disturbance experiment provides a straightforward method to quantify the variation (uncertainty) outputs caused by model inputs. Owing to the software complexity and computational intensity of earth system models, a large-scale simulation framework is needed to support ensemble simulation required by parameter disturbance experiment. This paper presents a parallel framework for the community land model ensemble simulation. After a software structure review of the community land model simulation, a single factor parameter disturbance experiment of a reference computational experiment design is used to demonstrate the software design principles, computational characteristics of individual application, parallel ensemble simulation implementation, as well as the weak scalability of this simulation framework on a high-end computer. Lastly, the paper discusses some preliminary diagnostic analysis results of the single factor parameter disturbance experiments. The framework design considerations and implementation details described in this paper can be beneficial to many other research programmes involving large scale, legacy modelling system.

58 GEOSCIENCES↗

ERAS: Enabling the Integration of Real-World Intellectual Properties (IPs) in Architectural Simulators

Sandia National Laboratories is investigating scalable architectural simulation capabilities with a focus on simulating and evaluating highly scalable supercomputers for high performance computing applications. There is a growing demand for RTL model integration to provide the capability to simulate customized node architectures and heterogeneous systems. This report describes the first steps integrating the ESSENTial Signal Simulation Enabled by Netlist Transforms (ESSENT) tool with the Structural Simulation Toolkit (SST). ESSENT can emit C++ models from models written in FIRRTL to automatically generate components. The integration workflow will automatically generate the SST component and necessary interfaces to ’plug’ the ESSENT model into the SST framework.

97 MATHEMATICS AND COMPUTING↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centralityof massive small-world networks. With minor changes to the data structures, ouralgorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the Threadstorm processor, and a single-socket Sun multicore server with the UltraSPARC T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

97 MATHEMATICS AND COMPUTING↗

Structured hints : extracting and abstracting domain expertise.

We propose a new framework for providing information to help optimize domain-specific application codes. Its design addresses problems that derive from the widening gap between the domain problem statement by domain experts and the architectural details of new and future high-end computing systems. The design is particularly well suited to program execution models that incorporate dynamic adaptive methodologies for live tuning of program performance and resource utilization. This new framework, which we call 'structured hints', couples a vocabulary of annotations to a suite of performance metrics. The immediate target is development of a process by which a domain expert describes characteristics of objects and methods in the application code that would not be readily apparent to the compiler; the domain expert provides further information about what quantities might provide the best indications of desirable effect; and the interactive preprocessor identifies potential opportunities for the domain expert to evaluate. Our development of these ideas is progressing in stages from case study, through manual implementation, to automatic or semi-automatic implementation. In this paper we discuss results from our case study, an examination of a large simulation of a neural network modeled after the neocortex.

97 MATHEMATICS AND COMPUTING↗

Scalable foundation models for numerical simulations on HPC platforms

In recent years, foundation models (FMs) have begun to reshape numerical simulations on high-performance computing (HPC) platforms. These large, pre-trained AI models enable rapid predictions across a broad range of physical domains, including Earth system modeling, fluid dynamics, materials science, as well as complex multi-modal simulations in aerospace engineering and fusion research. By training on diverse datasets, FMs learn intricate relationships and underlying physical behavior while also enabling the quantification of uncertainty in their predictions. This capability allows simulations that once required days of numerical calculation to be completed in minutes (FM inference), supporting real-time design optimization, uncertainty-aware decision making, and more comprehensive exploration of complex scenarios.

AI↗

Phase Field Simulations of Microstructure Evolution in IN718 using a Surrogate Ni–Fe–Nb Alloy during Laser Powder Bed Fusion

The solidification microstructure in IN718 during additive manufacturing was modeled using phase field simulations. The novelty of the research includes the use of a surrogate Ni–Fe–Nb alloy that has the same equilibrium solidification range as IN718 as the model system for phase field simulations, the integration of the model alloy thermodynamics with the phase field simulations, and the use of high-performance computing tools to perform the simulations with a high enough spatial resolution for realistically capturing the dendrite morphology and the level of microsegregation seen under additive manufacturing conditions. Heat transfer and fluid flow models were used to compute the steady state temperature gradient and an average value of the solid-liquid (s-l) interface velocity that were used as input for the phase field simulations. The simulations show that the solidification morphology is sensitive to the spacing between the columnar structures. Spacing narrower than a critical value results in continued growth of a columnar microstructure, while above a critical value the columnar structure evolves into a columnar dendritic structure through the formation of secondary arms. These results are discussed in terms of the existing columnar to dendritic transition (CDT) theories. The measured interdendritic Nb concentration, the primary and secondary arm spacing is in reasonable agreement with experimental measurements performed on the nickel-base superalloy IN718.

36 MATERIALS SCIENCE↗

A one-dimensional transient model of a single-stage, downward-firing entrained-flow gasifier

The integrated gasification combined cycle (IGCC) technology has emerged as an attractive alternative to conventional coal-fired power plant technology due to its higher efficiency and cleaner environmental performance especially with the option of CO{sub 2} capture and sequestration. The core unit of this technology is the gasifier whose optimal performance must be understood for efficient operation of IGCC power plants. This need has led a number of researchers to develop gasifier models of varying complexities. Whereas high-fidelity CFD models can accurately predict most key aspects of gasifier performance, they are computationally expensive and typically take hours to days to execute on high-performance computers. Therefore, faster one-dimensional (1D) partial differential equation (PDE)-based models are required for use in dynamic simulation studies, control system analysis, and training applications. A number of 1D gasifier models can be found in the literature, but most are steady-state and have limited application in the practical operation of the gasifier. As a result, 1D PDE-based dynamic models are needed to further study and predict gasifier performance under a wide variety of process conditions and disturbances. In the present study, a 1D transient model of a single-stage downward flow GE/Texaco-type gasifier has been developed. The model comprises mass, momentum and energy balances for the gas and solid phases. The model considers the initial gasification processes of water evaporation and coal devolatilization. In addition, the key heterogeneous and homogeneous chemical reactions have been modeled. The resulting time-dependent PDE model is solved using the well-known method of lines approach in Aspen Custom Modeler®, whereby the PDEs are discretized in the spatial domain and the resulting differential algebraic equations (DAEs) are then solved to obtain the transient response. The transient response of various gasifier performance parameters to certain disturbances commonly encountered in the real world operation of commercial IGCC plants will be presented. These disturbances include ramp and step changes in input variables such as coal flow rate, oxygen-to-coal ratio and water-to-coal ratio, among others. Comparison of gasifier model predictions to available dynamic data will also be discussed.

97 MATHEMATICS AND COMPUTING↗

Computational Math Problems for a Clean Energy Future

Cutting edge computational mathematics are ubiquitous in renewable energy research. Problems in resilient and reliable electric grid operations, infrastructure planning, wind farm yaw control, and more demand sophisticated and scalable computational tools that enable the transition of renewable energy technologies from proof of concept to deployment into our energy system. The mission of the Computational Science Center at NREL is to lead the lab's efforts to solve energy challenges using high-performance computing (HPC), computational science, applied mathematics, scientific data management, visualization, and informatics. In this poster, we provide a short overview of three areas of computational mathematics research at NREL: wind power scenario generation for stochastic grid operations and infrastructure planning, improved rational function approximations for electromagnetic transients codes, and wind farm yaw control using a combination of the Alternating Direction Method of Multipliers (ADMM) and reinforcement learning (RL). Increasing penetrations of renewable energy into power grids motivate the investigation of new approaches to characterizing uncertainty for five-minute economic dispatch problems. Similarly, as the penetration of distributed energy resources on power grids increases, it becomes important to revisit our methods of modelling transient phenomena, i.e. electromagnetic transients programs. Finally, the combination of ADMM and RL for wind farm yaw control presented here can potentially increase the efficiency of the deployed distributed controllers by orders of magnitude.

ADMM↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centrality of massive small-world networks. With minor changes to the data structures, our algorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in the HPCS SSCA#2 Graph Analysis benchmark, which has been extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the ThreadStorm processor, and a single-socket Sun multicore server with the UltraSparc T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

architecture comparison↗

Sensitivity analysis of generic deep geologic repository with focus on spatial heterogeneity induced by stochastic fracture network generation

Geologic Disposal Safety Assessment Framework is a state-of-the-art simulation software toolkit for probabilistic post-closure performance assessment of systems for deep geologic disposal of nuclear waste developed by the United States Department of Energy. This paper presents a generic reference case and shows how it is being used to develop and demonstrate performance assessment methods within the Geologic Disposal Safety Assessment Framework that mitigate some of the challenges posed by high uncertainty and limited computational resources. Variance-based global sensitivity analysis is applied to assess the effects of spatial heterogeneity using graph-based summary measures for scalar and time-varying quantities of interest. Behavior of the system with respect to spatial heterogeneity is further investigated using ratios of water fluxes. This analysis shows that spatial heterogeneity is a dominant uncertainty in predictions of repository performance which can be identified in global sensitivity analysis using proxy variables derived from graph descriptions of discrete fracture networks. New quantities of interest defined using water fluxes proved useful for better understanding overall system behavior.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

Xenon Recovery at Room Temperature using Metal-Organic Frameworks

Xenon is known to be a very efficient anesthetic gas but its cost prohibits the wider use in medical industry and other potential applications. It has been shown that Xe recovery and recycle from anesthetic gas mixture can significantly reduce its cost as anesthetic. The current technology uses series of adsorbent columns followed by low temperature distillation to recover Xe, which is expensive to use in medical facilities. Herein, we propose much efficient and simpler system to recover and recycle Xe from simulant exhale anesthetic gas mixture at room temperature using metal organic frameworks. Among the MOFs tested, PCN-12 exhibits unprecedented performance with high Xe capacity, Xe/N2 and Xe/O2 selectivity at room temperature. The in-situ synchrotron measurements suggest the Xe is occupied in the small pockets of PCN-12 compared to unsaturated metal centers (UMCs). Computational modeling of adsorption further supports our experimental observation of Xe binding sites in PCN-12.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Communication Requirements and Interconnect Optimization forHigh-End Scientific Applications

The path towards realizing peta-scale computing isincreasingly dependent on building supercomputers with unprecedentednumbers of processors. To prevent the interconnect from dominating theoverall cost of these ultra-scale systems, there is a critical need forhigh-performance network solutions whose costs scale linearly with systemsize. This work makes several unique contributions towards attaining thatgoal. First, we conduct one of the broadest studies to date of high-endapplication communication requirements, whose computational methodsinclude: finite-difference, lattice-bolzmann, particle in cell, sparselinear algebra, particle mesh ewald, and FFT-based solvers. Toefficiently collect this data, we use the IPM (Integrated PerformanceMonitoring) profiling layer to gather detailed messaging statistics withminimal impact to code performance. Using the derived communicationcharacterizations, we next present fit-trees interconnects, a novelapproach for designing network infrastructure at a fraction of thecomponent cost of traditional fat-tree solutions. Finally, we propose theHybrid Flexibly Assignable Switch Topology (HFAST) infrastructure, whichuses both passive (circuit) and active (packet) commodity switchcomponents to dynamically reconfigure interconnects to suit thetopological requirements of scientific applications. Overall ourexploration leads to a promising directions for practically addressingthe interconnect requirements of future peta-scale systems.

99 GENERAL AND MISCELLANEOUS↗