Balanced graph edge partition

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 1456-1465

  Bourse, Florian ^a   Lelarge, Marc ^a   Vojnović, Milan ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

approximation algorithms; distributed massive computation; graph edge partition; streaming heuristics

Indexed keywords

EID: 84907033604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623660     Document Type: Conference Paper

References (40)

1. A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In Proc. of the 20th Int'l Conf. on Parallel and Distributed Processing , IEEE IPDPS'06, pages 124-124, Washington, DC, USA, 2006.
2. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader. Scalable graph exploration on multicore processors. In Proc. of the 2010 ACM/IEEE Int'l Conf. for High Performance Computing, Networking, Storage and Analysis, SC '10, pages 1-11, Washington, DC, USA, 2010.
3. C. Curino, E. Jones, Y. Zhang, and S. Madden. Schism: a workload-driven approach to database replication and partitioning. In VLDB '10, 2010.
4. M. Curtiss, I. Becker, T. Bosman, S. Doroshenko, L. Grijncu, T. Jackson, S. Kunnatur, S. Lassen, P. Pronin, S. Sankar, G. Shen, G. Woss, C. Wang, and N. Zhang. Unicorn: A system for searching the social graph. In VLDB '13, 2013.
5. Q. Duong, S. Goel, J. Hofman, and S. Vassilvitskii. Sharding social networks. In ACM WSDM '13, pages 223-232, New York, NY, USA, 2013.
6. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM J. Comput., 31(4):1090-1118, Apr. 2002.
7. M. V. Florian Bourse, Marc Lelarge. Balanced edge partition. Technical Report MSR-TR-2014-20, Microsoft Research, 2014.
8. T. A. S. F. Giraph. http://giraph.apache.org, 2014.
9. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: distributed graph-parallel computation on natural graphs. In OSDI'12, pages 17-30. USENIX Association, 2012.
10. D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. In Proceedings of POOSC, 2005.
11. U. Kang, C. E. T., and C. Faloutsos. Pegasus: A peta-scale graph mining system. In ICDM, pages 229-238, 2009.
12. G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995.
13. G. Karypis and V. Kumar. Parallel multilevel graph partitioning. In Proc. of the 10th Int'l Parallel Processing Symposium, IEEE IPPS '96, pages 314-319, Washington, DC, USA, 1996.
14. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
15. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J., 49(2):291-307, Feb. 1970.
16. Z. Khayyat, K. Awara, A. Alonazi, H. Jamjoom, D. Williams, and P. Kalnis. Mizan: A system for dynamic load balancing in large-scale graph processing. In Proc. of the 8th ACM European Conference on Computer Systems, ACM EuroSys '13, pages 169-182, New York, NY, USA, 2013.
17. A. Konstantin and H. Räcke. Balanced graph partitioning. In SPAA '04, pages 120-124, 2004.
18. R. Krauthgamer, J. S. Naor, and R. Schwartz. Partitioning graphs into balanced components. In SODA '09, pages 942-949, 2009.
19. K. Lang. Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research Labs, 2004.
20. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2008.
21. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein. Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow., 5(8):716-727, Apr. 2012.
22. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. In UAI, pages 340-349, 2010.
23. G. Malewicz, M. H. Austern, A. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In ACM SIGMOD '10, pages 135-146, 2010.
24. Neo4j. http://www.neo4j.org, 2014.
25. J. Nishimura and J. Ugander. Restreaming graph partitioning: simple versatile algorithms for advanced balancing. In ACM KDD '13, pages 1106-1114, 2013.
26. F. Pellegrini and J. Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In High-Performance Computing and Networking, volume 1067 of Lecture Notes in Computer Science, pages 493-498. Springer Berlin Heidelberg, 1996.
27. V. Prabhakaran, M. Wu, X. Weng, F. McSherry, L. Zhou, and M. Haridasan. Managing large graphs on multi-cores with graph awareness. In USENIX ATC'12, pages 4-4, 2012.
28. J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez. The little engine(s) that could: scaling online social networks. In ACM SIGCOMM '10, pages 375-386, New York, NY, USA, 2010.
29. A. Roy, I. Mihailovic, and W. Zwaenepoel. X-stream: Edge-centric graph processing using streaming partitions. In ACM SOSP'13, 2013.
30. B. Shao, H. Wang, and Y. Li. Trinity: A distributed graph engine on a memory cloud. In Proceedings of the VLDB Endowment, VLDB '13, 2013.
31. J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In ACM PPoPP '13, pages 135-146, New York, NY, USA, 2013.
32. I. Stanton and G. Kliot. Streaming graph partitioning for large distributed graphs. In ACM KDD '12, pages 1222-1230, 2012.
33. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. SIAM J. Comput., 40(6):1715-1737, Dec. 2011.
34. C. Tsourakakis, C. Gkantsidis, B. Radunovic, and M. Vojnovic. Fennel: Streaming graph partitioning for massive scale graphs. In ACM WSDM '14, 2014.
35. J. Ugander and L. Backstrom. Balanced label propagation for partitioning massive graphs. In ACM WSDM '13, pages 507-516, 2013.
36. V. Venkataramani, Z. Amsden, N. Bronson, G. Cabrera III, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, J. Hoon, S. Kulkarni, N. Lawrence, M. Marchukov, D. Petrov, and L. Puzar. TAO: how facebook serves the social graph. In ACM SIGMOD '12, pages 791-792, 2012.
37. R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica. Graphx: a resilient distributed graph system on spark. In First International Workshop on Graph Data Management Experiences and Systems , ACM GRADES '13, pages 2:1-2:6, 2013.
38. S. Yang, X. Yan, B. Zong, and A. Khan. Towards effective partition management for large graphs. In ACM SIGMOD '12, pages 517-528, 2012.
39. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI'12, pages 2-2, Berkeley, CA, USA, 2012. USENIX Association.
40. J. Zhou, N. Bruno, and W. Lin. Advanced partitioning techniques for massively distributed computation. In ACM SIGMOD '12, pages 13-24, 2012.