To 4, 000 compute nodes and beyond: network-aware vertex placement in large-scale graph processing systems.
Karim AwaraHani JamjoomPanos KalnisPublished in: SIGCOMM (2013)
Keyphrases
- directed graph
- undirected graph
- strongly connected
- graph structure
- network structure
- spanning tree
- edge weights
- complex networks
- sparsely connected
- average degree
- random graphs
- fully connected
- distributed network
- small world
- path length
- graph mining
- attributed graphs
- directed edges
- finding the shortest path
- scale free
- centrality measures
- local area network
- planar graphs
- root node
- degree distribution
- bipartite graph
- computer networks
- graph mining algorithms