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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Computational wing design studies relating to natural laminar flow

Two research studies are described which directly relate to the application of natural laminar flow (NLF) technology to transonic transport-type wing planforms. Each involved using state-of-the-art computational methods to design three-dimensional wing contours which generate significant runs of favorable pressure gradients. The first study supported the Variable Sweep Transition Flight Experiment and involves design of a full-span glove which extends from the leading edge to the spoiler hinge line on the upper surface of an F-14 outer wing panel. A wing was designed computationally for a corporate transport aircraft in the second study. The resulting wing design generated favorable pressure gradients from the leading edge aft to the mid-chord on both upper and lower surfaces at the cruise design point. Detailed descriptions of the computational design approach are presented along with the various constraints imposed on each of the designs.

Waggoner, Edgar G.↗

NASA NTRS1975

Correlation of boundary layer quantities for hypersonic laminar flows with zero pressure gradient for several gases

The laminar boundary layer has been theoretically studied for six gases for flows over cold walls with zero pressure gradient at Mach numbers between 5.5 and 12.5 to correlate boundary layer quantities for the various gases. The flow conditions considered correspond to those that can be generated in test facilities such as the shock tunnel and the expansion tube. Computed results obtained using real gas properties indicate that the Eckert number based on edge conditions serves to correlate the results in terms of the wall shear stress and enthalpy gradient, the Stanton number, and the momentum thickness for the various gases within plus or minus 10 per cent for Te = Tw and Te approximately 3Tw. Computed Reynolds analogy factors exhibit very good agreement with those predicted by the Colburn analogy. Velocity and displacement thicknesses correlate well with Eckert number for Te = Tw, but fail to correlate for Te approximately 3Tw. Differences in results are traced to property variations. Results show that the Eckert number is a significant correlating variable for the flows considered.

Cook, W. J.↗

NASA NTRS1981

Development of an efficient procedure for calculating the aerodynamic effects of planform variation

Numerical procedures to compute gradients in aerodynamic loading due to planform shape changes using panel method codes were studied. Two procedures were investigated: one computed the aerodynamic perturbation directly; the other computed the aerodynamic loading on the perturbed planform and on the base planform and then differenced these values to obtain the perturbation in loading. It is indicated that computing the perturbed values directly can not be done satisfactorily without proper aerodynamic representation of the pressure singularity at the leading edge of a thin wing. For the alternative procedure, a technique was developed which saves most of the time-consuming computations from a panel method calculation for the base planform. Using this procedure the perturbed loading can be calculated in about one-tenth the time of that for the base solution.

Mercer, J. E.↗

NASA NTRS1992

Crystal ball gazing

Over the last seven years, the CPU on my desk has increased speed by two orders of magnitude, from around 1 MIP to more than 100 MIPS; more important is that it is about as fast as any uniprocessor of any type available for any price, for compute bound problems. Memory on the system is also about 100 times as big, while disk is only about 10 times as big. Local network and I/O performance have increased greatly, though not quite at the same rate as processor speed. More important, I will argue, is that the CPU's address space is 64 bits, rather than 32 bits, allowing us to rethink some time honored presumptions. The Internet has gone from a few hundred machines to a million, and now have grown to span the entire globe, and wide area networks have now becoming commercial services. 'PC's' are now real computers, bringing what was top of the line computing capability to the masses only a few years behind the leading edge. So even a year or two from now, we can anticipate commonplace desktop machines running at speeds hundreds of MIPS, with main memories in the hundreds of megabytes to a gigabyte, able to draw millions of vectors/second, and all capable of some reasonable 3D graphics. And only a few years later, this will be the $1500 PC. So the 1990's certainly brings: 64 bit processors becoming standard; BIP/BFLOP class uniprocessors; large scale multiprocessors for special purpose applications; I/O as the most significant computer engineering problem; Hierarchical data servers in everyday use; routine access to archived data around the world; and what else? What do systems such as those we will have this decade imply to those building data analysis systems today? Many of the presumptions of the 1970's and 1980's need to be reexamined in the light of 1990's technology.

