Search NASA⌕ Search

SEARCH · Search NASA

Results for “edge computing”

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 595 records · Page 33

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU

This paper introduces Pandora, a parallel algorithm for computing dendrograms, the hierarchical cluster trees for single linkage clustering (SLC). Current parallel approaches construct dendrograms by partitioning a minimum spanning tree and removing edges. However, they struggle with skewed, hard-to-parallelize real-world dendrograms. Consequently, computing dendrograms is the sequential bottleneck in HDBSCAN*[21], a popular SLC variant. Pandora uses recursive tree contraction to address this limitation. Pandora contracts nodes to construct progressively smaller trees. It computes the smallest contracted dendrogram and expands it by inserting contracted edges. This recursive strategy is highly parallel, skew-independent, work-optimal, and well-suited for GPUs and multicores. We develop a performance portable implementation of Pandora in Kokkos[31] and evaluate its performance on multicore CPUs and multi-vendor GPUs (e.g., Nvidia, AMD) for dendrogram construction in HDBSCAN*. Multithreaded Pandora is 2.2x faster than the current best-multithreaded implementation. Our GPU version achieves 6-20x speedup on AMD GPUs and 10-37x on NVIDIA GPUs over multithreaded Pandora. Pandora removes HDBSCAN*’s sequential bottleneck, greatly boosting efficiency, particularly with GPUs.

Sao, Piyush↗

Distributed, Intelligent Edge-Sensing for a Smarter Grid

The electric grid is undergoing major transformations and developments resulting in unprecedented levels of volatility, uncertainty, and stress on grid infrastructure. Smart sensors and methods aiding in advanced visibility and situational awareness are key for tackling these issues. In this work, a decentralized architecture is proposed, where sensing, local computation and control capability are embedded in the edge devices, communicating with a set of trusted 'data mules' in a 'delay-tolerant' manner, while functioning autonomously. This system has been designed and implemented as an overall platform – called Global Asset Monitoring, Management and Analytics (GAMMA) Platform intended to provide the backbone for a global array of sensors and actuators. Further, as a building block for advanced current sensing solutions, a smart, low-cost ‘clip-on’ current sensor based on PCB-embedded Rogowski coil has been developed. The sensor hosts a novel signal conditioning stage allowing an 'auto-tuning' feature, resulting in a universal current sensor design for measuring a wide range of currents, including faults for smart grid applications. Finally, the research proposes a method to instrument and monitor key parameters for the most common electric utility asset – the pole-top distribution transformer. The work done in this research enables scalable, edge-intelligent sensing solutions for monitoring grid infrastructure, allowing utility operators to gain advanced visibility in an economical way.

Kulkarni, Shreyas Bhalchandra↗

Downstream Effects on Orbiter Leeside Flow Separation for Hypersonic Flows

Discrepancies between experiment and computation for shuttle leeside flow separation, which came to light in the Columbia accident investigation, are resolved. Tests were run in the Langley Research Center 20-Inch Hypersonic CF4 Tunnel with a baseline orbiter model and two extended trailing edge models. The extended trailing edges altered the wing leeside separation lines, moving the lines toward the fuselage, proving that wing trailing edge modeling does affect the orbiter leeside flow. Computations were then made with a wake grid. These calculations more closely matched baseline experiments. Thus, the present findings demonstrate that it is imperative to include the wake flow domain in CFD calculations in order to accurately predict leeside flow separation for hypersonic vehicles at high angles of attack.

Buck, Gregory M.↗

Effect of Dynamic Rolling Oscillations on Twin Tail Buffet Response

