Parallel sparse matrix solver for direct circuit simulations on FPGAs

ISCAS 2010 - 2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems

Volumn , Issue , 2010, Pages 2358-2361

  Nechma, Tarek ^a   Zwolínski, Mark ^a   Reeve, Jeff ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FLOATING-POINT DATA; FPGA IMPLEMENTATIONS; MATRIX; SIMULATION MATRICES; SPARSE MATRICES; SPICE SIMULATIONS; SYMBOLIC ANALYSIS; TASK FLOWS; UNIVERSITY OF FLORIDA;

DATA FLOW ANALYSIS; FABRICS;

CIRCUIT SIMULATION;

EID: 77955999186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2010.5537195     Document Type: Conference Paper

References (20)

1. A. Mahmood et. al, "Parallel sparse-matrix solution for direct circuit simulation on atransputer array," IEE Proc-, Devices and Systems, 1997.
2. L. Nagel, Spice 2: A computer program to stimulate semiconductor circuits. University of California Berkeley, 1975.
3. C. Ho, A. Ruehli, and P. Brennan, "The modified nodal approach to network analysis," IEEE Transactions on Circuits and Systems, 1975.
4. J. Johnson et. al, "Performance Analysis of Loadflow Computation Using FPGA," in Proc. of 15th Power Sys Computation, 2005.
5. T. Davis, "UMFPACK, Version 5," University of Florida, 2006.
6. T. DAVIS and E. NATARAJAN, "Algorithm 8xx: KLU, a direct sparse solver for circuit simulation problems."
7. C. Bomhof et. al, "A parallel linear system solver for circuit simulation problems," Numerical linear algebra with applications, 2000.
8. J. Johnson et. al, "Sparse LU Decomposition using FPGA," in Int Workshop on State-of-the-Art in Scientific and Parallel Computing, 2008.
9. X. Wang et. al "Parallel LU factorization of sparse matrices on FPGAbased configurable computing engines," Conc and Comp, 2004.
10. X. Wang et.al, "Parallel solution of Newton's power flow equations on configurable chips," Int J. of Electrical Power and Energy Sys, 2007.
11. J. Gilbert et. al, "Sparse matrices in MATLAB: Design and implementation," SIAM J. Matrix Anal. Appl, 1992.
12. I. Duff et. al, Direct methods for sparse matrices. Oxford Press, 1986.
13. L. Grigori et. al, "Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization," 2008.
14. I. Duff, "On algorithms for obtaining a maximum transversal," ACM Transactions on Mathematical Software, 1981.
15. -, "Algorithm 575: Permutations for a zero-free diagonal [F1]," ACM Transactions on Mathematical Software (TOMS), 1981.
16. J. Liu, "The role of elimination trees in sparse factorization," SIAM Journal on Matrix Analysis and Applications, vol. 11, p. 134, 1990.
17. J. Gilbert et. al, "Sparse partial pivoting in time proportional to arithmetic operations," 1986.
18. X. Li and J. Demmel, "Making sparse Gaussian elimination scalable by static pivoting," in IEEE conf on Supercomputing, 1998.
19. A. HSL, "collection of Fortran codes for large-scale scientific computation, 2007," See http://www. cse. clrc. ac. uk/nag/hsl.
20. C. Aykanat et. al, "Permuting sparse rectangular matrices into blockdiagonal form," SIAM Journal on Scientific Computing, 2004.