FPGA-Based High-Performance and Scalable Block LU Decomposition Architecture
In: IEEE Transactions on Computers, Jg. 61 (2012), S. 60-72
Online
unknown
Zugriff:
Decomposition of a matrix into lower and upper triangular matrices (LU decomposition) is a vital part of many scientific and engineering applications, and the block LU decomposition algorithm is an approach well suited to parallel hardware implementation. This paper presents an approach to speed up implementation of the block LU decomposition algorithm using FPGA hardware. Unlike most previous approaches reported in the literature, the approach does not assume the matrix can be stored entirely on chip. The memory accesses are studied for various FPGA configurations, and a schedule of operations for scaling well is shown. The design has been synthesized for FPGA targets and can be easily retargeted. The design outperforms previous hardware implementations, as well as tuned software implementations including the ATLAS and MKL libraries on workstations. � 2006 IEEE.
Titel: |
FPGA-Based High-Performance and Scalable Block LU Decomposition Architecture
|
---|---|
Autor/in / Beteiligte Person: | Chandrachoodan, Nitin ; Manish Kumar Jaiswal |
Link: | |
Zeitschrift: | IEEE Transactions on Computers, Jg. 61 (2012), S. 60-72 |
Veröffentlichung: | Institute of Electrical and Electronics Engineers (IEEE), 2012 |
Medientyp: | unknown |
ISSN: | 0018-9340 (print) |
DOI: | 10.1109/tc.2011.24 |
Schlagwort: |
|
Sonstiges: |
|