GraphScale: scalable Processing on FPGAs for HBM and large graphs
Recent advances in graph processing on FPGAs promise to alleviate performance bottlenecks with irregular memory access patterns. Such bottlenecks challenge performance for a growing number of important application areas like machine learning and data analytics. While FPGAs denote a promising solutio...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Article (Journal) |
| Lingua: | inglese |
| Pubblicazione: |
March 2024
|
| In: |
ACM transactions on reconfigurable technology and Systems
Year: 2024, Volume: 17, Fascicolo: 2, Pages: 1-23 |
| ISSN: | 1936-7406 |
| DOI: | 10.1145/3616497 |
| Accesso online: | Verlag, kostenfrei, Volltext: https://doi.org/10.1145/3616497 Verlag, kostenfrei, Volltext: https://dl.acm.org/doi/10.1145/3616497 
|
| Note sull'autore: | Jonas Dann, Daniel Ritter, Holger Fröning |
| Riassunto: | Recent advances in graph processing on FPGAs promise to alleviate performance bottlenecks with irregular memory access patterns. Such bottlenecks challenge performance for a growing number of important application areas like machine learning and data analytics. While FPGAs denote a promising solution through flexible memory hierarchies and massive parallelism, we argue that current graph processing accelerators either use the off-chip memory bandwidth inefficiently or do not scale well across memory channels.In this work, we propose GraphScale, a scalable graph processing framework for FPGAs. GraphScale combines multi-channel memory with asynchronous graph processing (i.e., for fast convergence on results) and a compressed graph representation (i.e., for efficient usage of memory bandwidth and reduced memory footprint). GraphScale solves common graph problems like breadth-first search, PageRank, and weakly connected components through modular user-defined functions, a novel two-dimensional partitioning scheme, and a high-performance two-level crossbar design. Additionally, we extend GraphScale to scale to modern high-bandwidth memory (HBM) and reduce partitioning overhead of large graphs with binary packing. |
|---|---|
| Descrizione del documento: | Veröffentlicht: 23. März 2024 Gesehen am 09.12.2024 |
| Descrizione fisica: | Online Resource |
| ISSN: | 1936-7406 |
| DOI: | 10.1145/3616497 |