M.S. / Computer Science / This paper deals with the problem of solving a system of sparse nonsymmetric matrices on a distributed memory multiprocessor computer, the Intel iPSC (hypercube). The processors have substantial local memory but no global shared memory. They communicate among themselves and with a host processor through message passing. The primary interest is to design an algorithm which exploits parallelism, and which performs elimination and solution of large sparse matrices. Elimination is performed by LU- decomposition. The storage scheme is based on linked list data-structure defined for a given generated matrix. The matrix is distributed by columns in a "wrapped" fashion so that elimination in the natural order will be balanced, if the sparsity structure is equally distributed across the columns. Numerical results from experiments running on the hypercube are included along with performance analysis.
| Identifer | oai:union.ndltd.org:OREGON/oai:content.ohsu.edu:etd/138 |
| Date | 05 1900 |
| Creators | Nader, Babak |
| Publisher | Oregon Health & Science University |
| Source Sets | Oregon Health and Science Univ. Library |
| Language | English |
| Detected Language | English |
| Type | Text |
| Format | Needs Adobe Acrobat Reader to view., pdf, 2101.864 KB |
| Rights | http://www.ohsu.edu/library/etd_rights.shtml |
Page generated in 0.0019 seconds