Parallel sparse-matrix solution for direct circuit simulation on a transputer array

Parallel sparse-matrix solution for direct circuit simulation on a transputer array

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Circuits, Devices and Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Sparse-matrix solution is a dominant part of execution time in simulating VLSI circuits by a detailed simulation program such as SPICE. The paper develops a parallel-block partitionable sparse-matrix-solution algorithm which exploits sparsity at the matrix block level as well as within a nonzero block. An efficient mapping scheme to assign different matrix blocks to processors is developed which maximises concurrency and minimises communication between processors. Associated reordering and efficient sparse storage schemes are also developed. Implementation of this parallel algorithm is carried out on a transputer processor array which plugs into a PC bus. The sparse matrix solver is tested on matrices generated from a transistor-level expansion of ISCAS-85 benchmark logic circuits. Good acceleration is obtained for all benchmark matrices up to the number of transputers available.


    1. 1)
      • Nagel, L.W.: `SPICE2: a computer program to simulate semiconductor circuits', ERL-M520, memorandum, May 1975.
    2. 2)
      • P. Cox , R. Burch . Direct circuit simulation algorithms for parallel processing. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. , 6 , 714 - 725
    3. 3)
      • P. Sadayappan , V. Visvanathan . Circuit simulation on shared memory multiprocessors. IEEE Trans. , 12 , 1634 - 1642
    4. 4)
      • Yang, G.C.: `PARASPICE: a parallel circuit simulator for shared-memory multiprocessors', Proceedings of the 27th Design automation conference, 1990, p. 400–405.
    5. 5)
      • J.K. White , A.S. Vincentelli . (1987) Relaxation techniques for the simulation of VLSI circuits.
    6. 6)
      • Trotter, J.A., Agrawal, P.: `Circuit simulation algorithms on a distributed memory multiprocessorsystem', Proceedings of ICCAD-90, 1990, p. 438–441.
    7. 7)
      • Sadayappan, P.: `Efficient sparse matrix factorization for circuit simulation on vectorsupercomputers', Proceedings of the 26th Design automation conference, 1989, p. 13–18.
    8. 8)
      • Vladimirescu, A., Pederson, D.O.: `Circuit simulation on vector processors', Proceedings of the IEEE ICCC, 1982, p. 172–175.
    9. 9)
      • B. Greer . Converting SPICE to vector code. VLSI Syst. Des. , 1
    10. 10)
      • A. Mahmood , S. Sparks , W.I. Baker . Systolic algorithms for solving a sparse system of linear equations incircuit simulation. Integr. VLSI J. , 1 , 83 - 107
    11. 11)
      • Chilakpati, U.: `Parallel SOLVE for SPICE on a network of workstations', MS project report, 1995.
    12. 12)
      • Sangiovanni-Vincentelli, A.: `A new tearing approach-node tearing nodal analysis', Proceedings of the IEEE international symposium on Circuitsand systems, 1977, p. 143–145.
    13. 13)
      • K. Hwang , Y.H. Cheng . Partitioned matrix algorithms for VLSI arithmetic systems. IEEE Trans. , 12 , 1215 - 1224
    14. 14)
      • J.J. Navarro . Partitioning: an essential step in mapping algorithms into systolic arrayprocessors. Computer , 77 - 89
    15. 15)
      • V. Kumar , A. Grama , A. Gupta , G. Karypis . (1994) Introduction to parallel computing, design and analysis of algorithms.
    16. 16)
      • Chu, Y.: `Parallel solution of sparse matrix equations in SPICE on a transputerarray', MS project report, 1995.
    17. 17)
      • Trotter, J.A., Agrawal, P.: `Fast overlapped scattered array storage schemes for sparse matrices', Proceedings of the ICCAD, 1990, p. 450–453.
    18. 18)
      • H.M. Markowitz . The elimination form of the inverse and its application to linear programming. Manage. Sci. , 255 - 269
    19. 19)
      • Eisenstat, S.C.: `Yale sparse matrix package II: the nonsymmetric codes', 114, Research report, 1977.

Related content

This is a required field
Please enter a valid email address