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 1,045 records · Page 58

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗

Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On eigenvalues of a P T-symmetric operator in a thin layer

We consider an elliptic operator with variable coefficients in a thin three-dimensional layer with P T-symmetric boundary conditions. We study the effect of the appearance of isolated eigenvalues at the edges of the gaps in the essential spectrum. We obtain sufficient conditions that guarantee that such eigenvalues either exist or are absent near a given edge of a gap. In the case of existence, the first terms in the asymptotic expansion of these emerging eigenvalues are calculated. Bibliography: 34 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Machine Learning Based Software Package for Reproducible Data Analysis for Electron Microscopy

Advances in hardware and computation technologies are enabling large hyperspectral imaging during Electron Microscopy (EM), resulting in datasets being produced at rapidly increasing spatial and temporal resolutions. This presents exciting opportunities for microstructure analysis, but also poses great challenges in data analysis. Under this STTR program, QuesTek Innovations LLC, a leader in the field of integrated computational materials engineering (ICME), collaborated with Lawrence Livermore National Laboratory and Argonne National Laboratory. The team developed an open-source machine learning (ML) powered tool for EM data analysis of multiple systems and data types, and collected EM data for ML model development using the cutting-edge PicoProbe equipment at Argonne National Laboratory.

Lin, Yu↗

FPGA Acceleration of GCN in Light of the Symmetry of Graph Adjacency Matrix

Graph Convolutional Neural Networks (GCNs) are widely used to process large-scale graph data. Different from deep neural networks (DNNs), GCNs are sparse, irregular, and unstructured, posing unique challenges to hardware acceleration with regular processing elements (PEs). In particular, the adjacency matrix of a GCN is extremely sparse, leading to frequent but irregular memory access, low spatial/temporal data locality and poor data reuse. Furthermore, a realistic graph usually consists of unstructured data (e.g., unbalanced distributions), creating significantly different processing times and imbalanced workload for each node in GCN acceleration. To overcome these challenges, we propose an end-to-end hardware-software co-design to accelerate GCNs on resource-constrained FPGAs with the features including: (1) A custom dataflow that leverages symmetry along the diagonal of the adjacency matrix to accelerate feature aggregation for undirected graphs. We utilize either the upper or the lower triangular matrix of the adjacency matrix to perform aggregation in GCN to improve data reuse. (2) Unified compute cores for both aggregation and transform phases, with full support to the symmetry-based dataflow. These cores can be dynamically reconfigured to the systolic mode for transformation or as individual accumulators for aggregation in GCN processing. (3) Preprocessing of the graph in software to rearrange the edges and features to match the custom dataflow. This step improves the regularity in memory access and data reuse in the aggregation phase. Moreover, we quantize the GCN precision from FP32 to INT8 to reduce the memory footprint without losing the inference accuracy. We implement our accelerator design in Intel Stratix10 MX FPGA board with HBM2, and demonstrate 1.3x-110.5x improvement in end-to-end GCN latency as compared to the state-of the-art FPGA implementations, on the graph datasets of Cora, Pubmed, Citeseer and Reddit.

Nair, Gopikrishnan R.↗

Broadly Applicable Dose Model for Radiotherapy Beams from 6-25 MV

