The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310): Difference between revisions
From MaRDI portal
Latest revision as of 19:24, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The semantics and complexity of parallel programs for vector computations. I: A case study using Ada |
scientific article |
Statements
The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (English)
0 references
1988
0 references
Theoretical investigation of the complexity of parallel programs, distinguishing three levels: (1) mathematical algorithm level, (2) program level, (3) computer architecture level. A case study is made for the LU decomposition, using Ada on a shared memory idealized architecture. Expressions for speedup and efficiency are presented.
0 references
shared memory machine
0 references
parallel programs
0 references
LU decomposition
0 references
Ada
0 references
speedup
0 references
efficiency
0 references
0 references
