Graph partitioning algorithms for minimizing inter-node communication on a distributed system

iii Acknowledgements v

[1]  Rishan Chen,et al.  Improving large graph processing on partitioned graphs in the cloud , 2012, SoCC '12.

[2]  B. Rosner,et al.  Use of the Mann-Whitney U-test for clustered data. , 1999, Statistics in medicine.

[3]  Masaru Kitsuregawa,et al.  Efficient breadth-first search on large graphs with skewed degree distributions , 2013, EDBT '13.

[4]  Kurt Mehlhorn,et al.  External-Memory Breadth-First Search with Sublinear I/O , 2002, ESA.

[5]  Sandeep Koranne.  A distributed algorithm for k-way graph partitioning , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[6]  Shin Gyu Kim,et al.  Large Graph Processing Based on Remote Memory System , 2010, 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC).

[7]  Yinglong Xia.  TOPOLOGICALLY ADAPTIVE PARALLEL BREADTH-FIRST SEARCH ON MULTICORE PROCESSORS , 2010 .

[8]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[9]  David A. Bader,et al.  Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[10]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[11]  Sahar Idwan,et al.  Computing Breadth First Search in Large Graph Using hMetis Partitioning , 2009 .

[12]  Ulrich Meyer.  External memory BFS on undirected graphs with bounded degree , 2001, SODA '01.

[13]  Patrick Valduriez,et al.  Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel Systems , 2010, WAIM Workshops.

[14]  Charalampos E. Tsourakakis,et al.  HADI : Fast Diameter Estimation and Mining in Massive Graphs with Hadoop , 2008 .

[15]  Eric A. Hansen,et al.  A Breadth-First Approach to Memory-Efficient Graph Search , 2006, AAAI.

[16]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[17]  Jennifer Widom,et al.  GPS: a graph processing system , 2013, SSDBM.

[18]  Yong-Hyuk Kim,et al.  Genetic approaches for graph partitioning: a survey , 2011, GECCO '11.

[19]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[20]  Eric A. Hansen,et al.  Breadth-first heuristic search , 2004, Artif. Intell..

[21]  David A. Patterson,et al.  Direction-optimizing breadth-first search , 2012, HiPC 2012.

[22]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[23]  Gabriel Kliot,et al.  Streaming graph partitioning for large distributed graphs , 2012, KDD.

[24]  Ž. Milenović.  APPLICATION OF MANN-WHITNEY U TEST IN RESEARCH OF PROFESSIONAL TRAINING OF PRIMARY SCHOOL TEACHERS , 2011 .

[25]  Jinyang Li,et al.  Piccolo: Building Fast, Distributed Programs with Partitioned Tables , 2010, OSDI.

[26]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[27]  Peter Sanders,et al.  High quality graph partitioning , 2012, Graph Partitioning and Graph Clustering.

[28]  Edmond Chow,et al.  Distributed Breadth-First Search with 2-D Partitioning , 2005 .

[29]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[30]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[31]  Ulrich Meyer,et al.  Improved External Memory BFS Implementation , 2007, ALENEX.

[32]  Christos Faloutsos,et al.  PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[33]  Scott Shenker,et al.  Spark: Cluster Computing with Working Sets , 2010, HotCloud.

[34]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[35]  Yanfeng Zhang,et al.  PrIter: A Distributed Framework for Prioritizing Iterative Computations , 2011, IEEE Transactions on Parallel and Distributed Systems.

[36]  Michael D. Ernst,et al.  HaLoop , 2010, Proc. VLDB Endow..

[37]  Douglas Stott Parker,et al.  Map-reduce-merge: simplified relational data processing on large clusters , 2007, SIGMOD '07.

[38]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[39]  Haoxiang Lin,et al.  G2: A Graph Processing System for Diagnosing Distributed Systems , 2011, USENIX Annual Technical Conference.

[40]  Jean Roman,et al.  SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs , 1996, HPCN Europe.

[41]  Yousef Saad,et al.  Heuristic Algorithms for Automatic Graph Partitioning , 1995 .

[42]  José Rui Figueira,et al.  Graph partitioning by multi-objective real-valued metaheuristics: A comparative study , 2011, Appl. Soft Comput..

[43]  Jian Li,et al.  Cost-Conscious Scheduling for Large Graph Processing in the Cloud , 2011, 2011 IEEE International Conference on High Performance Computing and Communications.

[44]  Ulrich Meyer,et al.  Design, Implementation and Experimental Study of External Memory BFS Algorithms , 2005 .

[45]  Bo Zong,et al.  Towards effective partition management for large graphs , 2012, SIGMOD Conference.

[46]  Kamesh Madduri,et al.  Parallel breadth-first search on distributed memory systems , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[47]  Yanfeng Zhang,et al.  PrIter: A Distributed Framework for Prioritizing Iterative Computations , 2011, IEEE Transactions on Parallel and Distributed Systems.

[48]  Pablo Rodriguez,et al.  The little engine(s) that could: scaling online social networks , 2012, TNET.

[49]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[50]  Richard E. Korf,et al.  Large-Scale Parallel Breadth-First Search , 2005, AAAI.

[51]  Haixun Wang,et al.  The Trinity Graph Engine , 2012 .