Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates

@article{Pearce2014FasterPT,
  title={Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates},
  author={Roger A. Pearce and Maya Gokhale and Nancy M. Amato},
  journal={SC14: International Conference for High Performance Computing, Networking, Storage and Analysis},
  year={2014},
  pages={549-559}
}
At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS

A Distributed Infomap Algorithm for Scalable and High-Quality Community Detection

VIEW 4 EXCERPTS
CITES METHODS & RESULTS
HIGHLY INFLUENCED

A Scalable Distributed Louvain Algorithm for Large-Scale Graph Community Detection

  • 2018 IEEE International Conference on Cluster Computing (CLUSTER)
  • 2018
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs

  • 2018 IEEE International Conference on Cluster Computing (CLUSTER)
  • 2018
VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

IP Cores for Graph Kernels on FPGAs

  • 2019 IEEE High Performance Extreme Computing Conference (HPEC)
  • 2019
VIEW 1 EXCERPT
CITES METHODS

Incremental Graph Processing for On-line Analytics

  • 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2019
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES