Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gupta, Anshul Kumar, Vipin |
| Abstract | A few parallel algorithms for solving triangular systems resulting from parallel factorization of sparse linear systems have been proposed and implemented recently. We present a detailed analysis of parallel complexity and scalability of the best of these algorithms and the results of its implementation on up to 256 processors of the Cray T3D parallel computer. It has been a common belief that parallel sparse triangular solvers are quite unscalable due to a high communication to computation ratio. Our analysis and experiments show that, although not as scalable as the best parallel sparse Cholesky factorization algorithms, parallel sparse triangular solvers can yield reasonable speedups in runtime on hundreds of processors. We also show that for a wide class of problems, the sparse triangular solvers described in this paper are optimal and are asymptotically as scalable as a dense triangular solver. |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Parallel Sparse Triangular Solver Wide Class Dense Triangular Solver Triangular System Reasonable Speedup Parallel Complexity Direct Solution Parallel Sparse Cholesky Factorization Algorithm Sparse Triangular Solver Parallel Algorithm Back Substitution High Communication Computation Ratio Sparse Linear System Parallel Factorization Cray T3d Common Belief Detailed Analysis |
| Content Type | Text |
| Resource Type | Article |
