Name
Abstract | ||
|---|---|---|
A row-oriented implementation of Gaussian elimination with partial pivoting on a local-memory multiprocessor is described. In the absence of pivoting, the initial data loading of the node processors leads to a balanced computation. However, if interchanges occur, the computational loads on the processors may become unbalanced, leading to inefficiency. A simple load-balancing scheme is described which is inexpensive and which maintains computational balance in the presence of pivoting. Using some reasonable assumptions about the probability of pivoting occurring, an analysis of the communication costs of the algorithm is developed, along with an analysis of the computation performed in each node processor. This model is then used to derive the expected speedup of the algorithm. Finally, experiments using an Intel hypercube are presented in order to demonstrate the extent to which the analytical model predicts the performance. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0167-8191(87)90007-X | PARALLEL COMPUTING |
Keywords | DocType | Volume |
Intel hypercube,linear algebra,Gaussian elimination,row-oriented implementation,multiprocessor | Journal | 5 |
Issue | ISSN | Citations |
1-2 | 0167-8191 | 6 |
PageRank | References | Authors |
8.61 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eleanor Chu | 1 | 13 | 9.90 |
| Alan George | 2 | 109 | 24.60 |