Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “GCN”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

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.↗
DOE OSTI2020

AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

The recent development of deep learning has been mostly focusing on Euclidean data, such as images, videos, audios, etc. However, most real-world information and relation are often expressed as graphs. To efficiently learn from graph data, graph convolutional networks (GCNs) emerge as a promising approach, showing advantages in several practical applications such as social network analysis, knowledge discovery, 3D modeling, motion capturing, etc. Real-world graphs are usually extremely large and imbalanced, posting significant performance demand and design challenges on the hardware dedicated for GCN inference. In this paper, we propose an architecture design called UW-GCN to accelerate graph convolutional network inference. To tackle the major performance bottleneck from workload imbalance, we propose dynamic neighborhood stealing and remote chunk shuffling techniques, relying on hardware flexibility to achieve hardware auto-tuning under negligible area or delay overhead. Specifically, UW-GCN is able to smartly profile the sparse graph pattern while continuously adjusting the workload distribution via routing reconfiguration among parallel processing elements (PEs). The ideal configuration is then reused in the remaining iterations. To the best of our knowledge, this is the first accelerator design particularly for GCN and the first work relying on hardware auto-tuning, which is normally based on software, to achieve near-optimal workload balance in processing sparse structures.

Geng, Tong↗
DOE OSTI2022

Direct and Sensitive Electrochemical Evaluation of Pramipexole Using Graphitic Carbon Nitride (gCN) Sensor

Pramipexole (PMXL) belongs to the benzothiazole class of aromatic compounds and is used in treating Parkinson’s disease; however, overdosage leads to some abnormal effects that could trigger severe side effects. Therefore, it demands a sensitive analytical tool for trace level detection. In this work, we successfully developed an electrochemical sensor for the trace level detection of PMXL, using the voltammetric method. For the analysis, graphitic carbon nitride (gCN) was opted and synthesized by using a high-temperature thermal condensation method. The synthesized nanoparticles were employed for surface characterization, using transmission electron microscopy (TEM), X-ray diffraction (XRD), and atomic force microscopy (AFM) techniques. The electrochemical characterization of the material was evaluated by using the electrochemical impedance spectroscopy (EIS) technique to evaluate the solution–electrode interface property. The cyclic voltammetry (CV) behavior of PMXL displayed an anodic peak in the forward scan, indicating that PMXL underwent electrooxidation, and an enhanced detection peak with lower detection potential was achieved for gCN-modified carbon paste electrode (gCN·CPE). The influence of different parameters on the electrochemical behavior was analyzed, revealing the diffusion governing the electrode process with an equal number of hydronium ions and electron involvement. For the fabricated gCN·CPE, good linearity range was noticed from 0.05 to 500 µM, and a lower detection limit (L D ) of 0.012 µM was achieved for the selected concentration range (0.5 to 30 µM). Selectivity of the electrode in PMXL detection was investigated by conducting an interference study, while the tablet sample analysis demonstrates the sensitive and real-time application of the electrode. The good recovery values for the analysis illustrate the efficiency of the electrode for PMXL analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2022

H-GCN: A Graph Convolutional Network Accelerator on Versal ACAP Architecture

Recently Graph Neural Networks (GNNs) have drawn tremendous attentions due to their unique capability to extend the Machine Learning (ML) approaches to broadly defined applications with unstructured data, especially graphs. Comparing with other ML modalities, the acceleration of GNNs is as critical but even more challenging due to the irregularity and heterogeneity from graph typologies that together limit the performance. Existing efforts mainly focus on handling graphs’ irregularity, however, have not studied the heterogeneity. To this end, in this work, we propose H-GCN, a PL-AIE-based hybrid accelerator that leverages the emerging heterogeneity of Xilinx Versal ACAPs to achieve high-performance GNN inference. In particular, H-GCN partitions each graph into three subgraphs based on its inherent heterogeneity and processes them using PL and the newly emerged AIE respectively. To further improve the performance, we explore the sparsity support of AIE and develop an efficient density-aware method to map tiles of SpMM onto the systolic tensor array automatically. Compared with the current state-of-the-art GCN accelerator, HGCN achieves on average 1.5× speedups.

Zhang, Chengming↗
DOE OSTI2021

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗
DOE OSTI2025

Self-Supervised T-GCN for Detection of Disturbance and Propagation in Power Grid

