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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
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)↗
DOE OSTI2018

Computing Resonant Inelastic X-Ray Scattering Spectra Using The Density Matrix Renormalization Group Method

We present a method for computing the resonant inelastic x-ray scattering (RIXS) spectra in one-dimensional systems using the density matrix renormalization group (DMRG) method. By using DMRG to address this problem, we shift the computational bottleneck from the memory requirements associated with exact diagonalization (ED) calculations to the computational time associated with the DMRG algorithm. This approach is then used to obtain RIXS spectra on cluster sizes well beyond state-of-the-art ED techniques. Using this new procedure, we compute the low-energy magnetic excitations observed in Cu L-edge RIXS for the challenging corner shared CuO4 chains, both for large multi-orbital clusters and downfolded t-J chains. We are able to directly compare results obtained from both models defined in clusters with identical momentum resolution. In the strong coupling limit, we find that the downfolded t-J model captures the main features of the magnetic excitations probed by RIXS only after a uniform scaling of the spectra is made.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Perfectly Matched Layers and Characteristic Boundaries in Lattice Boltzmann: Accuracy vs Cost

Artificial boundary conditions (BCs) play a ubiquitous role in numerical simulations of transport phenomena in several diverse fields, such as fluid dynamics, electromagnetism, acoustics, geophysics, and many more. They are essential for accurately capturing the behavior of physical systems whenever the simulation domain is truncated for computational efficiency purposes. Ideally, an artificial BC would allow relevant information to enter or leave the computational domain without introducing artifacts or unphysical effects. Boundary conditions designed to control spurious wave reflections are referred to as nonreflective boundary conditions (NRBCs). Another approach is given by the perfectly matched layers (PMLs), in which the computational domain is extended with multiple dampening layers, where outgoing waves are absorbed exponentially in time. Here, in this work, the definition of PML is revised in the context of the lattice Boltzmann method. The impact of adopting different types of BCs at the edge of the dampening zone is evaluated and compared, in terms of both accuracy and computational costs. It is shown that for sufficiently large buffer zones, PMLs allow stable and accurate simulations even when using a simple zeroth-order extrapolation BC. Moreover, employing PMLs in combination with NRBCs potentially offers significant gains in accuracy at a modest computational overhead, provided the parameters of the BC are properly tuned to match the properties of the underlying fluid flow.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multicode benchmark on simulated Ti K-edge x-ray absorption spectra of Ti-O compounds

X-ray absorption spectroscopy (XAS) is an element-specific materials characterization technique that is sensitive to structural and electronic properties. First-principles simulated XAS has been widely used as a powerful tool to interpret experimental spectra and draw physical insights. Recently, there has also been growing interest in building computational XAS databases to enable data analytics and machine learning applications. However, there are non-trivial differences among commonly used XAS simulation codes, both in underlying theoretical formalism and in technical implementation. Reliable and reproducible computational XAS databases require systematic benchmark studies. In this work, we benchmarked Ti K-edge XAS simulations of ten representative Ti-O binary compounds, which we refer to as the Ti-O-10 dataset, using three state-of-the-art codes: XSPECTRA, OCEAN and exciting. We systematically studied the convergence behavior with respect to the input parameters and developed a workflow to automate and standardize the calculations to ensure converged spectra. Our benchmark comparison considers a 35 eV spectral range starting from the K-edge onset, representative of widely used near-edge spectra. Quantitative comparison over this range is based on Spearman’s rank correlation score (r sp ). Our results show: (1) the two Bethe-Salpeter equation (BSE) codes (OCEAN and exciting) have excellent agreement with an average $r$ $sp$ of 0.998; (2) good agreement is obtained between the core-hole potential code (XSPECTRA) and BSE codes (OCEAN and exciting) with an average $r$ $sp$ of 0.990, and this smaller $r$ $sp$ reflects the noticeable differences in the main edge spectral shape that can be primarily attributed to the difference in the strength of the screened core-hole potential; (3) simulations from both methods overall reproduce well the main experimental spectral features of rutile and anatase, and the different treatments of the screened core-hole potential have visible impact on pre-edge intensities and the peak ratio of the main edge; (4) there exist moderate differences in the relative edge alignment of the three codes with a standard deviation of about 0.2 eV, which arise from multiple contributions including the frozen core approximation, final state effects, and different approximations used for the self-energy correction. In conclusion, our benchmark study provides important standards for first-principles XAS simulations with broad impact in data-driven XAS analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2020

An Edge-Cloud Integrated Solution for Buildings Demand Response Using Reinforcement Learning

Buildings, as major energy consumers, can provide great untapped demand response (DR) resources for grid services. However, their participation remains low in real-life. One major impediment for popularizing DR in buildings is the lack of cost-effective automation systems that can be widely adopted. Existing optimization-based smart building control algorithms suffer from high costs on both building-specific modeling and on-demand computing resources. To tackle these issues, this paper proposes a cost-effective edge-cloud integrated solution using reinforcement learning (RL). Beside RL’s ability to solve sequential optimal decision-making problems, its adaptability to easy-to-obtain building models and the off-line learning feature are likely to reduce the controller’s implementation cost. Using a surrogate building model learned automatically from building operation data, an RL agent learns an optimal control policy on cloud infrastructure, and the policy is then distributed to edge devices for execution. Simulation results demonstrate the control efficacy and the learning efficiency in buildings of different sizes. A preliminary cost analysis on a 4-zone commercial building shows the annual cost for optimal policy training is only 2.25% of the DR incentive received. Results of this study show a possible approach with higher return on investment for buildings to participate in DR programs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

