A note on communication analysis of parallel sparse Cholesky factorization on a hypercube (Q751753): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(90)90158-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052302395 / rank | |||
Normal rank | |||
Latest revision as of 23:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on communication analysis of parallel sparse Cholesky factorization on a hypercube |
scientific article |
Statements
A note on communication analysis of parallel sparse Cholesky factorization on a hypercube (English)
0 references
1990
0 references
The communication analysis for the nested-dissection method of column- oriented Cholesky factorization established by \textit{A. George}, \textit{J. W. H. Liu}, and \textit{E. Ng} [ibid. 10, No.3, 287-298 (1989; Zbl 0687.65024)] is simplified using the subgrid-to-subcube column assignment for a \(k\times k\) grid on a hypercube of p processors. The authors show that the amount of communication is \(O(k^ 2)\) per processor, which implies balanced communication.
0 references
parallel algorithms
0 references
communication analysis
0 references
nested-dissection method
0 references
Cholesky factorization
0 references
hypercube
0 references
