Hardware implementation of LU decomposition using dataflow architecture on FPGA
Authors:
- 1 March 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 298-302
Abstract
Recent FPGA technology advances permitted the hardware implementation of selected software functions to enhance programs performance. Most of the work done was only concerned with integer operations. Little effort addressed floating point operations. In this paper we propose a dataflow implementation of the LU decomposition on FPGA. A modified Kernighan-Lin based task partitioning and assignment algorithm is presented in this paper. The algorithm showed acceptable improvement over existing techniques.Keywords
This publication has 8 references indexed in Scilit:
- Parallel sparse matrix solver for direct circuit simulations on FPGAs2010
- Parallelizing sparse Matrix Solve for SPICE circuit simulation using FPGAs2009
- On-Chip NetworksSynthesis Lectures on Computer Architecture, 2009
- Packet Switched vs. Time Multiplexed FPGA Overlay Networks2006
- A Supernodal Approach to Sparse Partial PivotingSIAM Journal on Matrix Analysis and Applications, 1999
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- MonsoonACM SIGARCH Computer Architecture News, 1990
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970