Abstract
Graph partitioning is required for solving tasks on graphs that need to be distributed over disks or computers. This problem is well studied, but the majority of the results on this subject are not suitable for processing graphs with billions of nodes on commodity clusters, since they require shared memory or lowlatency messaging. One of the approaches suitable for cluster computing is the balanced label propagation, which is based on the label propagation algorithm. In this work, we show how multi-level optimization can be used to improve quality of the partitioning obtained by means of the balanced label propagation algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garey, M.R., Johnson, D.S., and Stockmeyer, L., Some simplified NP-complete graph problems, Theoretical Comput. Sci., 1976, vol. 1, no. 3, pp. 237–267.
Karypis, G. and Kumar, V., A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Computing, 1998, vol. 20, no. 1, pp. 359–392.
Ugander, J. and Backstrom, L., Balanced label propagation for partitioning massive graphs, Proc. of the Sixth ACM Int. Conf. on Web Search and Data Mining, WSDM'13 (Rome, 2013), Rome: ACM, 2013, pp. 507–516.
Kernighan, B.W. and Lin, S., An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 1970, vol. 49, no. 2, pp. 291–307.
Raghavan, U., Albert, R., and Kumara, S., Near linear time algorithm to detect community structures in largescale networks, Phys. Rev., E 76, 036106. Published September 11, 2007.
Dean, J. and Ghemawat, S., MapReduce: Simplified data processing on large clusters, OSDI'04: Sixth Symp. on Operating System Design and Implementation, San Francisco, 2004, pp. 137–150.
Zaharia M. et al., Resilient distributed datasets: A faulttolerant abstraction for in-memory cluster computing, Proc. of the 9th USENIX Conf. on Networked Systems Design and Implementation, NSDI'12 (San Jose, 2012), San Jose: USENIX Association, 2012.
Stanford Network Analysis Project, LiveJournal social network. 2006. http://snap.stanford.edu/data//socLiveJournal1.html.
Backstrom, L. et al., Group formation in large social networks: Membership, growth, and evolution, Proc. of the 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD'06 (Philadelphia, 2006), Philadelphia: ACM, 2006, pp. 44–54.
Sampling Online Social Networks, Facebook Social Graph. 2009. http://odysseas.calit2.uci.edu/doku.php//public:online_social_networks$#$facebook_social_graph¯_mhrw_uni.
Gjoka, M. et al., Walking in Facebook: A case study of unbiased sampling of OSNs, Proc. of the 29th Conf. on Information Communications, INFOCOM’10 (San Diego, 2010), San Diego: IEEE, 2010, pp. 2498–2506.
Gonzalez, J.E. et al., PowerGraph: Distributed graphparallel computation on natural graphs, Proc. of the 10th USENIX Conf. on Operating Systems Design and Implementation, OSDI'12 (Hollywood, 2012), Hollywood: USENIX Association, 2012, pp. 17–30.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © R.K. Pastukhov, A.V. Korshunov, D.Yu. Turdakov, S.D. Kuznetsov, 2014, published in Trudy ISP RAN [The Proceedings of ISP RAS], 2014, Vol. 26, No. 4.
Rights and permissions
About this article
Cite this article
Pastukhov, R.K., Korshunov, A.V., Turdakov, D.Y. et al. Improving quality of graph partitioning using multi-level optimization. Program Comput Soft 41, 302–306 (2015). https://doi.org/10.1134/S0361768815050096
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768815050096