The goal of modern external beam radiotherapy is to deliver a highly targeted radiation dose to a specified treatment volume while sparing the healthy surrounding tissue as much as possible. However, some healthy tissue radiation exposure is unavoidable. Healthy tissue in the margin of the treatment field will receive absorbed doses on the order of the prescribed dose, and tissue far out of field will receive stray dose from scattered and leakage radiation. These doses can lead to late effects such as secondary cancers both near the treatment field and far out of field in tissues only receiving stray radiation dose. Many researchers have investigated algorithms to model absorbed dose from external beam photon radiation therapy; however, none of these works have fully addressed the stray dose far from the treatment field. The AAPM Task Group Report No. 36 described three main sources of stray radiation from external beam radiation therapy delivered with electron linear accelerators. Radiation scattered from the treatment head, known as head scatter, is primarily important within about 10 cm from the field edge. Patient scatter is an important source up to around 30 cm from the field edge. Finally, leakage radiation emanates from the treatment enclosure and predominates the stray radiation dose beyond about 30 cm. Monte Carlo simulations have been a useful research tool for modeling stray dose, but these methods have not found use in clinical settings due to their complexity and long computational times. The feasibility of analytical models to predict stray dose from radiation therapy has been supported by several works, but few attempts have been made at developing models accurate for both in-field and out-of-field doses. Jagetic and Newhauser reported on one such model that predicts absorbed dose from therapeutic, scatter, and leakage radiation with promising results. This model was validated at 6 MV for Conformal Radiation Therapy (CRT) beams from an Elekta linac. Intensity Modulated Radiation Therapy (IMRT) was not considered, and the model has not been tested at beam energies greater than 6 MV. Additionally, this model relies on proprietary, machine specific parameters, and so adapting the model for use on treatment units from other manufacturers is not straightforward. In this study we aim to test whether a physics-based analytical modeling approach is broadly applicable and if sufficient accuracy can be achieved without the need for proprietary, machine specific parameters. In order to accomplish this, a new analytical model was developed that does not rely on machine specific parameters, so that it can easily be trained on measurements from whatever treatment machine is available at a given clinic. This model was tested using measured data from a variety of treatment machines and techniques in the 6 MV to 25 MV energy interval. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Ligand Controls Excited Charge Carrier Dynamics in Metal-Rich CdSe Quantum Dots: Computational Insights

Small metal-rich semiconducting quantum dots (QDs) are promising for solid-state lighting and single-photon emission due to their highly tunable yet narrow emission line widths. Nonetheless, the anionic ligands commonly employed to passivate these QDs exert a substantial influence on the optoelectronic characteristics, primarily owing to strong electron–phonon interactions. In this work, we combine time-domain density functional theory and nonadiabatic molecular dynamics to investigate the excited charge carrier dynamics of Cd 28 Se 17 X 22 QDs (X = HCOO – , OH – , Cl – , and SH – ) at ambient conditions. These chemically distinct but regularly used molecular groups influence the dynamic surface-ligand interfacial interactions in Cd-rich QDs, drastically modifying their vibrational characteristics. The strong electron–phonon coupling leads to substantial transient variations at the band edge states. The strength of these interactions closely depends on the physicochemical characteristics of passivating ligands. Consequently, the ligands largely control the nonradiative recombination rates and emission characteristics in these QDs. Our simulations indicate that Cd 28 Se 17 (OH) 22 has the fastest nonradiative recombination rate due to the strongest electron–phonon interactions. Conversely, QDs passivated with thiolate or chloride exhibit considerably longer carrier lifetimes and suppressed nonradiative processes. The ligand-controlled electron–phonon interactions further give rise to the broadest and narrowest intrinsic optical line widths for OH and Cl-passivated single QDs, respectively. Finally, obtained computational insights lay the groundwork for designing appropriate passivating ligands on metal-rich QDs, making them suitable for a wide range of applications, from blue LEDs to quantum emitters.

36 MATERIALS SCIENCE↗

Dimeric [Mo 2 S 12 ] 2− Cluster: A Molecular Analogue of MoS 2 Edges for Superior Hydrogen‐Evolution Electrocatalysis

Abstract Proton reduction is one of the most fundamental and important reactions in nature. MoS 2 edges have been identified as the active sites for hydrogen evolution reaction (HER) electrocatalysis. Designing molecular mimics of MoS 2 edge sites is an attractive strategy to understand the underlying catalytic mechanism of different edge sites and improve their activities. Herein we report a dimeric molecular analogue [Mo 2 S 12 ] 2− , as the smallest unit possessing both the terminal and bridging disulfide ligands. Our electrochemical tests show that [Mo 2 S 12 ] 2− is a superior heterogeneous HER catalyst under acidic conditions. Computations suggest that the bridging disulfide ligand of [Mo 2 S 12 ] 2− exhibits a hydrogen adsorption free energy near zero (−0.05 eV). This work helps shed light on the rational design of HER catalysts and biomimetics of hydrogen‐evolving enzymes.

Huang, Zhongjie↗

Understanding and Leveraging the I/O Patterns of Emerging Machine Learning Analytics

