J. Sahariar-firoz, T. Amila-kanewala, M. Zalewski, M. Barnas, and A. Lumsdaine, The anatomy of large-scale distributed graph algorithms

E. Joseph, Y. Gonzalez, H. Low, D. Gu, C. Bickson et al., Powergraph: Distributed graph-parallel computation on natural graphs, Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12). 2012, pp.17-30

A. Lada, . Adamic, M. Rajan, . Lukose, R. Amit et al., Search in power-law networks, Physical review E, p.46135, 2001.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, ACM SIGCOMM Computer Communication Review, vol.29, issue.4, pp.251-262, 1999.
DOI : 10.1145/316194.316229

F. Bourse, M. Lelarge, and M. Vojnovic, Balanced graph edge partition, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.1456-1465, 2014.
DOI : 10.1145/2623330.2623660
URL : https://hal.archives-ouvertes.fr/hal-01090593

R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica, GraphX, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13
DOI : 10.1145/2484425.2484427

R. Kannan, S. Vempala, and A. Vetta, On clusterings, Journal of the ACM, vol.51, issue.3, pp.497-515, 2004.
DOI : 10.1145/990308.990313

G. William-flake, E. Robert, K. Tarjan, and . Tsioutsiouliklis, Graph Clustering and Minimum Cut Trees, Internet Mathematics, vol.1, issue.4, pp.385-408, 2004.
DOI : 10.1080/15427951.2004.10129093

M. Kim and K. Selçuk-candan, SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices, Data & Knowledge Engineering, vol.72, issue.12, pp.285-303, 2012.
DOI : 10.1016/j.datak.2011.11.004

G. Malewicz, H. Matthew, . Austern, J. Aart, . Bik et al., Pregel: a system for large-scale graph processing, Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp.135-146, 2010.

M. Zaharia, M. Chowdhury, J. Michael, S. Franklin, I. Shenker et al., Spark: cluster computing with working sets, pp.10-10, 2010.

M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma et al., Resilient Distributed Datasets, Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, p.2012
DOI : 10.1145/2886107.2886110

V. Kumar-vavilapalli, C. Arun, C. Murthy, S. Douglas, M. Agarwal et al., Apache Hadoop YARN, Proceedings of the 4th annual Symposium on Cloud Computing, SOCC '13, pp.5-14, 2013.
DOI : 10.1145/2523616.2523633

R. Lineage, https://jaceklaskowski.gitbooks.io/mastering-apachespark/content/spark-rdd-lineage .html (cit, p.14

G. Leslie and . Valiant, A bridging model for parallel computation, Communications of the ACM, vol.338, pp.103-111, 1990.

M. Herlihy and N. Shavit, The art of multiprocessor programming, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2011.
DOI : 10.1145/1146381.1146382

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: bringing order to the web, 1999.

Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola et al., Distributed GraphLab, Proceedings of the VLDB Endowment, pp.716-727, 2012.
DOI : 10.14778/2212351.2212354

C. Avery, Giraph: Large-scale graph processing infrastructure on hadoop, Proceedings of the Hadoop Summit, p.31, 2011.

Y. Tian, A. Balmin, S. Severin-andreas-corsten, J. Tatikonda, and . Mcpherson, From "think like a vertex" to "think like a graph", Proceedings of the VLDB Endowment, pp.193-204, 2013.
DOI : 10.14778/2732232.2732238
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.1380

N. Doekemeijer and A. L. Varbanescu, A survey of parallel graph processing frameworks, 2014.

A. Bialecki, M. Cafarella, D. Cutting, and O. Malley, Hadoop: a framework for running applications on large clusters built of commodity hardware, p.37, 2005.

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

K. Shvachko, H. Kuang, S. Radia, and R. Chansler, The Hadoop Distributed File System, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pp.1-10, 2010.
DOI : 10.1109/MSST.2010.5496972

R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez et al., Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, The International Journal of High Performance Computing Applications, vol.2, issue.2, pp.481-494, 2006.
DOI : 10.1145/1060289.1060313
URL : https://hal.archives-ouvertes.fr/hal-00684943