Urban power systems increasingly rely on dense sensing to monitor grid reliability, yet disturbance labels are scarce and events are rare. We present a self-supervised spatio-temporal method that detects, localizes, and characterizes grid frequency disturbances across urban areas using only unlabeled data. Our approach trains a tiny Temporal Graph Convolutional Network (T-GCN) to forecast per-site frequency residuals (deviation from 60 Hz). The sensor graph is constructed directly from signals using pre-event Pearson correlation with a cross-correlation lag penalty without geocoding. At inference, node-level anomalies are the model's forecast errors; region-level alarms arise from connected components of high-score nodes. We estimate disturbance propagation by computing per-node arrival times (first persistent exceedance), then fit a planar or time-of-arrival model to obtain direction, speed, and an epicenter proxy. With only three real events collected at decisecond resolution across U.S. cities, we evaluate the T-GCN and report time-to-detect, footprint size, and propagation consistency. We further show that short-window embeddings from the T-GCN's hidden states enable few-shot event-vs-background recognition via a simple prototypical classifier. Despite minimal data and no labels, our system yields fast, spatially coherent detection and interpretable propagation maps, offering a practical, lightweight pathway to city-scale grid resilience analytics.

Niu, Haoran [ORNL] (ORCID:0000000155228297)↗
NASA NTRS2006

GCN and VOEvent - A Status Report

The GRB Coordinates Network (GCN) has filled an important niche in the conduct and progress of research on GRB for more than 14 years. The methods used to collect and distribute the positions, lightcurves, spectra, and images on GRB is real time (a few seconds) will be reviewed. For the research on GRBs to continue to move forward and for other fields of transient astronomy to move forward, enhancements are needed to the GCN. VOEvents is one of those changes, and that addition will be described here. The enhanced system will be called VO-GCN.

Barthelmy, Scott↗
NASA NTRS2011

GCN and AMON

"I will given an overview of the GCN system functions, capabilities, current & future notice types). Then a description of how GCN can interact with AMON; provide correlative trigger information to be used with the IceCube Neutrino detector (and others), and how GCN can distribute any detections made there from."

Barthelmy, Scott↗
NASA NTRS2011

GCN and SONG and Interactions with Other Instruments

I will give a brief description of Gamma-ray burst Coordinates Network (GCN) (distribution methods, filtering criteria, etc) plus the types of notices currently being distributed (GRBs, transients, & monitoring). Then cover how Stellar Observations Network Group (SONG) telescopes could make use of these notice types to fill in some of their observing time. I will then make a pitch to get SONG telescopes to contribute those data products that are consistant with the real-time transient aspects of GCN.

Barthelmy, Scott↗
NASA NTRS2016

Validation of AIRS V6 Surface Temperature over Greenland with GCN and NOAA Stations

This work compares the temporal and spatial characteristics of the AIRSAMSU (Atmospheric Infrared Sounder Advanced Microwave Sounding Unit A) Version 6 and MODIS (Moderate resolution Imaging Spectroradiometer) Collection 5 derived surface temperatures over Greenland. To estimate uncertainties in space-based surface temperature measurements, we re-projected the MODIS Ice Surface Temperature (IST) to 0.5 by 0.5 degree spatial resolution. We also re-gridded AIRS Skin Temperature (Ts) into the same grid but classified with different cloud conditions and surface types. These co-located data sets make intercomparison between the two instruments relatively straightforward. Using this approach, the spatial comparison between the monthly mean AIRS Ts and MODIS IST is in good agreement with RMS 2K for May 2012. This approach also allows the detection of any long-term calibration drift and the careful examination of calibration consistency in the MODIS and AIRS temperature data record. The temporal correlations between temperature data are also compared with those from in-situ measurements from GC-Net (GCN) and NOAA stations. The coherent time series of surface temperature evident in the correlation between AIRS Ts and GCN temperatures suggest that at monthly time scales both observations capture the same climate signal over Greenland. It is also suggested that AIRS surface air temperature (Ta) can be used to estimate the boundary layer inversion.

AIRS↗
DOE OSTI2023

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗
DOE OSTI2024

Impedance-Aware Graph Convolutional Networks for Voltage Estimation in Active Distribution Networks

Voltage estimation plays a key role in ensuring the effective control and reliability of distribution networks. However, traditional machine learning methods often fail to capture the details of the distribution network’s topology. To overcome this challenge, graph convolutional networks (GCN) have emerged as an alternative. Graph convolutional networks inherently capture the topology of the grid, utilizing correlations to achieve precise voltage estimation. Other machine learning models and conventional GCNs fail to account for the distribution line characteristics found in the real world, limiting their effectiveness. This paper proposes an advanced variant of GCN called the Impedance-Aware Graph Convolutional Network (IA-GCN). The IA-GCN layer incorporates the magnitude of the impedance into the graph convolution mechanism, allowing it to capture topological nuances and provide valuable insights into node interrelationships by considering impedance as an intrinsic dimension. The performance of the IA-GCN layer is then compared with that of GCN and GraphSAGE layers through a surrogate model for voltage estimation. The performance analysis demonstrates that IA-GCN outperforms GCN by reducing the MAE by 87.55% and improving the R-squared value by 98%.

