Name
Abstract | ||
|---|---|---|
In this paper, the methods and implementation techniques used for the nonsymmetric sparse linear system solver, MCSPARSE On the Cedar system are described. A novel reordering scheme (H*) upon which the solver is based is presented. The tradeoffs discussed include stability and fill-in control, hierarchical parallelism, and load balancing. Experimental results demonstrating the effectiveness of the solver with respect to each of these issues are presented. We also address the implications of this work for other parallel processing systems. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/S0167-8191(96)00047-6 | Parallel Computing |
Keywords | Field | DocType |
shared memory,directed acyclic graph,linear system,linear algebra,implementation,linear equations,tight coupling,load balance,parallel processing | Linear algebra,Linear system,Computer science,Load balancing (computing),Parallel computing,Sparse approximation,Parallel processing,Theoretical computer science,Solver | Journal |
Volume | Issue | ISSN |
22 | 10 | 0167-8191 |
Citations | PageRank | References |
5 | 1.61 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kyle Gallivan | 1 | 889 | 154.22 |
| Bret A. Marsolf | 2 | 53 | 7.68 |
| Harry A. G. Wijshoff | 3 | 597 | 65.89 |