Accession Number : ADA187152
Title : Sparse Cholesky Factorization on a Local-Memory Multiprocessor.
Descriptive Note : Final rept.,
Corporate Author : OAK RIDGE NATIONAL LAB TN
Personal Author(s) : George, Alan ; Heath, Micheal T ; Liu, Joseph ; Ng, Esmond
PDF Url : ADA187152
Report Date : Apr 1986
Pagination or Media Count : 24
Abstract : This article deals with the problem of factoring a large sparse positive definite matrix on a multiprocessor system. The processors are assumed to have substantial local memory but no globally shared memory. They communicate among themselves and with a host processor through message passing. Our primary interest is in designing an algorithm which exploits parallelism, rather than in exploiting features of the underlying topology of the hardware. However, part of our study is aimed at determining, for certain sparse matrix problems, whether hardware based on the binary hypercube topology adequately supports the communication requirements for such problems. Numerical results from experiments running on a multiprocessor simulator are included.
Descriptors : *COMMUNICATION AND RADIO SYSTEMS, *MEMORY DEVICES, *MULTIPROCESSORS, *PROCESSING EQUIPMENT, *TOPOLOGY, ALGORITHMS, NUMERICAL ANALYSIS, REQUIREMENTS, SIMULATORS, SPARSE MATRIX, TIME SHARING
Subject Categories : Computer Hardware
Command, Control and Communications Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE