A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scalable performance of ScaleGraph for large scale graph analysis
2012
2012 19th International Conference on High Performance Computing
Preserved Fulltext
Scalable analysis of massive graphs has become a challenging issue in high performance computing environments. ScaleGraph is an X10 library aimed for large scale graph analysis scenarios. This paper evaluates scalability of ScaleGraph library for degree distribution calculation, betweeness centrality, and spectral clustering algorithms. We make scalability evaluation by analyzing a synthetic Kronecker graph with 40.3 million edges (for all the three algorithms), and a real social network with
doi:10.1109/hipc.2012.6507498
dblp:conf/hipc/DayarathnaHOS12
fatcat:bgptnzn26bae7m3mzdrisdnggm