The effect of dynamic rolling oscillations of delta-wing/twin-tail configuration on twin-tail buffet response is investigated. The computational model consists of a sharp-edged delta wing of aspect ratio one and swept-back flexible twin tail with taper ratio of 0.23. The configuration model is statically pitched at 30 deg. angle of attack and then forced to oscillate in roll around the symmetry axis at a constant amplitude of 4 deg. and reduced frequency of pi and 2(pi). The freestream Mach number and Reynolds number are 0.3 and 1.25 million, respectively. This multidisciplinary problem is solved using three sets of equations on a dynamic multi-block grid structure. The first set is the unsteady, full Navier-Stokes equations, the second set is the aeroelastic equations for coupled bending and torsion vibrations of the tails, and the third set is the grid-displacement equations. The configuration is investigated for inboard position of the twin tails which corresponds to a separation distance between the twin tails of 33% wing span. The computed results are compared with the results of stationary configuration, which previously have been validated using experimental data. The results conclusively showed that the rolling oscillations of the configuration have led to higher loads, higher deflections, and higher excitation peaks than those of the stationary configuration. Moreover, increasing the reduced frequency has led to higher loads and excitation peaks and lower bending and torsion deflections and acceleration.

Sheta, Essam F.↗

Efficient, Predictive Tomography of Multi-Qubit Quantum Processors

After decades of R&D, quantum computers comprising more than 2 qubits are appearing. If this progress is to continue, the research community requires a capability for precise characterization (“tomography”) of these enlarged devices, which will enable benchmarking, improvement, and finally certification as mission-ready. As world leaders in characterization -- our gate set tomography (GST) method is the current state of the art – the project team is keenly aware that every existing protocol is either (1) catastrophically inefficient for more than 2 qubits, or (2) not rich enough to predict device behavior. GST scales poorly, while the popular randomized benchmarking technique only measures a single aggregated error probability. This project explored a new insight: that the combinatorial explosion plaguing standard GST could be avoided by using an ansatz of few-qubit interactions to build a complete, efficient model for multi-qubit errors. We developed this approach, prototyped it, and tested it on a cutting-edge quantum processor developed by Rigetti Quantum Computing (RQC), a US-based startup. We implemented our new models within Sandia’s PyGSTi open-source code, and tested them experimentally on the RQC device by probing crosstalk. We found two major results: first, our schema worked and is viable for further development; second, while the Rigetti device is indeed a “real” 8-qubit quantum processor, its behavior fluctuated significantly over time while we were experimenting with it and this drift made it difficult to fit our models of crosstalk to the data.

97 MATHEMATICS AND COMPUTING↗

Globus service enhancements for exascale applications and facilities

Many extreme-scale applications require the movement of large quantities of data to, from, and among leadership computing facilities, as well as other scientific facilities and the home institutions of facility users. These applications, particularly when leadership computing facilities are involved, can touch upon edge cases (e.g., terabyte files) that had not been a focus of previous Globus optimization work, which had emphasized rather the movement of many smaller (megabyte to gigabyte) files. We report here on how automated client-driven chunking can be used to accelerate both the movement of large files and the integrity checking operations that have proven to be essential for large data transfers. In conclusion, we present detailed performance studies that provide insights into the benefits of these modifications in a range of file transfer scenarios.

97 MATHEMATICS AND COMPUTING↗

Vortical Flow Prediction Using an Adaptive Unstructured Grid Method

A computational fluid dynamics (CFD) method has been employed to compute vortical flows around slender wing/body configurations. The emphasis of the paper is on the effectiveness of an adaptive grid procedure in "capturing" concentrated vortices generated at sharp edges or flow separation lines of lifting surfaces flying at high angles of attack. The method is based on a tetrahedral unstructured grid technology developed at the NASA Langley Research Center. Two steady-state, subsonic, inviscid and Navier-Stokes flow test cases are presented to demonstrate the applicability of the method for solving practical vortical flow problems. The first test case concerns vortex flow over a simple 65 delta wing with different values of leading-edge radius. Although the geometry is quite simple, it poses a challenging problem for computing vortices originating from blunt leading edges. The second case is that of a more complex fighter configuration. The superiority of the adapted solutions in capturing the vortex flow structure over the conventional unadapted results is demonstrated by comparisons with the wind-tunnel experimental data. The study shows that numerical prediction of vortical flows is highly sensitive to the local grid resolution and that the implementation of grid adaptation is essential when applying CFD methods to such complicated flow problems.