Gettys, Jim↗

DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

NASA NTRS1991

Use of edge-based finite elements for solving three dimensional scattering problems

Edge based finite elements are free from drawbacks associated with node based vectorial finite elements and are, therefore, ideal for solving 3-D scattering problems. The finite element discretization using edge elements is checked by solving for the resonant frequencies of a closed inhomogeneously filled metallic cavity. Great improvements in accuracy are observed when compared to the classical node based approach with no penalty in terms of computational time and with the expected absence of spurious modes. A performance comparison between the edge based tetrahedra and rectangular brick elements is carried out and tetrahedral elements are found to be more accurate than rectangular bricks for a given storage intensity. A detailed formulation for the scattering problem with various approaches for terminating the finite element mesh is also presented.

Chatterjee, A.↗

DOE OSTI2026

Reflections on the Shifting Experiences of Scientific Infrastructure

Infrastructure of all types is fundamental to modern work and life. Computing for scientific work, especially, extends from distributed local research sites, often at the edges of other major systems, outward into globally connected high-performance facilities and infrastructures. This commentary reviews longstanding research on the social characteristics of infrastructure. We reflect on social concerns that affect the ongoing development, use, and maintenance of a wide range of scientific computing and data resources. Reflecting on the social nature of infrastructure is timely for Computing in Science & Engineering readers, given continued emphasis on developing even more expansive platforms for data and artificial intelligence work in science (e.g., the United States’ Genesis Mission). We assert that, regardless of technological advances, the complex nature of scientific research and data will require continued understanding of longstanding and nascent social practices across varied communities. This is fundamentally necessary to build and sustain usable infrastructure or platforms that can productively advance scientific research.

