GraphMMU: Memory Management Unit for Sparse Graph Accelerators
Memory management units that use low-level AXI descriptor chains to hold irregular graph-oriented access sequences can help improve DRAM memory throughput of graph algorithms by almost an order of magnitude. For the Xilinx Zed board, we explore and compare the memory throughputs achievable when usin...
Saved in:
Main Authors: | Han, Jianglei, Kapre, Nachiket, Bean, Andrew, Moorthy, Pradeep, Siddhartha |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81201 http://hdl.handle.net/10220/39176 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Graph MMU design for Zedwulf
by: Han, Jianglei
Published: (2014) -
Custom FPGA-based soft-processors for sparse graph acceleration
by: Kapre, Nachiket
Published: (2015) -
A case for energy-efficient acceleration of graph problems using embedded FPGA-based SoCs
by: Moorthy, Pradeep, et al.
Published: (2018) -
Spatial hardware implementation for sparse graph algorithms in GraphStep
by: Delorimier, Michael, et al.
Published: (2015) -
An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads
by: Kapre, Nachiket, et al.
Published: (2015)