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 |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/87968 http://hdl.handle.net/10220/45595 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Custom FPGA-based soft-processors for sparse graph acceleration
by: Kapre, Nachiket
Published: (2015) -
Sparse-representation-based graph embedding for traffic sign recognition
by: Lu, K., et al.
Published: (2014) -
GraphMMU: Memory Management Unit for Sparse Graph Accelerators
by: Han, Jianglei, et al.
Published: (2015) -
Zedwulf: Power-Performance Tradeoffs of a 32-Node Zynq SoC Cluster
by: Moorthy, Pradeep, et al.
Published: (2015) -
An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads
by: Kapre, Nachiket, et al.
Published: (2015)