Ravi, Abhijith↗
DOE OSTI2022

Charge carrier nonadiabatic dynamics in non-metal doped graphitic carbon nitride

Graphitic carbon nitride (GCN) has attracted significant attention due to its excellent performance in photocatalytic applications. Non-metal doping of GCN has been widely used to improve the efficiency of the material as a photocatalyst. Using a combination of time-domain density functional theory with nonadiabatic molecular dynamics, we study the charge carrier dynamics in oxygen and boron doped GCN systems. The reported simulations provide a detailed time-domain mechanistic description of the charge separation and recombination processes that are of fundamental importance while evaluating the photovoltaic and photocatalytic performance of the material. The appearance of smaller energy gaps due to the presence of dopant states improves the visible light absorption range of the doped systems. At the same time, the nonradiative lifetimes are shortened in the doped systems as compared to the pristine GCN. In the case of boron doped at a carbon (B–C–GCN), the charge recombination time is very long as compared to the other two doped systems owing to the smaller electron–phonon coupling strength between the valence band maximum and the trap state. The results suggest B–C–GCN as the most suitable candidate among three doped systems studied in this work for applications in photocatalysis. Finally, this work sheds light into the influence of dopants on quantum dynamics processes that govern GCN performance and, thus, guides toward building high-performance devices in photocatalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design

Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art graph learning model. However, it remains notoriously challenging to inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because real-world graphs can be extremely large and sparse. Furthermore, the node degree of GCNs tends to follow the power-law distribution and therefore have highly irregular adjacency matrices, resulting in prohibitive inefficiencies in both data processing and movement and thus substantially limiting the achievable GCN acceleration efficiency. To this end, this paper proposes the first GCN algorithm and accelerator Co-Design framework dubbed GCoD which can largely alleviate the aforementioned GCN irregularity and boost GCNs' inference efficiency. Specifically, on the algorithm level, GCoD integrates a divide and conquer GCN training strategy that polarizes the graphs to be either denser or sparser in local neighborhoods without compromising the model accuracy, resulting in graph adjacency matrices that (mostly) have merely two levels of workload and enjoys largely enhanced regularity and thus ease of acceleration. On the hardware level, we further develop a dedicated two-pronged accelerator with a separated engine to process each of the aforementioned workloads, further boosting the overall utilization and acceleration efficiency. Extensive experiments and ablation studies validate that our GCoD consistently outperforms state-of-the-art designs in terms of accelerator efficiency while maintaining or even improving the task accuracy. Additionally, we visualize GCoD trained graph adjacency matrices to better understand its advantages. All codes and pre-trained models will be released upon acceptance.

You, Haoran↗
DOE OSTI2025

Interrelationships among methods of estimating microbial biomass across multiple soil orders and biomes

Understanding the role of soil microbes is critical to ecosystem processes, and more thorough comparisons of measurement proxies for soil microbial biomass could broaden the inclusion of explicit microbial parameterization in soil carbon cycling and earth system models. We measured physical, chemical, and biological data from eight soil orders representing 11 major biomes and four climate regions. Four prominent methods to measure microbial abundance—chloroform fumigation extraction (CFE), total DNA yield, gene copy number by quantitative polymerase chain reaction (GCN), and phospholipid fatty acids (PLFA)—were compared to assess their relationships with each other and with soil characteristics. Correlations were observed when comparing methods, with CFE correlating strongly with total DNA yield, GCN, and PLFA; CFE with bacterial GCN and bacterial PLFA; and to a lesser extent, total PLFA and total DNA yield. Correlations improved with the removal of organic soils (Histosols, Gelisols). Comparisons involving extracted DNA were improved by correcting for clay content, due to DNA extraction inefficiencies in clay-rich soils. Correlations involving fungi (PLFA or GCN) were always less significant. These methods could serve as reliable, inter-relatable proxies for the estimation of total soil microbial biomass while recognizing that the proxies are less effective at parsing differences between bacteria and fungi. Here, we provide specific equations to relate measures of soil microbial biomass by these four different methods to enable microbial models to utilize a greater diversity of observed data sources in parameterizations and simulations. Caveats for the equations and their values are also discussed.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Prediction of vacancy defect diffusion paths in high entropy alloys via machine learning on molecular dynamics data

