The University of Southampton
University of Southampton Institutional Repository

Parallel sparse matrix solver for direct circuit simulations on FPGAs

Parallel sparse matrix solver for direct circuit simulations on FPGAs
Parallel sparse matrix solver for direct circuit simulations on FPGAs
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.
Nechma, Tarek
a0d5c618-5bc1-48a1-8716-f11f206ba3b3
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Nechma, Tarek
a0d5c618-5bc1-48a1-8716-f11f206ba3b3
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618

Nechma, Tarek, Zwolinski, Mark and Reeve, Jeff (2010) Parallel sparse matrix solver for direct circuit simulations on FPGAs. 2010 IEEE International Symposium on Circuits and Systems, Paris, Paris, France. 30 May - 02 Jun 2010. (doi:10.1109/ISCAS.2010.5537195).

Record type: Conference or Workshop Item (Paper)

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.

Text
Parallel_Sparse_Matrix_Solver_for_Direct_Circuit_Simulations_on_FPGAs.pdf - Version of Record
Restricted to Registered users only
Download (300kB)
Request a copy

More information

Submitted date: May 2010
e-pub ahead of print date: 3 August 2010
Published date: 3 August 2010
Venue - Dates: 2010 IEEE International Symposium on Circuits and Systems, Paris, Paris, France, 2010-05-30 - 2010-06-02
Organisations: EEE

Identifiers

Local EPrints ID: 270878
URI: http://eprints.soton.ac.uk/id/eprint/270878
PURE UUID: 0a74e679-b4ba-4a43-8587-c81df5d6d274
ORCID for Mark Zwolinski: ORCID iD orcid.org/0000-0002-2230-625X

Catalogue record

Date deposited: 21 Apr 2010 09:37
Last modified: 15 Mar 2024 02:39

Export record

Altmetrics

Contributors

Author: Tarek Nechma
Author: Mark Zwolinski ORCID iD
Author: Jeff Reeve

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×