A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer.
Eric Goles Ch.Marcos A. KiwiPublished in: Parallel Comput. (1992)
Keyphrases
- memory access
- shared memory
- parallel algorithm
- lower bound
- computational complexity
- parallel architectures
- qr decomposition
- parallel computers
- upper bound
- message passing
- parallel computing
- np hard
- distributed memory
- worst case
- massively parallel
- branch and bound
- parallel machines
- parallel programming
- parallel architecture
- objective function
- parallel processing
- decomposition method
- optimal solution
- linear discriminant analysis
- computer systems
- shared memory multiprocessors
- data transfer
- dimension reduction
- computational cost
- multi core processors
- commodity hardware
- reinforcement learning