Parallel Sparse Matrix Solver for Direct Circuit Simulations on FPGAs


Nechma, Tarek, Zwolinski, Mark and Reeve, Jeff (2010) Parallel Sparse Matrix Solver for Direct Circuit Simulations on FPGAs. In, ISCAS, Paris, (Submitted).

Download

[img] PDF - Published Version
Restricted to Registered users only

Download (293Kb) | Request a copy

Description/Abstract

As part of our effort to parallelise SPICE simulations over multiple FPGAs, we present a parallel FPGA implementation for a sparse matrix solver optimised for execution on a single FPGA node. Our approach combines static pivoting with symbolic analysis to compute an accurate task flow-graph which efficiently exploits parallelism at multiple granularities and sustains high floating-point data rates. The sparse matrix solver is tested with circuit simulation matrices from the University of Florida matrix collection. We report a 10-30X speedup compared to a 2.4 GHz Intel Core Duo processor running UMFPACK, a state-of-the-art sparse matrix solver.

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science > EEE
Item ID: 270878
Date Deposited: 21 Apr 2010 09:37
Last Modified: 01 Mar 2012 15:07
Contributors: Nechma, Tarek (Author)
Zwolinski, Mark (Author)
Reeve, Jeff (Author)
Date: May 2010
Status: Submitted
Further Information:Google Scholar
ISI Citation Count:2
URI: http://eprints.soton.ac.uk/id/eprint/270878

Actions (login required)

View Item View Item