To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations.
Maciej BestaMichal PodstawskiLinus GronerEdgar SolomonikTorsten HoeflerPublished in: CoRR (2020)
Keyphrases
- graph representation
- directed graph
- random walk
- graph theory
- directed acyclic graph
- structured data
- graph model
- stable set
- bipartite graph
- interprocess communication
- communication overhead
- communication systems
- graph structure
- graph matching
- communication networks
- information exchange
- graph databases
- spanning tree
- minimum spanning tree
- connected components
- graph construction
- graph search
- communication protocols
- data sets
- concurrent processes
- real time