An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads
Parallel graph-oriented applications expressed in the Bulk-Synchronous Parallel (BSP) and Token Dataflow compute models generate highly-structured communication workloads from messages propagating along graph edges. We can statially expose this structure to traffic compilers and optimization tools t...
Saved in:
Main Authors: | Kapre, Nachiket, Dehon, André |
---|---|
其他作者: | School of Computer Engineering |
格式: | Article |
語言: | English |
出版: |
2015
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/81118 http://hdl.handle.net/10220/39124 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Spatial hardware implementation for sparse graph algorithms in GraphStep
由: Delorimier, Michael, et al.
出版: (2015) -
Custom FPGA-based soft-processors for sparse graph acceleration
由: Kapre, Nachiket
出版: (2015) -
VLIW-SCORE: Beyond C for sequential control of SPICE FPGA acceleration
由: Kapre, Nachiket, et al.
出版: (2015) -
Parallelizing Sparse Matrix Solve for SPICE Circuit Simulation using FPGAs
由: Kapre, Nachiket, et al.
出版: (2015) -
Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization
由: Siddhartha, et al.
出版: (2015)