Efficient sparse matrix factorization for circuit simulation on vector supercomputers

  • Authors:
  • P. Sadayappan;V. Visvanathan

  • Affiliations:
  • Department of Computer and Information Science, The Ohio State University, Columbus, Ohio;AT&T Bell Laboratories, Murray Hill, New Jersey

  • Venue:
  • DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
  • Year:
  • 1989

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper describes an efficient approach to sparse matrix factorization on vector supercomputers. The approach is suitable for application domains like circuit simulation that require the repeated direct solution of unsymmetric sparse linear systems of equations with identical zero-nonzero structure. An Overlap-Scatter data structure is used to represent the sparse matrix, enabling the use of multiple operand access modes to achieve higher performance than earlier proposed approaches. The superior performance of the new solver is demonstrated using a number of matrices derived from circuit simulation runs.