Communication Lower Bounds for Distributed-Memory Computations.
Michele ScquizzatoFrancesco SilvestriPublished in: STACS (2014)
Keyphrases
- distributed memory
- lower bound
- matrix multiplication
- shared memory
- multithreading
- upper bound
- parallel implementation
- ibm sp
- fine grain
- multiprocessor systems
- scientific computing
- objective function
- parallel computers
- parallel machines
- data parallelism
- communication networks
- branch and bound algorithm
- parallel architecture
- post processing
- message passing
- data transmission
- parallel algorithm
- higher order
- multi processor
- similarity measure