Skip to main content

Parallel Algorithms for Solving Linear Equations in VLSI Circuit Simulation

  • Conference paper

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 18))

Abstract

Algorithms for parallel execution of Gaussian elimination to solve linear equations arising from VLSI circuit simulation are discussed. Here, elimination trees are used since they embody the dependence of data during the elimination process. They are important means for estimating and controlling parallel solution algorithms. The potential parallelism is increased by reducing the critical path length of the tree. Experimental results rest upon multithreaded methods and compare favourable with theoretical estimates of the speed-up.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. CEDUSA Reference Guide, Version 1.10, Institut für Theoretische Elektrotechnik, RWTH Aachen, 1997.

    Google Scholar 

  2. B. W. Kerninghan, S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, The Bell System Technical Journal, pp. 291–307, 1970.

    Google Scholar 

  3. J. W. H. Liu, Reordering Sparse Matrices for Parallel Elimination, Parallel Computing, Vol. 11, pp. 73–91, 1988.

    Article  Google Scholar 

  4. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.

    MATH  Google Scholar 

  5. J. Rüd iger, Effizienzabschätzungen und experimentelle Verifikation paralleler Algorithmen für lineare Gleichungssysteme der VLSI-Netzwerksimulation, Dissertation, CAU Kiel, Shaker Verlag, 2000.

    Google Scholar 

  6. K. Hachiya, Matrix Reordering for Parallel Circuit Simulation, seminar talk given at CAU Kiel, 1999.

    Google Scholar 

  7. SunOS 5.3 Guide to Multithread Programming, Sun Microsystems, Inc., Moutain View, California, 1993.

    Google Scholar 

  8. A. Schumacher, Netzwerksimulation von VLSI-Schaltungen auf Parallelrechnern, Dissertation, RWTH Aachen, Shaker Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dirks, H.K., Fischer, M., Rüdiger, J. (2001). Parallel Algorithms for Solving Linear Equations in VLSI Circuit Simulation. In: van Rienen, U., Günther, M., Hecht, D. (eds) Scientific Computing in Electrical Engineering. Lecture Notes in Computational Science and Engineering, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56470-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56470-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42173-3

  • Online ISBN: 978-3-642-56470-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics