Communication Lower Bounds for Distributed-Memory Computations.
Michele ScquizzatoFrancesco SilvestriPublished in: CoRR (2013)
Keyphrases
- distributed memory
- lower bound
- matrix multiplication
- shared memory
- parallel implementation
- multiprocessor systems
- upper bound
- fine grain
- multithreading
- ibm sp
- scientific computing
- parallel architecture
- parallel computers
- multi processor
- objective function
- data parallelism
- branch and bound algorithm
- message passing
- parallel algorithm
- parallel machines
- high performance computing
- parallel computing
- multistage
- cloud computing
- high resolution
- high quality