The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
From MaRDI portal
Publication:1110310
DOI10.1007/BF01941132zbMath0656.68020MaRDI QIDQ1110310
Publication date: 1988
Published in: BIT (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Calculi for synchrony and asynchrony
- A Computation Model of Parallel Solution of Linear Equations
- Solving Linear Algebraic Equations on an MIMD Computer
- Time and Parallel Processor Bounds for Linear Recurrence Systems
- Fast Parallel Matrix Inversion Algorithms
- On Stable Parallel Linear System Solvers
- Some Complexity Results for Matrix Computations on Parallel Processors
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- Basic Linear Algebra Subprograms for Fortran Usage
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
This page was built for publication: The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
