Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization
Substitution, and reassociation of irregular sparse LU factorization can deliver up to 31% additional speedup over an existing state-of-the-art parallel FPGA implementation where further parallelization was deemed virtually impossible. The state-of-the-art implementation is already capable of delive...
Saved in:
Main Authors: | Siddhartha, Kapre, Nachiket |
---|---|
其他作者: | School of Computer Engineering |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2015
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/81075 http://hdl.handle.net/10220/39139 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Heterogeneous dataflow architectures for FPGA-based sparse LU factorization
由: Siddhartha, et al.
出版: (2015) -
Fanout decomposition dataflow optimizations for FPGA-based Sparse LU factorization
由: Siddhartha, et al.
出版: (2015) -
Custom FPGA-based soft-processors for sparse graph acceleration
由: Kapre, Nachiket
出版: (2015) -
An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads
由: Kapre, Nachiket, et al.
出版: (2015) -
VLIW-SCORE: Beyond C for sequential control of SPICE FPGA acceleration
由: Kapre, Nachiket, et al.
出版: (2015)