Paine, Drew [Lawrence Berkeley National Laboratory↗

NASA NTRS1996

Computation of Lifting Wing-Flap Configurations

Research has been carried out on the computation of lifting wing-flap configurations. The long term goal of the research is to develop improved computational tools for the analysis and design of high lift systems. Results show that state-of-the-art computational methods are sufficient to predict time-averaged lift and overall flow field characteristics on simple high-lift configurations. Recently there has been an increased interest in the problem of airframe generated noise and experiments carried out in the 7 x 10 wind tunnel at NASA Ames have identified the flap edge as an important source of noise. A follow-on set of experiments will be conducted toward the end of 1995. The computations being carried out under this project are coordinated with these experiments. In particular, the model geometry being used in the computations is the same as that in the experiments. The geometry consists of a NACA 63-215 Mod B airfoil section which spans the 7 x lO tunnel. The wing is unswept and has an aspect ratio of two. A 30% chord Fowler flap is deployed modifications of the flap edge geometry have been shown to be effective in reducing noise and the existing code is currently being used to compute the effect of a modified geometry on the edge flow.

Cantwell, Brian↗

NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

DOE OSTI2024

A synergistic experimental and theoretical study elucidating the electronic and thermal properties in spinel CuInSnS 4

Quaternary chalcogenides of different structure types continue to be of interest due to the novel physical properties they exhibit and for applications ranging from optoelectronics to energy-related technologies. Herein we report on the electronic and thermal properties of spinel CuInSnS 4 . UV–vis–NIR spectroscopy indicates strong absorption in the visible-light region with an indirect bandgap of 1.52 eV. First-principles computations corroborate our experimental data and reveal that the band-edge electronic properties are due to strong p – d ands – p hybridization and antibonding interactions. Analyses of temperature-dependent thermal properties together with first principles simulations reveal strong anharmonicity and low-lying optical branches that hybridize with the acoustic modes effectively suppressing thermal conductivity. This intrinsically very low thermal conductivity is much lower than that of related chalcogenides. Finally, our findings are discussed in the light of ongoing interest in quaternary metal chalcogenide materials and may aid in the development of this and similar chalcogenides for applications of interest.

36 MATERIALS SCIENCE↗

DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗

NASA NTRS1980

Satellite monitoring of vegetation and geology in semi-arid environments

The possibility of mapping various characteristics of the natural environment of Tanzania by various LANDSAT techniques was assessed. Interpretation and mapping were carried out using black and white as well as color infrared images on the scale of 1:250,000. The advantages of several computer techniques were also assessed, including contrast-stretched rationing, differential edge enhancement; supervised classification; multitemporal classification; and change detection. Results Show the most useful image for interpretation comes from band 5, with additional information being obtained from either band 6 or band 7. The advantages of using color infrared images for interpreting vegetation and geology are so great that black and white should be used only to supplement the colored images.

Kihlblom, U.↗

NASA NTRS1983

Airloads on bluff bodies, with application to the rotor-induced downloads on tilt-rotor aircraft

The aerodynamic characteristics of airfoils with several flap configurations were studied theoretically and experimentally in environments that simulate a wing immersed in the downwash of a hovering rotor. Special techniques were developed for correcting and validating the wind tunnel data for large blockage effects, and the test results were used to evaluate two modern blockage effects, and the test results were used to evaluate two modern computational aerodynamics codes. The combined computed and measured results show that improved flap and leading-edge configurations can be designed which will achieve large reductions in the downloads of tilt-rotor aircraft, and thereby improve their hover efficiency.

Mccroskey, W. J.↗

NASA NTRS1985

Airloads on bluff bodies, with application to the rotor-induced downloads on tilt-rotor aircraft

Mccroskey, W. J.↗

NASA NTRS1993

An instability associated with a magnetosphere-disk interaction

The evolution of a thin accretion disk surrounding a rapidly rotating magnetosphere is considered. By taking account of the variations of the magnetospheric boundary in response to the conditions at the inner edge of the disk, we find from linear analysis and numerical computation that the accretion disk can become unstable. Mass can be accreted by the central object in a cyclic fashion, with the cycle involving the storage and release of mass in the inner parts of the disk. The physical origin of the instability is associated with the variations of the magnetospheric boundary about corotation. The recurrence time scale of the cycle can vary by several orders of magnitude depending on the details of the conditions at the magnotosphere. The possible applicability of this instability process to the 'rapid burster' MXB 1730-335 is briefly discussed.

Spruit, H. C.↗

NASA NTRS1930

Analytical determination of the load on a trailing edge flap

This report presents a theoretical analysis of the lift on a trailing edge flap. An analytical expression has been derived which enables the computation of the flap load coefficient. The theoretical results seem to show a fair agreement with the meager experimental results which are available.

Pinkerton, Robert M↗

NASA NTRS1994

Numerical design of advanced multi-element airfoils

The current study extends the application of computational fluid dynamics to three-dimensional high-lift systems. Structured, overset grids are used in conjunction with an incompressible Navier-Stokes flow solver to investigate flow over a two-element high-lift configuration. The computations were run in a fully turbulent mode using the one-equation Baldwin-Barth turbulence model. The geometry consisted of an unswept wing which spanned a wind tunnel test section. Flows over full and half-span Fowler flap configurations were computed. Grid resolution issues were investigated in two dimensional studies of the flapped airfoil. Results of the full-span flap wing agreed well with experimental data and verified the method. Flow over the wing with the half-span was computed to investigate the details of the flow at the free edge of the flap. The results illustrated changes in flow streamlines, separation locations, and surface pressures due to the vortex shed from the flap edge.

Mathias, Donovan L.↗

NASA NTRS1994

On k-ary n-cubes: Theory and applications

Many parallel processing networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and toruses. In this paper, combinatorial properties of k-ary n-cubes are explored. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These theoretical results are then used to compute a lower bounding function in branch-and-bound partitioning algorithms and to establish the optimality of some irregular partitions.

Mao, Weizhen↗