Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Scalable computation”

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,549 records · Page 86
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Joint Chance Constraints in AC Optimal Power Flow: Improving Bounds through Learning

This paper considers distribution systems with a high penetration of distributed, renewable generation and addresses the problem of incorporating the associated uncertainty into the optimal operation of these networks. Joint chance constraints, which satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints, leading to a chance-constrained optimal power flow problem. Departing from the computationally-heavy scenario-based approaches or approximations that transform the joint constraint into conservative deterministic constraints, this paper develops a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and accurately and efficiently approximates bounds on the joint chance constraint iteratively. In particular, the proposed framework improves upon the classic methods based on the union bound (or Boole's inequality) by generating a much less conservative set of single chance constraints that also guarantees the satisfaction of the original joint constraint. The proposed framework is evaluated numerically using the IEEE 37-node test feeder, focusing on the problem of voltage regulation in distribution grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗
DOE OSTI2021

Interactive Web Application for Traffic Simulation Data Management and Visualization

As traffic simulation software becomes more effective for realistically simulating and analyzing traffic dynamics and vehicle interactions on the mesoscopic and microscopic level, the management, dissemination, and collaborative visualization of traffic simulation results produced by individual transportation planners presents a significant challenge. Existing online content management systems have a very limited capability in allowing users to query specific traffic simulation scenarios and geospatially visualize simulation results through shareable and interactive web interfaces. This paper presents a web-based application for promoting the archiving, sharing, and visualization of large-scale traffic simulation outputs. The application is developed to enhance cyber-physical controls, communications, and public education for collaborative transportation planning. Unique features of the web application include: (a) allowing users to upload their new traffic simulation scenarios (parameters and outputs), as well as search existing scenarios using easily accessible interfaces; (b) optimizing simulation output files with heterogeneous data formats and projected coordinate systems for web-based storage and management using a scalable and searchable data/metadata standard; (c) standardizing user-uploaded simulation outputs using web interfaces and data processing libraries with parallel computing capacity; and (d) providing shareable web visual interfaces for visualizing the traffic flow and signal information stored in simulation outputs (e.g., regional traffic patterns and individual vehicle interactions) and visually comparing multiple simulation outputs both spatially and temporally. Furthermore, the paper presents the conceptual design and implementation of this application, and demonstrates the application’s performance for sharing, comparing, and visualizing simulation outputs from VISSIM and SUMO, two commonly used traffic simulation software programs.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2022

Improved Axisymmetric and High Temperature Material Structural Modeling in MOOSE and NEML

This report describes improvements made to the solid mechanics formulation in the MOOSE open source finite element simulation environment and the open source Nuclear Engineering Material model Library (NEML) for mechanical constitutive models. The focus of these improvements is to improve the usability and performance of simulations involving one or both pieces of software. Specifically, this work completes a new system for solid mechanics simulations in the MOOSE ecosystem providing exact linearizations and optimal (quadratic) convergence, for a variety of coordinate systems and material types, including large deformation simulations. This work then provides users a framework to build highly efficient mechanical simulations of structures or materials or to couple in additional MOOSE physics modules to build complex, scalable multiphysics simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Ion Traps and Packaging for Heterogenous Integration - Chimera

Microfabricated surface ion traps and silicon-based photonics are critical technologies for scaling quantum systems. Current ion trap architectures face scalability and integration challenges due to limitations in optical access, fabrication techniques, and material compatibility. State-of-the-art quantum computers and atomic clocks are investigating monolithic integration, which necessitates custom traps for each ion species and has not overcome the integration hurdles presented by merging these technologies. The Chimera (Ion Traps and Packaging for Heterogeneous Integration) project proposes a novel approach utilizing heterogeneous integration (HI) of ion traps and photonic circuits. This separation of components allows for flexibility in ion trap design and reduces fabrication compromises. The Chimera project specifically designed an ion trap to interface vertically with a separately fabricated waveguide chip and demonstrates the first steps to integrating them at the packaging level. The ion trap features a large area of removed silicon, allowing the photonics chip outputs closer to the ion trap, improving alignment and packaging processes. The alignment must be accurate to < 1 µm to ensure that the light from the waveguide can overlap with the trapping region. This fine alignment must also be maintained through an ultra-high vacuum bake, a critical step in preparing an ion trap experiment. By combining separate chips, we demonstrate a new path for scaling trapped ion technology that is less reliant on monolithic integration. We successfully fabricated a trap with a large area of oxide removed, resulting in a region thinned to about 40 µm, a key milestone toward successful integration.

42 ENGINEERING↗
DOE OSTI2022

Dayflow: CONUS Daily Streamflow Reanalysis, Version 1 (V1)

Dayflow V1 is a historical streamflow reanalysis dataset reconstructed for a 36-year period (1980-2015). The dataset provides both daily and monthly scale streamflow information at about 2.7 million NHDPlusV2 stream reaches in the conterminous US (CONUS). Dayflow is the result of a nationally scalable modeling framework that integrates the simulated runoff from the Variable Infiltration Capacity (VIC) model with the Routing Application for Parallel computatIon of Discharge (RAPID) routing model. Two types of streamflow products, simulated streamflow with or without assimilation of historic US Geological Survey (USGS) streamflow observations, are provided in Dayflow V1. A comprehensive evaluation at 7,526 USGS National Water Information System (NWIS) gauges is performed for both types of streamflow products. The resulting key evaluation metrics are also included in the Dayflow V1 Dataset.

13 HYDRO ENERGY↗
NASA NTRS1984

Airborne simulation of a satellite based Doppler lidar

Results of a study assessing the feasibility of a satellite-based Doppler lidar for global wind measurements are reported. In particular, attention is given to the feasibility of simulating such measurements from an airborne platform. A brief discussion of the proposed Doppler lidar system is presented along with a description of the computer simulation and airborne measurements. The measurements will be performed using a pulsed CO2 Doppler lidar in a scan configuration similar to that expected for the satellite system. Computer simulations will be used in addition to measurements to assess the accuracy of the scan technique and to determine the scalability of the measurements.

Bilbro, J. W.↗
NASA NTRS1991

High-performance multiprocessor architecture for a 3-D lattice gas model

The lattice gas method has recently emerged as a promising discrete particle simulation method in areas such as fluid dynamics. We present a very high-performance scalable multiprocessor architecture, called ALGE, proposed for the simulation of a realistic 3-D lattice gas model, Henon's 24-bit FCHC isometric model. Each of these VLSI processors is as powerful as a CRAY-2 for this application. ALGE is scalable in the sense that it achieves linear speedup for both fixed and increasing problem sizes with more processors. The core computation of a lattice gas model consists of many repetitions of two alternating phases: particle collision and propagation. Functional decomposition by symmetry group and virtual move are the respective keys to efficient implementation of collision and propagation.

Lee, F.↗
NASA NTRS1994

The architecture of the High Performance Storage System (HPSS)

The rapid growth in the size of datasets has caused a serious imbalance in I/O and storage system performance and functionality relative to application requirements and the capabilities of other system components. The High Performance Storage System (HPSS) is a scalable, next-generation storage system that will meet the functionality and performance requirements or large-scale scientific and commercial computing environments. Our goal is to improve the performance and capacity of storage by two orders of magnitude or more over what is available in the general or mass marketplace today. We are also providing corresponding improvements in architecture and functionality. This paper describes the architecture and functionality of HPSS.

Teaff, Danny↗
NASA NTRS1998

Implementation of a Parallel Kalman Filter for Stratospheric Chemical Tracer Assimilation

A Kalman filter for the assimilation of long-lived atmospheric chemical constituents has been developed for two-dimensional transport models on isentropic surfaces over the globe. An important attribute of the Kalman filter is that it calculates error covariances of the constituent fields using the tracer dynamics. Consequently, the current Kalman-filter assimilation is a five-dimensional problem (coordinates of two points and time), and it can only be handled on computers with large memory and high floating point speed. In this paper, an implementation of the Kalman filter for distributed-memory, message-passing parallel computers is discussed. Two approaches were studied: an operator decomposition and a covariance decomposition. The latter was found to be more scalable than the former, and it possesses the property that the dynamical model does not need to be parallelized, which is of considerable practical advantage. This code is currently used to assimilate constituent data retrieved by limb sounders on the Upper Atmosphere Research Satellite. Tests of the code examined the variance transport and observability properties. Aspects of the parallel implementation, some timing results, and a brief discussion of the physical results will be presented.

Chang, Lang-Ping↗
NASA NTRS2005

Testing the Archivas Cluster (Arc) for Ozone Monitoring Instrument (OMI) Scientific Data Storage

The Ozone Monitoring Instrument (OMI) launched on NASA's Aura Spacecraft, the third of the major platforms of the EOS program on July 15,2004. In addition to the long term archive and distribution of the data from OM1 through the Goddard Earth Science Distributed Active Archive Center (GESDAAC), we are evaluating other archive mechanisms that can archive the data in a more immediately available method where it can be used for futher data production and analysis. In 2004, Archivas, Inc. was selected by NASA s Small Business Innovative Research (SBIR) program for the development of their Archivas Cluster (ArC) product. Arc is an online disk based system utilizing self-management and automation on a Linux cluster. Its goal is to produce a low cost solution coupled with the ease of management. The OM1 project is an application partner of the SBIR program, and has deployed a small cluster (5TB) based on the beta Archwas software. We performed extensive testing of the unit using production OM1 data since launch. In 2005, Archivas, Inc. was funded in SBIR Phase II for further development, which will include testing scalability with the deployment of a larger (35TB) cluster at Goddard. We plan to include Arc in the OM1 Team Leader Computing Facility (TLCF) hosting OM1 data for direct access and analysis by the OMI Science Team. This presentation will include a brief technical description of the Archivas Cluster, a summary of the SBIR Phase I beta testing results, and an overview of the OMI ground data processing architecture including its interaction with the Phase II Archivas Cluster and hosting of OMI data for the scientists.

Tilmes, Curt↗
NASA NTRSDate not supplied

Multigraph-based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing

Satellites are leaving the realms of niche use, extending our day-to-day networked infrastructure to space – thereby forcing a generalization of network architectures. The Delay Tolerant Networking (DTN) protocol is being developed to give rise to this new Solar System Internet. Predominantly, DTNs in space use globally-distributed contact tables to compute routes. In this paper, we propose and analyze a novel optimized approach for route computations that improves upon traditional approaches. As the general DTN will always include some scheduled links, our new algorithm enables greater scalability and practicality of DTN routing. These contact tables include windows when two nodes can communicate and were classically organized into a contact graph, where the vertices represent contact opportunities. Because the complexity of a contact graph grows with the number of contacts, pathfinding on it does not scale. A new structure using multigraphs with the same data is proposed. We show that a multigraph-based approach, which we call contact multigraph routing, exhibits performance superior to routing based on contact graphs, allowing greater scaling to schedule-based routing. In this paper, the multigraph-based algorithm is detailed and a proof is included showing it outperforms the previous algorithm given the same input. Pseudocode is included, as are simulation results. We conclude with suggested future work.

Delay Tolerant Networking↗
NASA NTRSDate not supplied

Towards Surrogate Modeling of Subgrid Turbulent Transport for 3D Radiative Hydrodynamic Simulations of the Quiet Sun

In this work, we investigate the use of deep learn-ing techniques as surrogate models, to enhance the estimationof effects of subgrid turbulent transport for 3D radiatuve hy-drodynamic simulations of the quiet Sun. We develop two dis-tinct 3D Convolutional Neural Networks (3DCNNs) to capturespatio-temporal dependencies in 3D velocity fields, leveragingdifferent activation functions and architectural designs. Thesemodels integrate both averaged velocity vector components andscalar features such as plasma density to enhance predictionaccuracy. Additionally, a Multilayer Perceptron (MLP) modelis employed to approximate complex nonlinear relationships,offering a comparison in performance between convolutionaland fully connected architectures. Logarithmic transformationis applied to the targets to handle heavily skewed data, im-proving model performance. All models are compared againsta physics-based Gradient Model. Results show that the 3DCNNmodels excel at approximating Reynolds stress tensors, makingthem a candidate for assisting in producing reduced resolutionsimulations, and thereby reducing computational overheadwhile maintaining higher accuracy than the baseline. Thesefindings demonstrate the potential of deep learning, particu-larly CNNs, to advance scalable and accurate simulations ofsolar dynamics, offering a promising alternative to traditionalturbulence models.

Heliophysics↗
DOE OSTI2014

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗
DOE OSTI2011

Hatrick: A System for Real-time Threat Detection in Cyber Physical Systems

Complexity of cyber attacks has grown rapidly over the last few decades. Novel advance techniques are needed in order to counter these attacks. Detecting some of these complex cyber attacks can be reduced to detecting patterns and dynamics in computer network traffic. These patterns can be molded as directed graphs based on their propagation through the cyber physical systems. This work in progress report presents an implemented system, Hatrick, which enable scalable, low latency dynamic graph analytics on clouds and commodity clusters. Hatrick will enable continuous monitoring of cyber physical systems to detect attack patterns in real-time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

ExaTN

A challenging scientific problem that will benefit from exascale computing is predictive simulation of two- and three-dimensional quantum many-body Hamiltonians in condensed matter physics, together with the related strong entanglement problems in quantum chemistry and quantum computing. Efficient numerical simulations will require new insights into wavefunction compression algorithms that scale on extremely heterogeneous HPC architectures. To address this need, we propose to develop a scalable math library of parallel multi-linear algebraic numerical primitives for hierarchical tensor compression. Our library will subsequently be used for building an efficient, performance-portable HPC framework for simulating strongly correlated quantum systems. In particular, our will will be the first to deliver a massively parallel implementation of the multiscale entanglement renormalization ansatz (MERA), a hierarchical tensor decomposition quantum scheme capable of expressing local expectation values of strongly entangled higher-dimensional quantum systems efficiently. To address the extreme complexity and high computational cost of such schemes, we will automate their parallel implementation by delivering an integrated software framework, ExaTN (Exascale Tensor Networks), that will process hierarchical tensor representations on exascale HPC systems via an asymchronous task-based programming model. As a specific application, our framework will provide scientists with a capability of simulating strongly entangled quantum systems, thus positioning ORNL as a strategic leader in modeling of strongly correlated materials.

McCaskey, AlexanderJ↗
DOE OSTI2022

MEUMAPPS (C++ Version)

Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.

DeWitt, Stephen [Oak Ridge National Lab. (ORNL), O↗