SearcharxivSearch

arXiv · 2603.20364

DGNNFlow: A Streaming Dataflow Architecture for Real-Time Edge-based Dynamic GNN Inference in HL-LHC Trigger Systems

Abstract

Dynamic GNN inference exhibits strong capability to model interactions over time, such as complex particle collision events in High Energy Physics (HEP) experiments at High Luminosity Large Hadron Collider (HL-LHC). With much larger scale of collision data captured in future HEP experiments to help unlocking physics discoveries and limitation in both offline compute capacity and storage, revamped trigger systems require FPGAs to run ultra-low-latency Machine Learning models with low power consumption for online filtering of useful events. Many state-of-the-art GNN accelerators relied on static graph structures, but this assumption breaks down in HL-LHC trigger systems and other edge-based dynamic GNN applications where edge embeddings can change in-place based on neighbor node embeddings during runtime. We propose DGNNFlow, a novel streaming dataflow architecture for real-time edge-based dynamic GNN inference applications (including but not limited to HL-LHC trigger systems) along with three key contributions. First, we introduce hardware enhancement for edge embedding dynamic computation. Second, we alleviate data dependencies in edge-based dynamic GNN dataflow with Node Embedding Broadcast. Third, we provide input dynamic graph construction for complete support of graphs without pre-defined edge embeddings. We deploy DGNNFlow using AMD Alveo U50 FPGA to evaluate performance at 200 MHz clock frequency. DGNNFlow achieved 2.59x-4.36x and 1.30x-2.14x speedup compared to NVIDIA RTX A6000 GPU (batch sizes 1 and 2) with 3.59x-3.70x less power consumption, achieved 2.29x-3.54x speedup with 1.93x-2.12x less power consumption compared to Intel Xeon Gold 6226R CPU. Our implementation is available on GitHub.

Explore related subjects

Keep this discovery

BibTeXRIS

Davendra Maharaj, Tu Pham, Peter Meiring, Kyungmin Park, Sena Durgut, Cong Hao, Matteo Cremonesi. 2026-03-20. DGNNFlow: A Streaming Dataflow Architecture for Real-Time Edge-based Dynamic GNN Inference in HL-LHC Trigger Systems. https://arxiv.org/abs/2603.20364

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC