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 |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81075 http://hdl.handle.net/10220/39139 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Heterogeneous dataflow architectures for FPGA-based sparse LU factorization
by: Siddhartha, et al.
Published: (2015) -
Fanout decomposition dataflow optimizations for FPGA-based Sparse LU factorization
by: Siddhartha, et al.
Published: (2015) -
Custom FPGA-based soft-processors for sparse graph acceleration
by: Kapre, Nachiket
Published: (2015) -
An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads
by: Kapre, Nachiket, et al.
Published: (2015) -
VLIW-SCORE: Beyond C for sequential control of SPICE FPGA acceleration
by: Kapre, Nachiket, et al.
Published: (2015)