Optimizing graph algorithms on pregellike systems

Proceedings of the VLDB Endowment

Volumn 7, Issue 7, 2014, Pages 577-588

  Salihoglu, Semih ^a   Widom, Jennifer ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE DATASET;

COMPONENT SIZE; COMPUTATION COSTS; INPUT GRAPHS; LARGE DIAMETER; LARGE GRAPHS; OPEN SOURCES; OPTIMIZATION TECHNIQUES; SLOW CONVERGENCES;

GRAPH ALGORITHMS;

EID: 84896850348     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732286.2732294     Document Type: Conference Paper

References (47)

1. F. N. Afrati, A. D. Sarma, S. Salihoglu, and J. D. Ullman. Upper and Lower Bounds on the Cost of a Map-reduce Computation. Proceedings of the VLDB Endowment, 6(4), Feb. 2013.
2. F. N. Afrati and J. D. Ullman. Optimizing multiway joins in a map-reduce environment. IEEE Transactions on Knowledge and Data Engineering, 23(9), 2011.
3. J. Barnat, P. Bauch, L. Brim, and M. Ceska. Computing Strongly Connected Components in Parallel on CUDA. In Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, 2011.
4. J. Barnat, J. Chaloupka, and J. C. van de Pol. Distributed Algorithms for SCC Decomposition. Journal of Logic and Computation, 2009.
5. P. Beame, P. Koutris, and D. Suciu. Communication Steps for Parallel Query Processing. In Proceedings of the 32Nd Symposium on Principles of Database Systems, 2013.
6. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. UbiCrawler: A Scalable Fully Distributed Web Crawler. Software: Practice & Experience, 34(8), 2004.
7. P. Boldi, M. Rosa, M. Santini, and S. Vigna. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the International Conference on World Wide Web, 2011.
8. P. Boldi and S. Vigna. The Web Graph Framework I: Compression Techniques. In Proceedings of the International Conference on World Wide Web, 2004.
9. U. Brandes. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2), 2001.
10. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph Structure in the Web. Computer Networks, 33(1-6), 2000.
11. S. Chung and A. Condon. Parallel Implementation of Boruvka's Minimum Spanning Tree Algorithm. In Proceedings of the International Parallel Processing Symposium, 1996.
12. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proceedings of the Symposium on Operating System Design and Implementation, 2004.
13. F. Dehne and S. Götz. Practical Parallel Algorithms for Minimum Spanning Trees. In Proceedings of the IEEE Symposium on Reliable Distributed Systems, 1998.
14. F. Manne and R. H. Bisseling. A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. In In Proceedings of the International Conference on Parallel Processing and Applied Mathematics, 2007.
15. L. Fleischer, B. Hendrickson, and A. Pinar. On Identifying Strongly Connected Components in Parallel. In Proceedings of the IPDPS Workshops on Parallel and Distributed Processing, 2000.
16. A. H. Gebremedhin and F. Manne. Scalable Parallel Graph Coloring Algorithms. Concurrency-Practice and Experience, 12(12), 2000.
17. Apache Incubator Giraph. http://incubator.apache.org/giraph/.
18. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation, 2012.
19. GPS Source Code. https://subversion.assembla.com/svn/phd-projects/gps/trunk.
20. Apache Hadoop. http://hadoop.apache.org/.
21. J. M. Hellerstein. The Declarative Imperative: Experiences and Conjectures in Distributed Logic. SIGMOD Record, 39(1), 2010.
22. S. Hong, N. C. Rodia, and K. Olukotun. On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs. Technical report, Stanford University, March 2013. http://ppl.stanford.edu/papers/techreport2013hong.pdf.
23. S. Hong, S. Salihoglu, J. Widom, and K. Olukotun. Tech Report Compiling Green-Marl into GPS. Technical report, Stanford University, October 2012. http://ppl.stanford.edu/papers/trgmgps.pdf.
24. J. R. Allwright and R. Bordawekar and P. D. Coddington and K. Dincer and C. L. Martin. A Comparison of Parallel Graph Coloring Algorithms. Technical report, Syracuse University, 1995. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4650.
25. U. Kang, C. E. Tsourakakis, and C. Faloutsos. PEGASUS: A Peta-Scale Graph Mining System-Implementation and Observations. In Proceedings of the IEEE International Conference on Data Mining, 2009.
26. R. Kannan, S. Vempala, and A. Veta. On Clusterings: Good, Bad and Spectral. In Symposium on Foundations of Computer Science, 2000.
27. D. R. Karger. Global Min-Cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. In Proceedings of the Symposium on Discrete Algorithms, 1993.
28. H. Karloff, S. Suri, and S. Vassilvitskii. A Model of Computation for MapReduce. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.
29. I. Katriel, P. Sanders, and J. L. Traeff. A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. In Proceedings of the European Symposium on Algorithms, 2003.
30. Koutris, P. and Suciu, D. Parallel Evaluation of Conjunctive Queries. In Proceedings of the ACM Symposium on Principles of Database Systems, 2011.
31. The Laboratory for Web Algorithmics. http://law.dsi.unimi.it/datasets.php.
32. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data, 1(1), 2007.
33. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15(4), 1986.
34. A. Lugowski, D. Alber, A. Buluç, J. R. Gilbert, S. Reinhardt, Y. Teng, and A. Waranis. A Flexible Open-source Toolbox for Scalable Complex Graph Analysis. In Proceedings of the SIAM Conference on Data Mining, 2012.
35. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A System for Large-Scale Graph Processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011.
36. METIS Graph Partition Library. http://exoplanet.eu/catalog.php.
37. J. Nešetřil, E. Milková, and H. Nešetřilová. "Otakar Bor̊uvka on Minimum Spanning Tree Problem Translation of Both the 1926 Papers, Comments, History". "Discrete Mathematics ", 233(1-3), 2001.
38. S. M. Orzan. On Distributed Verification and Verified Distribution. PhD thesis, Free University of Amsterdam, 2004. https://www.cs.vu.nl/en/Images/SM%20Orzan%205-11-2004tcm75-258582.pdf.
39. O. Phelan, K. McCarthy, and B. Smyth. Using Twitter to Recommend Real-time Topical News. In Proceedings of the ACM Conference on Recommender Systems, 2009.
40. R. Preis. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. In Proceedings of the Symposium On Theoretical Aspects of Computer Science, 1998.
41. L. Quick, P. Wilkinson, and D. Hardcastle. Using Pregel-like Large Scale Graph Processing Frameworks for Social Network Analysis. In Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012.
42. S. Salihoglu and J. Widom. GPS: A Graph Processing System. In Proceedings of the International Conference on Scientific and Statistical Database Management, 2013.
43. M. Sharir. A Strong-connectivity Algorithm and Its Applications in Data Flow Analysis. Computers & Mathematics with Applications, 7(1), 1981.
44. T. H. Spencer. Time-work Tradeoffs for Parallel Algorithms. Journal of the ACM, 44(5), 1997.
45. S. Vadapalli, S. R. Valluri, and K. Karlapalem. A Simple Yet Effective Data Clustering Algorithm. In Proceedings of the IEEE International Conference on Data Mining, 2006.
46. L. G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8), 1990.
47. C. Zhong, D. Miao, and R. Wang. A Graph-theoretical Clustering Method Based on Two Rounds of Minimum Spanning Trees. Pattern Recognition, 43(3), 2010.