A case for energy-efficient acceleration of graph problems using embedded FPGA-based SoCs
Sparse graph problems are notoriously hard to accelerate on conventional platforms due to irregular memory access patterns resulting in underutilization of memory bandwidth. These bottlenecks on traditional x86-based systems mean that sparse graph problems scale very poorly, both in terms of perform...
Saved in:
Main Authors: | Moorthy, Pradeep, Kapre, Nachiket |
---|---|
其他作者: | School of Computer Science and Engineering |
格式: | Article |
語言: | English |
出版: |
2018
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/87968 http://hdl.handle.net/10220/45595 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Custom FPGA-based soft-processors for sparse graph acceleration
由: Kapre, Nachiket
出版: (2015) -
Sparse-representation-based graph embedding for traffic sign recognition
由: Lu, K., et al.
出版: (2014) -
Zedwulf: Power-Performance Tradeoffs of a 32-Node Zynq SoC Cluster
由: Moorthy, Pradeep, et al.
出版: (2015) -
GraphMMU: Memory Management Unit for Sparse Graph Accelerators
由: Han, Jianglei, et al.
出版: (2015) -
Respondent-driven sampling and sparse graph convergence
由: Athreya, S., et al.
出版: (2022)