A Dynamically Pipelined Dataflow Architecture for Graph Convolutions in Real-Time Event Interpretation

In high-performance data acquisition systems, realtime interpretation of captured signals is crucial due to limited offline storage and processing capabilities. Large scientific applications, such as particle detectors or massive radar testbeds, often capture inherently sparse data for which Point Cloud Networks (PCNs) have shown promising performance in online event processing tasks. In this work, we propose a novel approach for deploying point-based network layers on FPGAs in high-throughput, low-latency environments. We provide a programming model accompanied by an FPGA overlay which exploits a user-defined degree of spatial parallelism. By leveraging our dynamic dataflow architecture, we are able to guarantee time-variant real-time requirements for known point cloud sizes. In two case studies, we evaluate the inference latency of state-of-theart PCN layers. Based on the input point cloud size, our results demonstrate between 5.17x and 26.39x average latency improvements respectively, compared to our baseline implementations without spatial parallelism. Therefore, our proposed concept enables dynamic event interpretation for future scientific data acquisition systems.

Authors

Institutions

Publication Details

Published
2024-09-16
DOI
https://doi.org/10.1109/socc62300.2024.10737798
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Dynamically Pipelined Dataflow Architecture for Graph Convolutions in Real-Time Event Interpretation

M. Neu, Jürgen Becker, Christian Karle, Tanja Harbaum et al.
Graph Theory and Algorithms
article

A Dynamically Pipelined Dataflow Architecture for Graph Convolutions in Real-Time Event Interpretation

M. Neu, Jürgen Becker, Christian Karle, Tanja Harbaum, Patrick Schmidt, Julian Höfer
article en

Abstract

In high-performance data acquisition systems, realtime interpretation of captured signals is crucial due to limited offline storage and processing capabilities. Large scientific applications, such as particle detectors or massive radar testbeds, often capture inherently sparse data for which Point Cloud Networks (PCNs) have shown promising performance in online event processing tasks. In this work, we propose a novel approach for deploying point-based network layers on FPGAs in high-throughput, low-latency environments. We provide a programming model accompanied by an FPGA overlay which exploits a user-defined degree of spatial parallelism. By leveraging our dynamic dataflow architecture, we are able to guarantee time-variant real-time requirements for known point cloud sizes. In two case studies, we evaluate the inference latency of state-of-theart PCN layers. Based on the input point cloud size, our results demonstrate between 5.17x and 26.39x average latency improvements respectively, compared to our baseline implementations without spatial parallelism. Therefore, our proposed concept enables dynamic event interpretation for future scientific data acquisition systems.

Karlsruhe Institute of Technology (DE)
Ministry of Education
Openalex Percentile: Top 81%
Graph Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.