Distributed computation of large-scale graph problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 2015-January, Issue January, 2015, Pages 391-410

  Klauck, Hartmut ^a,b   Nanongkai, Danupon ^a,c,d,e   Pandurangan, Gopal ^a,f,g   Robinson, Peter ^h  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^d UNIVERSITY OF VIENNA   (Austria)

^e BROWN UNIVERSITY   (United States)

^f University of Houston   (United States)

^g Brown Univerity   (United States)

^h NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPLEX NETWORKS; MESSAGE PASSING;

COMMUNICATION COMPLEXITY; COMMUNICATION ROUNDS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED PROCESSING; LARGE-SCALE GRAPH PROBLEMS; MESSAGE PASSING MODELS; MINIMUM SPANNING TREES; SUBGRAPH ISOMORPHISM;

TREES (MATHEMATICS);

EID: 84938244026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973730.28     Document Type: Conference Paper

References (41)

1. Gps: A graph processing system, http://infolab.stanford.edu/gps/. 1, 2
2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory (preliminary version). In FOCS, pages 337-347, 1986. 9
3. Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, and Murtaza Zafer. Minimum congestion mapping in a cloud. In PODC, pages 267-276, 2011. 2
4. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Corn-put. Syst. Sci., 68(4):702-732, 2004. Also in FOCS'02. 9
5. Surender Baswana and Sandeep Sen. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms, 30(4):532-563, 2007. 13
6. Paul Beame and Michael Luby. Parallel search for maximal independence given minimal dependence. In SODA, pages 212-218, 1990. 15
7. Mark Braverman, Ankit Garg, Denis Pankratov, and Omri Weinstein. From information to exact communication. In STOC, pages 151-160, 2013. 9
8. Amit Chakrabarti, Graham Cormode, and Andrew McGregor. Robust lower bounds for communication and stream computation. Electronic Colloquium on Computational Complexity (ECCC), 18:62, 2011. 3
9. Arkadev Chattopadhyay and Toniann Pitassi. The Story of Set Disjointness. SIGACT News, 41(3):59-85, 2010. 9
10. Atish Das Sarma, Anisur Rahaman Molla, Gopal Pan-durangan, and Eli Upfal. Fast distributed pagerank computation. In ICDCN, pages 11-26, 2013. 13
11. Atish Das Sarma, Danupon Nanongkai, and Gopal Pandurangan. Fast distributed random walks. In PODC, pages 161-170, 2009. 13
12. Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004. 1
13. Danny Dolev, Christoph Lenzen, and Shir Peled. "tri, tri again": Finding triangles and small subgraphs in a distributed setting - (extended abstract). In DISC, pages 195-209, 2012. 15
14. Dubhashi and Panconesi. Concentration of Measure for Analysis of Randomized Algorithms. Cambridge University Press, 2012. 10, 11
15. Michael Elkin, Hartmut Klauck, Danupon Nanongkai, and Gopal Pandurangan. Can quantum communication speed up distributed computation? In PODC, 2014. 5
16. Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, 1983. 12
17. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. Graph sparsification via refinement sampling. CoRR, abs/1004.4915, 2010. 14
18. Bala Kalyanasundaram and Georg Schnitger. The Probabilistic Communication Complexity of Set Intersection. SI AM J. Discrete Math., 5(4):545-557, 1992. Also in CCC'87. 9
19. Howard J. Karloff, Siddharth Suri, and Sergei Vassil-vitskii. A model of computation for mapreduce. In SODA, pages 938-948, 2010. 4
20. Pierre Kelsen. On the parallel complexity of computing a maximal independent set in a hypergraph. In STOC, pages 339-350, 1992. 15
21. Fabian Kuhn, Thomas Moscibroda, and Roger Watten-hofer. Local computation: Lower and upper bounds. CoRR, abs/1011.5470, 2010. 15
22. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997. 7, 8
23. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. Sublinear bounds for randomized leader election. In ICDCN, pages 348-362, 2013. 13, 15
24. Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii. Filtering: a method for solving graph problems in mapreduce. In SPAA, pages 85-94, 2011. 4
25. J. Lin and C. Dyer. Data-Intensive Text Processing with MapReduce. Morgan Claypool Publishers, 2010. 1, 4
26. Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. Graphlab: A new framework for parallel machine learning. In UAI, pages 340-349, 2010. 1
27. Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986. 14
28. Nancy Lynch. Distributed Algorithms. Morgan Kauf-mann, 1996. 2, 14
29. Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD Conference, pages 135-146, 2010. 1, 2
30. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. 8
31. Danupon Nanongkai. Distributed approximation algorithms for weighted shortest paths. In STOC, pages 565-573, 2014. 13, 14
32. Danupon Nanongkai, Atish Das Sarma, and Gopal Pandurangan. A tight unconditional lower bound on distributed randomwalk computation. In PODC, pages 257-266, 2011. 5
33. David Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. 2, 3, 4, 5, 11, 14
34. The Apache Project. Apache Giraph, http://giraph.apache.org/. 1, 2
35. Anand Rajaraman and Jeff Ullman. Mining of Massive Datasets. Cambridge University Press, October 2011. 2, 4
36. Alexander A. Razborov. On the Distributional Complexity of Disjointness. Theor. Comput. Sci., 106(2):385-390, 1992. Also in ICALP'90. 3, 9. 17
37. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan. David Peleg, and Roger Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM J. Comput, 41(5):1235-1265, 2012. 5
38. Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, and Amitabh Trehan. Dense subgraphs on dynamic networks. In Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, pages 151-165, 2012. 14
39. Isabelle Stanton. Streaming balanced graph partitioning for random graphs. CoRR, abs/1212.1121, 2012. 2
40. Isabelle Stanton and Gabriel Kliot. Streaming graph partitioning for large distributed graphs. In KDD, pages 1222-1230, 2012. 2
41. David P. Woodruff and Qin Zhang. When distributed computation is communication expensive. In DISC, pages 16-30, 2013. 3, 4, 5