The scientific community is currently experiencing unprecedented amounts of data generated by cutting-edge science facilities. Soon facilities will be producing up to 1 PB/s which will force scientist to use more autonomous techniques to learn from the data. The adoption of machine learning methods, like deep learning techniques, in large-scale workflows comes with a shift in the workflow’s computational and I/O patterns. These changes often include iterative processes and model architecture searches, in which datasets are analyzed multiple times in different formats with different model configurations in order to find accurate, reliable and efficient learning models. This shift in behavior brings changes in I/O patterns at the application level as well at the system level. These changes also bring new challenges for the HPC I/O teams, since these patterns contain more complex I/O workloads. In this paper we discuss the I/O patterns experienced by emerging analytical codes that rely on machine learning algorithms and highlight the challenges in designing efficient I/O transfers for such workflows. We comment on how to leverage the data access patterns in order to fetch in a more efficient way the required input data in the format and order given by the needs of the application and how to optimize the data path between collaborative processes. We will motivate our work and show performance gains with a study case of medical applications.

Gainaru, Ana↗

Switching speed limits in electrically driven VO 2 structural Mott–Peierls transition

Mott materials are archetypal quantum systems actively explored as next-generation electronic and photonic platforms, with potential applications spanning non-Von Neumann computing, robotics, energy storage, and microwave technologies. Among these, vanadium dioxide (VO 2 ) has emerged as one of the most intensively studied compounds, owing to its sharp, near-room-temperature insulator-to-metal phase transition. VO 2 also serves as a benchmark system for testing cutting-edge theories and experimental techniques. Here, we directly visualize the electrically driven transition dynamics in VO 2 using a microwave-driven, frequency-tunable pulsed transmission electron microscope that combines nanometer spatial and picosecond temporal resolution. Under high-frequency (MHz–GHz) excitation, we capture the ultrafast nucleation, propagation, and dissolution of metallic domains within an operating device over millions of reversible cycles. We observe the ultrafast formation of consistent metallic nuclei beneath the electrodes, followed by the propagation of a structural phase front at 4.54 nm/ns. Our experiments show that phonon-mediated structural recovery ultimately limits reversible switching of VO 2 at GHz frequencies, and that a tunable regime for reversible operation spans from kHz to GHz through device engineering. Beyond VO 2 , our approach provides a powerful framework for probing non-equilibrium structural transformations in correlated and functional materials under realistic electrical stimuli.

36 MATERIALS SCIENCE↗

Dislocation-Grain Boundary Interaction Dataset for FCC Cu

Interactions between dislocations and grain boundaries play a major role in controlling the strength and ductility of structural materials. Experimentally, assessing and probing geometric and stress-based criteria at the local level for dislocation transmission through grain boundaries remains challenging. Therefore, there have been many efforts to systematically generate datasets of dislocation-grain boundary interactions (DGI) via computational models such as molecular dynamics simulations. So far, most DGI datasets have focused only on the subset of nominal minimum-energy grain boundary structures, which limits their applicability, especially to materials processed far from equilibrium. We present a comprehensive database of dislocation-grain boundary interactions for edge, screw, and 60° mixed dislocation with 330 <110> and 257 <112> symmetric tilt grain boundaries (total of 587) in FCC Cu consisting of 73 minimum-energy grain boundary structures and 514 metastable structures. The dataset contains the outcomes for 5234 unique interactions for various dislocation types, grain boundary structures, and applied shear stresses.

36 MATERIALS SCIENCE↗

Neoclassical toroidal viscosity torque prediction via deep learning

GPECnet is a densely connected neural network that has been trained on GPEC data, to predict the plasma stability, neoclassical toroidal viscosity (NTV) torque, and optimized 3D coil current distributions for desired NTV torque profiles. Using NTV torque, driven by non-axisymmetric field perturbations in a tokamak, can be vital in optimizing pedestal performance by controlling the rotation profile in both the core, to ensure tearing stability, and the edge, to avoid edge localized modes (ELMs). The generalized perturbed equilibrium code (GPEC) software package can be used to calculate the plasma stability to 3D perturbations and the NTV torque profile generated by applied 3D magnetic fields. These calculations, however, involve complex integrations over space and energy distributions, which takes time to compute. Initially, GPECnet has been trained solely on data representative of the quiescent H-mode (QH) scenario, in which neutral beams are often balanced and toroidal rotation is low across the plasma profile. Lastly, this work provides the foundation for active control of the rotation shear using a combination of beams and 3D fields for robust and high performance QH mode operation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Higher Chern numbers in multilayer Lieb lattices ( N ≥ 2 ): Topological transitions and quadratic band crossing lines