High Performance Computing Facility Operational Assessment 2016 - Oak Ridge Leadership Computing Facility

Oak Ridge National Laboratory’s (ORNL’s) Leadership Computing Facility (OLCF) continues to surpass its operational target goals: supporting users; delivering fast, reliable systems; creating innovative solutions for high-performance computing (HPC) needs; and managing risks, safety, and security associated with operating one of the most powerful computers in the world. The results can be seen in the cutting-edge science delivered by users and the praise from the research community. Calendar year (CY) 2016 was filled with outstanding operational results and accomplishments: a very high rating from users on overall satisfaction for the third year in a row; the greatest number of core hours delivered to research projects; the largest number of research publications for the life of Titan; and success in delivering on the allocation of 60%, 30%, and 10% of core hours offered for the Innovative and Novel Computational Impact on Theory and Experiment (INCITE), Advanced Scientific Computing Research Leadership Computing Challenge (ALCC), and Director’s Discretionary (DD) programs, respectively. These accomplishments, coupled with the extremely high utilization rate, represent the fulfillment of the promise of Titan: maximum use by maximum-size simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scalable Graph Analytics and HPC Operational Enhancement: Parallel Computing and ML/DL Innovations

Parallel computing plays a pivotal role in the efficient processing of large-scale graphs. Complex network analysis stands as a capti- vating research frontier, holding promise across diverse scientific domains such as sociology, biology, online media, and recommenda- tion systems. In this era, Machine Learning (ML) and Deep Learning (DL) have emerged as indispensable tools, underpinning remarkable technological achievements. Within this dynamic landscape, my research revolves around advancing parallel algorithms tailored for large-scale graph operations. To achieve this, I harness the power of cutting-edge technologies including OpenMP, MPI, HIP, and CUDA, on the High-Performance Computing (HPC) platforms to unlock optimal performance. I also apply ML/DL techniques to HPC operational data, to streamline the monitoring and maintenance of supercomputers, alleviating the complexities associated with their upkeep and enhancing user support. My research echoes the syn- ergy between parallel computing, large-scale graph analysis, and ML/DL, improving computational efficiency and user experience.

Sattar, Naw Safrin↗
DOE OSTI2018

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times and memory demands. In this paper, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ~70 million nodes with ~68 billion edges in ~2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. Finally, HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Transferrin receptor targeting by de novo sheet extension

The de novo design of polar protein–protein interactions is challenging because of the thermodynamic cost of stripping water away from the polar groups. Here, we describe a general approach for designing proteins which complement exposed polar backbone groups at the edge of beta sheets with geometrically matched beta strands. We used this approach to computationally design small proteins that bind to an exposed beta sheet on the human transferrin receptor (hTfR), which shuttles interacting proteins across the blood–brain barrier (BBB), opening up avenues for drug delivery into the brain. We describe a design which binds hTfR with a 20 nM K d , is hyperstable, and crosses an in vitro microfluidic organ-on-a-chip model of the human BBB. Our design approach provides a general strategy for creating binders to protein targets with exposed surface beta edge strands.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

Quantized charge transport in chiral Majorana edge modes

Majorana fermions can be realized as quasiparticles in topological superconductors, with potential applications in topological quantum computing. Recently, lattices of magnetic adatoms deposited on the surface of 𝑠-wave superconductors—Shiba lattices—have been proposed as a new platform for topological superconductivity. Furthermore, these systems possess the great advantage that they are accessible via scanning-probe techniques and thus enable the local manipulation and detection of Majorana modes. Using a nonequilibrium Green's function technique we demonstrate that the topological Majorana edge modes of nanoscopic Shiba islands display universal electronic and transport properties. Most remarkably, these Majorana modes possess a quantized charge conductance that is proportional to the topological Chern number, 𝒞, and carry a supercurrent whose chirality reflects the sign of 𝒞. These results establish nanoscopic Shiba islands as promising components in future topology-based devices.

Edge states↗
DOE OSTI2018

High-order discretization of a gyrokinetic Vlasov model in edge plasma geometry

We describe a new spatial discretization of a continuum gyrokinetic Vlasov model in axisymmetric tokamak edge plasma geometries. The geometries are represented using a multiblock decomposition in which logically distinct blocks are smoothly mapped from rectangular computational domains and are aligned with magnetic flux surfaces to accommodate strong anisotropy induced by the magnetic field. We employ a fourth-order, finite-volume discretization in mapped coordinates to mitigate the computational expense associated with discretization on 4D phase space grids. Applied to a conservative formulation of the gyrokinetic system, a finite-volume approach expresses local conservation discretely in a natural manner involving the calculation of normal fluxes at cell faces. In the approach presented here, the normal fluxes are computed in terms of face-averaged velocity normals in such a way that (i) the divergence-free property of the gyrokinetic velocity is preserved discretely to machine precision, (ii) the configuration space normal velocities are independent of mapping metrics, and (iii) the configuration space normal velocities are computed from exact pointwise evaluation of magnetic field data except for one term. The algorithms described in this paper form the foundation of a continuum gyrokinetic edge code named COGENT, which is used here to perform a convergence study verifying the accuracy of the spatial discretization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