Identifying the diffusion path of point defects is a critical step in understanding their evolution and the mechanisms of related phenomena. Defect diffusion occurs at small length and time scales, with impacts on material properties that may continue to evolve over ns to μs, ms, and the continuum scale (s, min, etc., and cm, m, etc.). The time scale accessible to molecular dynamics (MD) simulations is limited by small step sizes, typically in the fs range. Thus, surrogate models of MD simulations through machine learning (ML)-based algorithms are of great interest, especially for complex systems such as high entropy alloys (HEAs). In this work, dynamics governing vacancy migration in HEA were approximated with graph convolutional network (GCN) models as ansatzes for kinetic Monte Carlo (KMC) rate catalogs. Network design considered that diffusion in crystalline solids generally depends on interactions between defects and their immediate neighbor atoms. Graphs represented the vacancy surroundings, MD-generated trajectories provided training and comparison datasets, and unsupervised GCN models approximated interatomic dynamics governing vacancy migration in HEAs as ansatzes for KMC. A proof-of-concept model trained on MD data for the Fe, Ni, Cr, Co, and Cu HEA environment was used with two different neighbor interactions to assess the feasibility of training a GCN to predict vacancy defect transition rates in the HEA environment. The resulting setup rapidly generated MD-formatted synthetic trajectories based on dynamics learned from the MD training set, with a time acceleration of roughly two orders of magnitude and a similar diffusion coefficient to MD observations. Additionally, Nudged Elastic Band (NEB) calculations were performed on randomly generated FeNiCrCoCu HEA structures to determine vacancy migration barriers across nearest-neighbor sites. Transition probabilities for each jump, categorized by atomic type, were extracted from these calculations. NEB-based and GCN-based approaches led to similar outcomes.

Reimer, C↗
DOE OSTI2023

Three approaches for the classification of protoneutron star oscillation modes

ABSTRACT The future detection of gravitational waves (GWs) from a Galactic core-collapse supernova will provide information on the physics inside protoneutron stars (PNS). In this work, we apply three different classification methods for the PNS non-radial oscillation modes: Cowling classification, Generalized Cowling Nomenclature (GCN), and a classification based on modal properties (CBMP). Using PNS models from 3D simulations of core-collapse supernovae, we find that in the early stages of the PNS evolution, typically 0.4 s after the bounce, the Cowling classification is inconsistent, but the GCN and the CBMP provide complementary information that helps to understand the evolution of the modes. In the GCN, we note several avoided crossings as the mode frequencies evolve at early times, while the CBMP tracks the modes across the avoided crossings. We verify that the strongest emission of GWs by the PNS corresponds to the f mode in the GCN, indicating that the mode trapping region alternates between the core and the envelope at each avoided crossing. At later times, approximately 0.4 s after the bounce, the three classification methods present a similar description of the mode spectrum. We use our results to test universal relations for the PNS modes according to their classification and find that the behaviour of the universal relations for f and p modes is remarkably simple in the CBMP.

Astronomy & Astrophysics↗
DOE OSTI2025

Topology-Aware Reinforcement Learning for Voltage Control: Centralized and Decentralized Strategies

Volt-VAR control (VVC) methods based on deep reinforcement learning (DRL) can effectively control distribution grid voltage and minimize power loss by implementing corrective and preventive control measures on the reactive power output of inverter-based distributed energy resources (DERs). However, model-free DRL-based VVC approaches usually cannot capture the important topological feature of the power system since they use a fully-connected network (FCN) to deliver the action. Therefore, this paper proposes a graph convolutional network (GCN)-based DRL approach that can employ the topological information of the network to take better control action for regulating the voltage. Our implementation allows for both centralized and decentralized configurations, utilizing a single agent and multiple agents respectively. Although the centralized GCN-based DRL approach has its advantages of minimizing voltage fluctuation and power loss, it is not suitable for large scale power systems due to its challenges in terms of scalability, computation speed and potential single points of failure. Therefore, these problems can be resolved using the decentralized GCN-based DRL approach. Moreover, to ensure the safe operation of the model, our proposed approach incorporates an exponential barrier function while formulating the reward function for each agent. To validate performance of the proposed approaches, the proposed model is tested on modified IEEE test systems and the performances are measured in terms on voltage fluctuation reduction, minimization of power loss and computational speed. Finally, the results show that the proposed topology-aware approach outperforms the FCN-based DRL approach in terms of reducing voltage fluctuation and minimizing power loss of the network. Moreover, it is shown that the decentralized GCN-based DRL has faster computational speed than other approaches.

42 ENGINEERING↗