B. Metal, http://searchservervirtualization.techtarget. com/definition/bare-metal-environment (cit, p.27

R. Chen, J. Shi, Y. Chen, and H. Chen, PowerLyra, Proceedings of the Tenth European Conference on Computer Systems, EuroSys '15, pp.38-52
DOI : 10.1109/SC.2005.4

N. Jain, G. Liao, L. Theodore, and . Willke, GraphBuilder, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, pp.34-35
DOI : 10.1145/2484425.2484429

G. Karypis and V. Kumar, METIS?unstructured graph partitioning and sparse matrix ordering system, version 2, p.31, 1995.

A. Guerrieri and A. Montresor, DFEP: Distributed Funding-Based Edge Partitioning, European Conference on Parallel Processing, pp.346-358, 2015.
DOI : 10.1007/978-3-662-48096-0_27

F. Rahimian, H. Amir, S. Payberah, S. Girdzijauskas, and . Haridi, Distributed Vertex-Cut Partitioning, 4th International Conference on Distributed Applications and Interoperable Systems (DAIS). Vol. LNCS- 8460, pp.186-200
DOI : 10.1016/j.datak.2011.11.004
URL : https://hal.archives-ouvertes.fr/hal-01287742

R. Chen, J. Shi, H. Chen, and B. Zang, Bipartite-oriented distributed graph partitioning for big learning, Journal of Computer Science and Technology, vol.301, pp.20-29, 2015.
DOI : 10.1145/2637166.2637236

A. Clauset, C. R. Shalizi, E. Mark, and . Newman, Power-Law Distributions in Empirical Data, SIAM review 51, pp.661-703, 2009.
DOI : 10.1137/070710111
URL : http://arxiv.org/pdf/0706.1062

F. Rahimian, H. Amir, S. Payberah, M. Girdzijauskas, S. Jelasity et al., JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning, 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems, 2013.
DOI : 10.1109/SASO.2013.13
URL : http://publicatio.bibl.u-szeged.hu/3304/1/saso13.pdf

H. Mykhailenko, G. Neglia, and F. Huet, Which metrics for vertex-cut partitioning?, 2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), 2016.
DOI : 10.1109/ICITST.2016.7856670
URL : https://hal.archives-ouvertes.fr/hal-01401309

P. Erdös and A. Rényi, On random graphs, I ", In: Publicationes Mathematicae (Debrecen), vol.6, pp.290-297, 1959.

G. James, D. Witten, T. Hastie, and R. Tibshirani, An introduction to statistical learning, pp.49-51, 2013.
DOI : 10.1007/978-1-4614-7138-7

H. Akaike, Akaike???s Information Criterion, pp.25-25, 2011.
DOI : 10.1007/978-3-642-04898-2_110

R. Hood, H. Jin, P. Mehrotra, J. Chang, J. Djomehri et al., Performance impact of resource contention in multicore systems, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2010.
DOI : 10.1109/IPDPS.2010.5470399

S. Kirkpatrick, M. P. Daniel-gelatt, and . Vecchi, Optimization by simulated annealing, pp.4598-671, 1983.
DOI : 10.1142/9789812799371_0035
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7607

A. Terenin, D. Simpson, and D. Draper, Asynchronous Gibbs Sampling, pp.79-81, 2015.

H. Mykhailenko, G. Neglia, and F. Huet, Simulated Annealing for Edge Partitioning, DCPerf 2017: Big Data and Cloud Performance Workshop at INFOCOM 2017, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01446677

P. Brémaud, Markov chains: Gibbs fields, Monte Carlo simulation, and queues, p.67, 2013.
DOI : 10.1007/978-1-4757-3124-8

X. Feng, A. Kumar, B. Recht, and C. Ré, Towards a unified architecture for in-RDBMS analytics, Proceedings of the 2012 international conference on Management of Data, SIGMOD '12, pp.325-336
DOI : 10.1145/2213836.2213874