Maintenance of Strongly Connected Component in Shared-memory Graph.
Muktikanta SaPublished in: CoRR (2018)
Keyphrases
- strongly connected
- shared memory
- directed graph
- message passing
- parallel algorithm
- distributed memory
- optimum path forest
- parallel computing
- multi processor
- undirected graph
- parallel execution
- parallel architectures
- shared memory multiprocessors
- multi core systems
- parallel architecture
- parallel programming
- parallel machines
- address space
- general purpose
- parallel computers
- directed acyclic graph
- connected components
- belief propagation
- interprocess communication
- lower bound