In this work, we consider a hitherto unexplored setting of a stacked multilayer (N) Lieb lattice which undergoes an unusual topological transition in the presence of intralayer spin-orbit coupling (SOC). The specific stacking configuration induces an effective nonsymmorphic two-dimensional lattice structure, even though the constituent monolayer Lieb lattice is characterized by a symmorphic space group. This emergent nonsymmorphicity leads to multiple doubly degenerate bands extending over the edge of the Brillouin zone (i.e., quadratic band crossing lines). In the presence of intralayer SOC, these doubly degenerate bands typically form three N-band subspaces, mutually separated by two band gaps. We analyze the topological properties of these multiband subspaces, using specially devised Wilson loop operators to compute non-Abelian Berry phases in order to show that they carry a higher Chern number N.

36 MATERIALS SCIENCE↗

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.

54 ENVIRONMENTAL SCIENCES↗

Midgap state requirements for optically active quantum defects

Abstract Optically active quantum defects play an important role in quantum sensing, computing and communication. The electronic structure and the single-particle energy levels of these quantum defects in the semiconducting host have been used to understand their optoelectronic properties. Optical excitations that are central for their initialization and readout are linked to transitions between occupied and unoccupied single-particle states. It is commonly assumed that only quantum defects introducing levels well within the band gap and far from the band edges are of interest for quantum technologies as they mimic an isolated atom embedded in the host. In this perspective, we contradict this common assumption and show that optically active defects with energy levels close to the band edges can display similar properties. We highlight quantum defects that are excited through transitions to or from a band-like level (bound exciton) such as the T center and Se S i + in silicon. We also present how defects such as the silicon split-vacancy in diamond can involve transitions between localized levels that are above the conduction band or below the valence band. Loosening the commonly assumed requirement on the electronic structure of quantum defects offers opportunities in quantum defects design and discovery especially in smaller band gap hosts such as silicon. We discuss the challenges in terms of operating temperature for photoluminescence or radiative lifetime in this regime. We also highlight how these alternative type of defects bring their own needs in terms of theoretical developments and fundamental understanding. This perspective clarifies the electronic structure requirement for quantum defects and will facilitate the identification and design of new color centers for quantum applications especially driven by first principles computations.

Xiong, Yihuang (ORCID:0000000178096047)↗

Trust: Triangle Counting Reloaded on GPUs

Triangle counting is a building block for a wide range of graph applications. Here, traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle counting beats vertex-centric design, and iii) communication-free and workload balanced graph partitioning is a grand challenge for triangle counting. On the contrary, we advocate that i) hashing can help the key operations for scalable triangle counting on Graphics Processing Units (GPUs), i.e., list intersection and graph partitioning, ii) vertex-centric option reduces both hash table construction cost and memory consumption, which is limited on GPUs. In addition, iii) we exploit graph and workload collaborative, and hash-based 2D partitioning to scale vertex-centric triangle counting over 1,000 GPUs with sustained scalability. In this work, we present TRUST, which performs triangle counting with the hash operation and vertex-centric paradigm. To the best of our knowledge, TRUST is the first work that achieves over one trillion Traversed Edges Per Second (TEPS) rate for triangle counting.

97 MATHEMATICS AND COMPUTING↗

Building a Better Grid, in Partnership with the OMNETRIC Group and Siemens

In collaboration with Siemens and the National Renewable Energy Laboratory (NREL), OMNETRIC Group developed a distributed control hierarchy—based on an open field message bus (OpenFMB) framework—that allows control decisions to be made at the edge of the grid. The technology was validated and demonstrated at NREL’s Energy Systems Integration Facility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Switch-connected HyperX network

A network system includes a plurality of sub-network planes and global switches. The sub-network planes have a same network topology as each other. Each of the sub-network planes includes edge switches. Each of the edge switches has N ports. Each of the global switches is configured to connect a group of edge switches at a same location in the sub-network planes. In each of the sub-network planes, some of the N ports of each of the edge switches are connected to end nodes, and others of the N ports are connected to other edge switches in the same sub-network plane, other of the N ports are connected to at least one of the global switches.

42 ENGINEERING↗