Pirzadeh, Shahyar Z.↗

Vortical Flow Prediction using an Adaptive Unstructured Grid Method

A computational fluid dynamics (CFD) method has been employed to compute vortical flows around slender wing/body configurations. The emphasis of the paper is on the effectiveness of an adaptive grid procedure in "capturing" concentrated vortices generated at sharp edges or flow separation lines of lifting surfaces flying at high angles of attack. The method is based on a tetrahedral unstructured grid technology developed at the NASA Langley Research Center. Two steady-state, subsonic, inviscid and Navier-Stokes flow test cases are presented to demonstrate the applicability of the method for solving vortical flow problems. The first test case concerns vortex flow over a simple 65 delta wing with different values of leading-edge radius. Although the geometry is quite simple, it poses a challenging problem for computing vortices originating from blunt leading edges. The second case is that of a more complex fighter configuration. The superiority of the adapted solutions in capturing the vortex flow structure over the conventional unadapted results is demonstrated by comparisons with the wind-tunnel experimental data. The study shows that numerical prediction of vortical flows is highly sensitive to the local grid resolution and that the implementation of grid adaptation is essential when applying CFD methods to such complicated flow problems.

Pirzadeh, Shahyar Z.↗

Stress Concentration Around an Open Circular Hole in a Plate Subjected to Bending Normal to the Plane of the Plate

An aluminum-alloy plate containing an open circular hole of diameter large compared with the thickness of the plate was subjected to bending forces normal to the plane of the plate. Deflection and strain measurements were taken for two different loads. Stress concentrations occurred at the edge of the hole and the maximum stresses were tangential to the hole at the ends of the transverse diameter. The maximum stress at the edge of the hole was 1.59 times the computed stress on the net section and 1.85 times the computed stress in a solid plate of the same dimensions subjected to the same bending forces. The maximum deflections were about 20 percent greater than the corresponding deflection for a solid plate of the same size subjected to the same bending forces. The smallest edge distance was equal to 2-1/2 times the diameter of the hole and the stress concentration on this side of the hole was the same as on the side where the edge distance was about 4-1/2 diameters. A theoretical analysis of the problem shows that, for an aluminum plate of infinite width, the stress concentration at the edge of the hole would be 1.87 times the stress in a solid plate, which is substantially the same relation obtained for the plate tested.

Dumont, C↗

HDBind: encoding of molecular structure with hyperdimensional binary representations

Traditional methods for identifying “hit” molecules from a large collection of potential drug-like candidates rely on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have a significant limitation in that they require exceptional computing capabilities for even relatively small collections of molecules. Increasingly large and complex state-of-the-art deep learning approaches have gained popularity with the promise to improve the productivity of drug design, notorious for its numerous failures. However, as deep learning models increase in their size and complexity, their acceleration at the hardware level becomes more challenging. Hyperdimensional Computing (HDC) has recently gained attention in the computer hardware community due to its algorithmic simplicity relative to deep learning approaches. The HDC learning paradigm, which represents data with high-dimension binary vectors, allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas (computer vision, bioinformatics, mass spectrometery, remote sensing, edge devices, etc.). To the best of our knowledge, our work is the first to consider HDC for the task of fast and efficient screening of modern drug-like compound libraries. We also propose the first HDC graph-based encoding methods for molecular data, demonstrating consistent and substantial improvement over previous work. We compare our approaches to alternative approaches on the well-studied MoleculeNet dataset and the recently proposed LIT-PCBA dataset derived from high quality PubChem assays. We demonstrate our methods on multiple target hardware platforms, including Graphics Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs), showing at least an order of magnitude improvement in energy efficiency versus even our smallest neural network baseline model with a single hidden layer. Our work thus motivates further investigation into molecular representation learning to develop ultra-efficient pre-screening tools. We make our code publicly available at https://github.com/LLNL/hdbind.

