Parallel Direct Solution of Linear Equations on FPGA-Based Machines

The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions is widely used for this purpose. Parallel implementations of this computation-intensive process are limited primarily to supercomputers. New generations of Field-Programmable Gate Array (FPGA) technologies enable the implementation of System-On-aProgrammable-Chip (SOPC) computing platforms that provide many opportunities for configurable computing. We present here the design and implementation of a parallel machine for LU factorization on an SOPC board, using multiple instances of a soft processor. A highly parallel Block -Diagonal-Bordered (BDB) algorithm for LU factorization is mapped to our multiprocessor. Our results prove the viability of our FPGA-based approach.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Xiaofang Wang, Sotirios G. Ziavras
• Keywords: Distributed And Parallel Computing, Field-programmable Gate Array, IPPS 2003, LU Factorization, Parallel Implementations