Designing parallel sparse matrix algorithms beyond data dependence analysis

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2001-January, Issue , 2001, Pages 7-13

  Lin, H X ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Algorithm design and analysis; Concurrent computing; Costs; Data analysis; Information analysis; Information technology; Parallel algorithms; Parallel processing; Partitioning algorithms; Sparse matrices

Indexed keywords

ALGORITHMS; COSTS; DATA REDUCTION; INFORMATION ANALYSIS; INFORMATION TECHNOLOGY; PARALLEL ALGORITHMS;

ALGORITHM DESIGN AND ANALYSIS; CONCURRENT COMPUTING; PARALLEL PROCESSING; PARTITIONING ALGORITHMS; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 3142743739     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2001.951838     Document Type: Conference Paper

References (11)

1. I.S. Duff, A.M. Erisman and J.K. Reid, Direct Methods for Sparse Matrices (Clarendon Press, Oxford, 1986).
2. A. George and J.W.H. Liu, Computer solution of large sparse positive definite systems (Prentice-Hall, 1981).
3. R.W. Hockney, A fast direct solution of Poisson's equation using Fourier analysis, Journal of ACM 12 (1965) 95-113.
4. D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure and M. Wolfe, Dependence graphs and complier optimizations, Proceedings of the 8th ACM Symp. Principles of Programming Languages, Williamsburg, V.A., 1981.
5. H.X. Lin, A methodology for the parallel direct solution of finite element systems, Ph.D. thesis, (Delft University of Technology 1993).
6. H.X. Lin and M.R.T. Roest, Parallel solution of symmetric banded systems, in:Parallel Computing: Trends and Applications, G.R. Joubert, D. Trystram, F.J. Peters and D.J. Evans (eds.), (Elsevier Science, 1994) 537-540.
7. H.X. Lin A framework for parallel algorithms for tridiagonal systems, Proceedings International Conference on Computational Engineering & Sciences, S.N. Atluri and F.W. Brust (eds.), 21-25 August, 2000, Los Angeles, USA. pp. 343-349.
8. H.X. Lin A Unifying Graph Model for Designing Parallel Algorithms For Tridiagonal Systems, to appear in Parallel Computing
9. S. Parter, The use of linear graphs in Gaussian elimination, SIAM Review 3 (1961) 119-130.
10. H.S. Stone, An efficient parallel algorithm for the solution of a tridiagonal linear system of equations, Journal of ACM 20 (1973) 27-38.
11. H.H. Wang, A parallel method for tridiagonal equations, ACM TOMS 7 (1981) 167-183.