59 BASIC BIOLOGICAL SCIENCES↗

Climatic clustering and longitudinal analysis with impacts on food, bioenergy, and pandemics

Predicted growth in world population will put unparalleled stress on the need for sustainable energy and global food production, as well as increase the likelihood of future pandemics. In this work, we identify high-resolution environmental zones in the context of a changing climate and predict longitudinal processes relevant to these challenges. We do this using exhaustive vector comparison methods that measure the climatic similarity between all locations on earth at high geospatial resolution relative to global-scale analyses. The results are captured as networks, in which edges between geolocations are defined if their historical climate similarities exceed a threshold. We apply Markov clustering and our novel Correlation of Correlations method to the resulting climatic networks, which provides unprecedented agglomerative and longitudinal views of climatic relationships across the globe. The methods performed here resulted in the fastest (9.37x10 18 operations/sec) and one of the largest (168.7x10 21 operations) scientific computations ever performed, with more than 100 quadrillion edges considered for a single climatic network. Our climatic analysis reveals areas of the world experiencing rapid environmental changes, which can have important implications for global carbon fluxes and zoonotic spillover events. Correlation and network analyses of this kind are widely applicable across computational and predictive biology domains, including systems biology, ecology, carbon cycles, biogeochemistry, and zoonosis research.

59 BASIC BIOLOGICAL SCIENCES↗

A translational registration system for LANDSAT image segments

The use of satellite images obtained from various dates is essential for crop forecast systems. In order to make possible a multitemporal analysis, it is necessary that images belonging to each acquisition have pixel-wise correspondence. A system developed to obtain, register and record image segments from LANDSAT images in computer compatible tapes is described. The translational registration of the segments is performed by correlating image edges in different acquisitions. The system was constructed for the Burroughs B6800 computer in ALGOL language.

Parada, N. D. J.↗

Turbulence modeling for computational aerodynamics

The status of turbulence modeling for external aerodynamic flows is reviewed, and closure concepts for the compressible form of the Reynolds-averaged Navier-Stokes equations are briefly outlined to establish a framework for comparison. The importance of experimental requirements for developing and verifying turbulence models is emphasized. Attention is then given to three important flow categories: attached flows, separating and reattaching flows, and trailing-edge flows. Examples of comparisons between experiments and computations for twoand three-dimensional flows are presented to illustrate the status of modeling. It is shown that, for most two-dimensional attached flows, eddy viscosity concepts will probably be adequate. For attached three-dimensional flows, however, eddy-viscosity and Reynolds-stress models are both deficient, failing to predict the proper surface shear-stress in rapidly skewing boundary layers, regardless of whether they are pressure driven or strain driven.

Marvin, J. G.↗

Three-Dimensional Ignition and Flame Propagation Above Liquid Fuel Pools: Computational Analysis

A three-dimensional unsteady reactive Navier-Stokes code is developed to study the ignition and flame spread above liquid fuels initially below the flashpoint temperature. Opposed air flow to the flame spread due to forced and/or natural convection is considered. Pools of finite width and length are studied in air channels of prescribed height and width. Three-dimensional effects of the flame front near the edge of the pool are captured in the computation. The formation of a recirculation zone in the gas phase similar to that found in two-dimensional calculations is also present in the three-dimensional calculations. Both uniform spread and pulsating spread modes are found in the calculated results.

Cai, Jinsheng↗

Prediction of unsteady aerodynamic loadings caused by trailing edge control surface motions in subsonic compressible flow: Analysis and results

A theoretical analysis and a computer program have been developed for the prediction of unsteady lifting surface loadings caused by motions of trailing edge control surfaces having sealed gaps. The final form of the downwash integral equation has been formulated by isolating the singularities from the non-singular terms and establishing a preferred solution process to remove and evaluate the downwash discontinuities in a systematic manner. Comparisons of theoretical and experimental pressure data are made for several control surface configurations. The comparisons indicate that reasonably accurate theoretical pressure distributions and generalized forces may be obtained for a wide variety of control surface configurations. Spanwise symmetry or antisymmetry of motion, and up to four control surfaces on each half span can be accommodated.

Rowe, W. S.↗

Experimental Space Shuttle Orbiter Studies to Acquire Data for Code and Flight Heating Model Validation

In an experimental study to obtain detailed heating data over the Space Shuttle Orbiter, CUBRC has completed an extensive matrix of experiments using three distinct models and two unique hypervelocity wind tunnel facilities. This detailed data will be employed to assess heating augmentation due to boundary layer transition on the Orbiter wing leading edge and wind side acreage with comparisons to computational methods and flight data obtained during the Orbiter Entry Boundary Layer Flight Experiment and HYTHIRM during STS-119 reentry. These comparisons will facilitate critical updates to be made to the engineering tools employed to make assessments about natural and tripped boundary layer transition during Orbiter reentry. To achieve the goals of this study data was obtained over a range of Mach numbers from 10 to 18, with flight scaled Reynolds numbers and model attitudes representing key points on the Orbiter reentry trajectory. The first of these studies were performed as an integral part of Return to Flight activities following the accident that occurred during the reentry of the Space Shuttle Columbia (STS-107) in February of 2003. This accident was caused by debris, which originated from the foam covering the external tank bipod fitting ramps, striking and damaging critical wing leading edge heating tiles that reside in the Orbiter bow shock/wing interaction region. During investigation of the accident aeroheating team members discovered that only a limited amount of experimental wing leading edge data existed in this critical peak heating area and a need arose to acquire a detailed dataset of heating in this region. This new dataset was acquired in three phases consisting of a risk mitigation phase employing a 1.8% scale Orbiter model with special temperature sensitive paint covering the wing leading edge, a 0.9% scale Orbiter model with high resolution thin-film instrumentation in the span direction, and the primary 1.8% scale Orbiter model with detailed thin-film resolution in both the span and chord direction in the area of peak heating. Additional objectives of this first study included: obtaining natural or tripped turbulent wing leading edge heating levels, assessing the effectiveness of protuberances and cavities placed at specified locations on the orbiter over a range of Mach numbers and Reynolds numbers to evaluate and compare to existing engineering and computational tools, obtaining cavity floor heating to aid in the verification of cavity heating correlations, acquiring control surface deflection heating data on both the main body flap and elevons, and obtain high speed schlieren videos of the interaction of the orbiter nose bow shock with the wing leading edge. To support these objectives, the stainless steel 1.8% scale orbiter model in addition to the sensors on the wing leading edge was instrumented down the windward centerline, over the wing acreage on the port side, and painted with temperature sensitive paint on the starboard side wing acreage. In all, the stainless steel 1.8% scale Orbiter model was instrumented with over three-hundred highly sensitive thin-film heating sensors, two-hundred of which were located in the wing leading edge shock interaction region. Further experimental studies will also be performed following the successful acquisition of flight data during the Orbiter Entry Boundary Layer Flight Experiment and HYTHIRM on STS-119 at specific data points simulating flight conditions and geometries. Additional instrumentation and a protuberance matching the layout present during the STS-119 boundary layer transition flight experiment were added with testing performed at Mach number and Reynolds number conditions simulating conditions experienced in flight. In addition to the experimental studies, CUBRC also performed a large amount of CFD analysis to confirm and validate not only the tunnel freestream conditions, but also 3D flows over the orbiter acreage, wing leading edge, and controlurfaces to assess data quality, shock interaction locations, and control surface separation regions. This analysis is a standard part of any experimental program at CUBRC, and this information was of key importance for post-test data quality analysis and understanding particular phenomena seen in the data. All work during this effort was sponsored and paid for by the NASA Space Shuttle Program Office at the Johnson Space Center in Houston, Texas.

Wadhams, T. P.↗