Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study.
Thejaka Amila KanewalaMarcin ZalewskiMartina BarnasAndrew LumsdainePublished in: CoRR (2017)
Keyphrases
- distributed memory
- case study
- shared memory
- multiprocessor systems
- matrix multiplication
- single processor
- graph theory
- parallel implementation
- parallel computers
- fine grain
- depth first search
- parallel architectures
- ibm sp
- scientific computing
- parallel architecture
- parallel machines
- computational complexity
- graph data
- message passing
- data parallelism
- optimization problems