Extracting h-Backbone as a Core Structure in Weighted Networks

Determining the core structure of complex network systems allows us to simplify them. Using h -bridge and h -strength measurements in a weighted network, we extract the h -backbone core structure. We find that focusing on the h -backbone in a network allows greater simplification because it has fewer edges and thus fewer adjacent nodes. We examine three practical applications: the co-citation network in an information system, the open flight network in a social system, and coauthorship in network science publications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Edge states in the honeycomb reconstruction of two-dimensional silicon nanosheets

Electrons confined within a two-dimensional (2D) honeycomb potential can host localized electronic states at their edges. These edge states exhibit distinctive electronic properties relative to the bulk, and may result in spin polarization or topologically protected conduction. However, the synthesis and characterization of well-defined 2D structures which host such edge states remains challenging. Here, we confirm the presence of a two-dimensional electron gas (2DEG) and find evidence for unique edge states in the Ag-induced honeycomb surface reconstruction of silicon nanosheets (SiNS) grown on Ag(111). Atomic-scale scanning tunneling microscopy and computational modeling confirm that the electronic properties of the SiNS surface are determined by the honeycomb surface reconstruction. This surface presents ordered edge terminations with distinct spectroscopic signatures associated with the edge orientation, and calculations suggest that Rashba-type spin orbit coupling may result in spin-polarized conduction along certain edge orientations. Furthermore, this quantification of the electronic structure of edge states in SiNS 2DEGs will inform ongoing efforts to engineer quantum effects in silicon-based nanostructures.

36 MATERIALS SCIENCE↗
DOE OSTI2018

An evaluation of point-insertion sequences for incremental Delaunay tessellations

Currently, incremental algorithms may be seen as the lowest-cost computational methods to generate Delaunay tessellations in several point distributions. In this work, eight point-insertion sequences in incremental algorithms for generating Delaunay tessellations are evaluated. More specifically, four point-insertion sequences in incremental algorithms for generating Delaunay tessellations are proposed: with orders given by the red–black tree with in-order and level-order traversals, spiral ordering, and H-indexing. These four incremental algorithms with such sequences are compared with four incremental algorithms with point-insertion orders given by the following sequences: the Hilbert and Lebesgue curves, cut-longest-edge kd-tree, and random order. Six 2-D and seven 3-D point distributions are tested, with sets ranging from 25,000 to 8,000,000 points. The results of computational and storage costs of these eight algorithms are analyzed. It follows that the incremental algorithm with a point-insertion sequence in the order given by the cut-longest-edge kd-tree shows the lowest computational and storage costs of the sequences tested.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Neuromorphic Computing for Autonomous Racing

Neuromorphic computing has many opportunities in future autonomous systems, especially those that will operate at the edge. However, there are relatively few demonstrations of neuromorphic implementations on real-world applications, partly because of the lack of availability of neuromorphic hardware and software, but also because of the lack of availability of an accessible demonstration platform. In this work, we propose utilizing the F1Tenth platform as an evaluation task for neuromorphic computing. F1Tenth is a competition wherein one tenth scale cars compete in an autonomous racing task; there are significant open source resources in both software and hardware for realizing this task. We present a workflow with neuromorphic hardware, software, and training that can be used to develop a spiking neural network for neuromorphic hardware deployment to perform autonomous racing. We present initial results on utilizing this approach for this small-scale, real-world autonomous vehicle task.

Patton, Robert↗
DOE OSTI2025

Effect of convective transport in edge and scrape-off-layer plasmas of ADITYA-U tokamak

The 2-D edge plasma fluid transport code, UEDGE has been used to simulate the edge and scrape-off layer regions of circular limiter plasmas of ADITYA-U. The computational mesh defining the limiter geometry of ADITYA-U has been introduced in the UEDGE code through an in-house developed routine. It has successfully been integrated with the UEDGE code and the measured radial profile of electron density (n e ) in the edge region is modelled using the simulations. The plasma discharge for the present study has plasma current I P ~ 130 kA, duration ~ 150 ms, chord-averaged electron density ~ 1.3 x 10 19 m -3 , and central electron temperature ~ 270 eV has been observed. The maximum toroidal magnetic field is ~ 1.2 T. It has been found that an inward convective velocity, v conv ~ 1.5 m/s is required in addition to the constant perpendicular diffusion coefficient, D ⟂ ~ 0.2 m 2 /s to adequately match the measured n e profile in typical discharges of ADITYA-U. The value of D ⟂ ~ 0.2 m 2 /s is found to lie between the estimated neoclassical diffusivity and Bohm diffusivity.

Physics - Plasma physics↗