Impact of communications of the complexity of the parallel Gaussian elimination (Q2277765)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4197259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Impact of communications of the complexity of the parallel Gaussian elimination |
scientific article; zbMATH DE number 4197259 |
Statements
Impact of communications of the complexity of the parallel Gaussian elimination (English)
0 references
1991
0 references
From authors' summary: This paper presents an extension to the complexity analysis of parallel algorithms on MIMD computers with a shared-memory system which takes into account communications. The new scheduling algorithm that we have proposed in this paper reduces the overhead to only \(O(n^ 2)\).
0 references
Gaussian elimination
0 references
complexity
0 references
parallel algorithms
0 references
MIMD computers
0 references
shared-memory system
0 references
scheduling algorithm
0 references
0.9420057
0 references
0.91016126
0 references
0.88872665
0 references
