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
- Shengwen Liang (ORCID: https://orcid.org/0000-0001-8407-2594)
- X. L. Zhang (ORCID: https://orcid.org/0000-0002-5178-324X)
- Cheng Liu (ORCID: https://orcid.org/0000-0002-5542-7306)
- Lei Zhang (ORCID: https://orcid.org/0000-0001-9711-8758)
- Xinyu Chen (ORCID: https://orcid.org/0000-0003-1951-5015)
- Zheng Feng
Institutions
- Chinese Academy of Sciences (CN)
- Institute of Computing Technology (CN)
- University of Chinese Academy of Sciences (CN)
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
- Chinese Academy of Sciences
- National Key Research and Development Program of China