dc.contributor.authorSiddhartha
dc.contributor.authorKapre, Nachiket
dc.date.accessioned2015-12-17T07:46:40Z
dc.date.available2015-12-17T07:46:40Z
dc.date.issued2014
dc.identifier.citationSiddhartha, & Kapre, N. (2014). Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization. 2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines, 60-63.en_US
dc.identifier.urihttp://hdl.handle.net/10220/39139
dc.description.abstractSubstitution, 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 delivering 3× acceleration over CPU-based sparse LU solvers. Sparse LU factorization is a well-known computational bottleneck in many existing scientific and engineering applications and is notoriously hard to parallelize due to inherent sequential dependencies in the computation graph. In this paper, we show how to break these alleged inherent dependencies using depth-limited substitution, and reassociation of the resulting computation. This is a work-parallelism tradeoff that is well-suited for implementation on FPGA-based token dataflow architectures. Such compute organizations are capable of fast parallel processing of large irregular graphs extracted from the sparse LU computation. We manage and control the growth in additional work due to substitution through careful selection of substitution depth. We exploit associativity in the generated graphs to restructure long compute chains into reduction trees.en_US
dc.format.extent4 p.en_US
dc.language.isoenen_US
dc.rights© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/FCCM.2014.26].en_US
dc.subjectComputer Science and Engineering
dc.titleBreaking Sequential Dependencies in FPGA-Based Sparse LU Factorizationen_US
dc.typeConference Paper
dc.contributor.conference2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)en_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/FCCM.2014.26
dc.description.versionAccepted versionen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record