Graphitron: A Domain Specific Language for FPGA-Based Graph Processing Accelerator Generation

Due to hardware customization capabilities, FPGA-based graph processing accelerators achieve significantly higher energy efficiency than many general-purpose computing engines. However, designing these accelerators remains a substantial challenge for high-level users. To overcome the programming barrier, FPGA-based accelerator design frameworks on top of generic graph processing programming models have been developed to automate accelerator generation through pre-built templates. However, they often tightly couple graph processing algorithms, programming models and processing paradigms, and accelerator architectures, which severely limits the expression scope of the algorithms and may also restrict the performance when the generated accelerators fail to suit dynamic processing patterns of the graph processing algorithms.

Authors

Institutions

Publication Details

Published
2025-06-13
DOI
https://doi.org/10.1145/3735452.3735533
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

Graphitron: A Domain Specific Language for FPGA-Based Graph Processing Accelerator Generation

Shengwen Liang, X. L. Zhang, Cheng Liu, Lei Zhang et al.
Graph Theory and Algorithms
article

Graphitron: A Domain Specific Language for FPGA-Based Graph Processing Accelerator Generation

Shengwen Liang, X. L. Zhang, Cheng Liu, Lei Zhang, Xinyu Chen, Zheng Feng
article en

Abstract

Due to hardware customization capabilities, FPGA-based graph processing accelerators achieve significantly higher energy efficiency than many general-purpose computing engines. However, designing these accelerators remains a substantial challenge for high-level users. To overcome the programming barrier, FPGA-based accelerator design frameworks on top of generic graph processing programming models have been developed to automate accelerator generation through pre-built templates. However, they often tightly couple graph processing algorithms, programming models and processing paradigms, and accelerator architectures, which severely limits the expression scope of the algorithms and may also restrict the performance when the generated accelerators fail to suit dynamic processing patterns of the graph processing algorithms.

Chinese Academy of Sciences (CN), Institute of Computing Technology (CN), University of Chinese Academy of Sciences (CN)
Chinese Academy of Sciences, National Key Research and Development Program of China
Openalex Percentile: Top 88%
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.

Graphitron: A Domain Specific Language for FPGA-Based Graph Processing Accelerator Generation — Shengwen Liang, X. L. Zhang, et al. · (2025) | TGRS Research Map | TGRS