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 703 records · Page 39

The Transition from Thick to Thin Plate Wake Physics: Whither Vortex Shedding?

The near and very near wake of a flat plate with a circular trailing edge is investigated with data from direct numerical simulations. Computations were performed for six different combinations of the Reynolds numbers based on plate thickness (D) and boundary layer momentum thickness upstream of the trailing edge (theta). Unlike the case of the cylinder, these Reynolds numbers are independent parameters for the flat plate. The separating boundary layers are turbulent in all the cases investigated. One objective of the study is to understand the changes in the wake vortex shedding process as the plate thickness is reduced (increasing theta/D). The value of D varies by a factor of 16 and that of theta by approximately 5 in the computations. Vortex shedding is vigorous in the low theta/D cases with a substantial decrease in shedding intensity in the large theta/D cases. Other shedding characteristics are also significantly altered with increasing theta/D. A visualization of the shedding process in the different cases is provided and discussed. The basic shedding mechanism is explored in depth. The effect of changing theta/D on the time-averaged, near-wake velocity statistics is also discussed. A functional relationship between the shedding frequency and the Reynolds numbers mentioned above is obtained.

CFD↗

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

A theoretical analysis and computer program was developed for the prediction of unsteady lifting surface loadings caused by motions of leading edge and trailing edge control surfaces having sealed gaps. The final form of the downwash integral equation was formulated by isolating the singularities from the nonsingular terms and using 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 six control surfaces on each half span can be accommodated.

Rowe, W. S.↗

Understanding the dynamic evolution of atomically dispersed Cu catalyst for CO 2 electrochemical conversion using integrated XANES analysis and mechanistic studies

Direct electrochemical conversion of CO 2 to ethanol (CH 3 CH 2 OH) offers a promising strategy to lower CO 2 emission while storing energy from renewable electricity. Our recent study reported a carbon-supported atomically dispersed Cu catalyst that achieved the highest reported selectivity for CH 3 CH 2 OH formation (91%) at a relatively low potential (-0.6 V), however, the active site structure that is responsible for such high activity and selectivity has yet to be understood. Here, in this paper, we demonstrate a computational investigation combining X-ray absorption near edge structure (XANES) simulations and a mechanistic study via density functional theory (DFT) to understand the catalyst structures of this Cu catalyst during electrocatalysis and the corresponding reaction mechanisms of the key products. An integrated computational and experimental XANES analysis depicted the dynamic evolution of the catalytic site during electrocatalysis. The as-prepared, atomically dispersed Cu catalyst aggregates and forms metallic clusters/nanoparticles under electrochemical condition, which then break down to smaller oxidized clusters after electrocatalysis. The formed Cu clusters/nanoparticles showed distinct catalytic activity and selectivity as a function of particle size based on the mechanistic investigation using DFT, which is consistent with experimental observations for catalyst samples with different Cu loadings. This comprehensive study which combines experimental and computational XANES investigation, mechanistic study via DFT calculations, and experimental performance of the catalysts, provides unprecedented dynamic and mechanistic insights into the supported atomically dispersed metal catalysts for CO 2 reduction. Such strategy and details gained can further guide discovery of novel catalyst materials for CO 2 electrochemical reduction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enabling Graph Appliance for Genome Assembly

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

Big data↗

Elucidating the Discharge Behavior of Aqueous Zinc Sulfur Batteries in the Presence of Molybdenum(IV) Chalcogenide Catalyst: The Criticality of Interfacial Electrochemistry

The aqueous zinc-sulfur battery holds promise for significant capacity and energy density with low cost and safe operation based on environmentally benign materials. However, it suffers from the sluggish kinetics of the conversion reaction. Here, we highlight the efficacy of molybdenum(IV) sulfide (MoS 2 ) to reduce the overpotential of S-ZnS conversion in aqueous electrolytes and study the discharge products formed at the solid-solid and solid-liquid interfaces using experimental and theoretical approaches. Specifically, the MoS 2 -catalyzed electrochemical conversion reaction is characterized via ex situ X-ray diffraction (XRD), transmission electron microscopy (TEM) with energy dispersive spectroscopy (EDS), Raman spectroscopy, synchrotron-based Mo K-edge X-ray absorption spectroscopy (XAS), and in situ synchrotron-based X-ray computed tomography (XCT). Additionally, operando synchrotron-based S K-edge XAS and X-ray fluorescence (XRF) maps are collected to determine the spatial evolution of sulfur-based species at the electrode-electrolyte interface. Further, coupling the operando S K-edge XAS data with the simulated spectra and fitting the data suggested a possible ZnS 2 intermediate phase.

25 ENERGY STORAGE↗

A distributed program composition system

A graphical technique for creating distributed computer programs is investigated and a prototype implementation is described which serves as a testbed for the concepts. The type of programs under examination is restricted to those comprising relatively heavyweight parts that intercommunicate by passing messages of typed objects. Such programs are often presented visually as a directed graph with computer program parts as the nodes and communication channels as the edges. This class of programs, called parts-based programs, is not well supported by existing computer systems; much manual work is required to describe the program to the system, establish the communication paths, accommodate the heterogeneity of data types, and to locate the parts of the program on the various systems involved. The work described solves most of these problems by providing an interface for describing parts-based programs in this class in a way that closely models the way programmers think about them: using sketches of diagraphs. Program parts, the computational modes of the larger program system are categorized in libraries and are accessed with browsers. The process of programming has the programmer draw the program graph interactively. Heterogeneity is automatically accommodated by the insertion of type translators where necessary between the parts. Many decisions are necessary in the creation of a comprehensive tool for interactive creation of programs in this class. Possibilities are explored and the issues behind such decisions are presented. An approach to program composition is described, not a carefully implemented programming environment. However, a prototype implementation is described that can demonstrate the ideas presented.

Brown, Robert L.↗

Calculations of separated vortex flows at low speed for low-aspect-ratio wings

An implicit finite-difference scheme has been developed for solving three-dimensional incompressible Navier-Stokes equations. Computations for complicated vortical flows past several sharp- and round-edged delta and double-delta wings at high angles of attack and sideslip are discussed. Computed results demonstrate the effectiveness of the present method and show good agreement with experimental data.

Liu, C. H.↗

Effects of Coupled Rolling and Pitching Oscillations on Transonic Shock-Induced Vortex-Breakdown Flow of a Delta Wing

Unsteady, transonic vortex-breakdown flow over a 65 deg. sharp edged, cropped-delta wing of zero thickness undergoing forced coupled pitching and rolling oscillations is investigated computationally. The initial condition of the flow is characterized by a transverse terminating shock which induces of the leading edge vortex cores to breakdown. The computational investigation uses the time-accurate solution of the laminar, unsteady, compressible, full Navier-Stokes equations with the implicit, upwind, Roe flux-difference splitting, finite-volume scheme. The main focus is to analyze the effects of coupled motion on the wing response and vortex-breakdown flow by varying oscillation frequency and phase angle while keeping the maximum pitch and roll amplitude equal.

Kandil, Osama A.↗

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗

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↗

TU-FG-201-04: Computer Vision in Autonomous Quality Assurance of Linear Accelerators

Purpose: Routine quality assurance (QA) of linear accelerators represents a critical and costly element of a radiation oncology center. Recently, a system was developed to autonomously perform routine quality assurance on linear accelerators. The purpose of this work is to extend this system and contribute computer vision techniques for obtaining quantitative measurements for a monthly multi-leaf collimator (MLC) QA test specified by TG-142, namely leaf position accuracy, and demonstrate extensibility for additional routines. Methods: Grayscale images of a picket fence delivery on a radioluminescent phosphor coated phantom are captured using a CMOS camera. Collected images are processed to correct for camera distortions, rotation and alignment, reduce noise, and enhance contrast. The location of each MLC leaf is determined through logistic fitting and a priori modeling based on knowledge of the delivered beams. Using the data collected and the criteria from TG-142, a decision is made on whether or not the leaf position accuracy of the MLC passes or fails. Results: The locations of all MLC leaf edges are found for three different picket fence images in a picket fence routine to 0.1mm/1pixel precision. The program to correct for image alignment and determination of leaf positions requires a runtime of 21– 25 seconds for a single picket, and 44 – 46 seconds for a group of three pickets on a standard workstation CPU, 2.2 GHz Intel Core i7. Conclusion: MLC leaf edges were successfully found using techniques in computer vision. With the addition of computer vision techniques to the previously described autonomous QA system, the system is able to quickly perform complete QA routines with minimal human contribution.

60 APPLIED LIFE SCIENCES↗

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↗