{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T17:47:12Z","timestamp":1724867232171},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11227-023-05492-w","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T08:02:41Z","timestamp":1687161761000},"page":"21116-21143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["iPartition: a distributed partitioning algorithm for block-centric graph processing systems"],"prefix":"10.1007","volume":"79","author":[{"given":"Masoud","family":"Sagharichian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Alipour Langouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,19]]},"reference":[{"key":"5492_CR1","volume-title":"Social and economic networks","author":"MO Jackson","year":"2014","unstructured":"Jackson MO (2014) Social and economic networks. Princeton University Press, Jackson, MO"},{"issue":"4","key":"5492_CR2","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s10766-018-0559-9","volume":"47","author":"D Li","year":"2019","unstructured":"Li D, Chen Z, Liu J (2019) Analysis for behavioral economics in social networks: an altruism-based dynamic cooperation model. Int J Parallel Prog 47(4):686\u2013708","journal-title":"Int J Parallel Prog"},{"key":"5492_CR3","unstructured":"Varanka D (2019) Integrating the sociology of space with geospatial semantic relation properties for data graphs"},{"issue":"3","key":"5492_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1631\/FITEE.1900127","volume":"21","author":"N Liu","year":"2020","unstructured":"Liu N et al (2020) Large-scale graph processing systems: a survey. Front Inf Technol Electron Eng 21(3):384\u2013404","journal-title":"Front Inf Technol Electron Eng"},{"issue":"2","key":"5492_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00778-019-00548-x","volume":"29","author":"S Sahu","year":"2020","unstructured":"Sahu S et al (2020) The ubiquity of large graphs and surprising challenges of graph processing: extended survey. VLDB J 29(2):595\u2013618","journal-title":"VLDB J"},{"key":"5492_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811395","volume-title":"Models and methods in social network analysis","author":"PJ Carrington","year":"2005","unstructured":"Carrington PJ, Scott J, Wasserman S (2005) Models and methods in social network analysis, vol 28. Cambridge University Press, Cambridge"},{"key":"5492_CR7","doi-asserted-by":"crossref","unstructured":"Malewicz G et al (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","DOI":"10.1145\/1807167.1807184"},{"issue":"17","key":"5492_CR8","doi-asserted-by":"publisher","first-page":"4954","DOI":"10.1002\/cpe.3482","volume":"27","author":"M Sagharichian","year":"2015","unstructured":"Sagharichian M, Naderi H, Haghjoo M (2015) ExPregel: a new computational model for large-scale graph processing. Concurr Comput Pract Exp 27(17):4954\u20134969","journal-title":"Concurr Comput Pract Exp"},{"issue":"14","key":"5492_CR9","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan D et al (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. Proc VLDB Endow 7(14):1981\u20131992","journal-title":"Proc VLDB Endow"},{"key":"5492_CR10","doi-asserted-by":"crossref","unstructured":"Salihoglu S, Widom J (2013) Gps: a graph processing system. In: Proceedings of the 25th International Conference on Scientific and Statistical Database Management","DOI":"10.1145\/2484838.2484843"},{"key":"5492_CR11","unstructured":"Gonzalez JE et al. (2014) Graphx: graph processing in a distributed dataflow framework. In: 11th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 14)"},{"issue":"2","key":"5492_CR12","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10619-019-07276-9","volume":"38","author":"HWY Adoni","year":"2020","unstructured":"Adoni HWY et al (2020) A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems. Distrib Parallel Databases 38(2):495\u2013530","journal-title":"Distrib Parallel Databases"},{"key":"5492_CR13","unstructured":"Sakouhi C, Khaldi A, Ghezal HB (2018) An overview of recent graph partitioning algorithms. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA). The Steering Committee of the World Congress in Computer Science, Computer"},{"issue":"1","key":"5492_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka M, Fujimori T, Shiokawa H (2017) Graph partitioning for distributed graph processing. Data Sci Eng 2(1):94\u2013105","journal-title":"Data Sci Eng"},{"issue":"4","key":"5492_CR15","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1007\/s11227-016-1834-4","volume":"73","author":"M Sagharichian","year":"2017","unstructured":"Sagharichian M, Naderi H (2017) Intelligent and independent processes for overcoming big graphs. J Supercomput 73(4):1438\u20131466","journal-title":"J Supercomput"},{"key":"5492_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.procs.2011.04.032","volume":"4","author":"T Panitanarak","year":"2011","unstructured":"Panitanarak T, Shontz SM (2011) Mdec: metis-based domain decomposition for parallel 2d mesh generation. Procedia Comput Sci 4:302\u2013311","journal-title":"Procedia Comput Sci"},{"key":"5492_CR17","unstructured":"Karypis G (1997) METIS: unstructured graph partitioning and sparse matrix ordering system. Technical report"},{"key":"5492_CR18","doi-asserted-by":"crossref","unstructured":"Sui X et al (2010) Parallel graph partitioning on multicore architectures. In: International Workshop on Languages and Compilers for Parallel Computing. Springer","DOI":"10.1007\/978-3-642-19595-2_17"},{"key":"5492_CR19","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K, Rajamanickam S (2014) PuLP: scalable multi-objective multi-constraint partitioning for small-world networks. In: 2014 IEEE International Conference on Big Data (Big Data). IEEE","DOI":"10.1109\/BigData.2014.7004265"},{"key":"5492_CR20","doi-asserted-by":"crossref","unstructured":"Tsourakakis C et al (2014) Fennel: streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining","DOI":"10.1145\/2556195.2556213"},{"key":"5492_CR21","doi-asserted-by":"crossref","unstructured":"Hanai M et al. (2019) Distributed edge partitioning for trillion-edge graphs. arXiv preprint arXiv:1908.05855","DOI":"10.14778\/3358701.3358706"},{"key":"5492_CR22","doi-asserted-by":"crossref","unstructured":"Guerrieri A, Montresor A (2015) Dfep: distributed funding-based edge partitioning. In: Euro-Par 2015: Parallel Processing: 21st International Conference on Parallel and Distributed Computing, Vienna, Austria, August 24\u201328, 2015, Proceedings 21. Springer","DOI":"10.1007\/978-3-662-48096-0_27"},{"issue":"3","key":"5492_CR23","first-page":"1","volume":"5","author":"R Chen","year":"2019","unstructured":"Chen R et al (2019) Powerlyra: differentiated graph computation and partitioning on skewed graphs. ACM Trans Parallel Comput (TOPC) 5(3):1\u201339","journal-title":"ACM Trans Parallel Comput (TOPC)"},{"key":"5492_CR24","unstructured":"Zhang Y, Wang Q, Gong S (2021) Distributed graph processing: techniques and systems. In: Web and Big Data. APWeb-WAIM 2020 International Workshops: KGMA 2020, SemiBDMA 2020, DeepLUDA 2020, Tianjin, China, September 18\u201320, 2020, Revised Selected Papers 4. Springer"},{"key":"5492_CR25","doi-asserted-by":"publisher","first-page":"118523","DOI":"10.1109\/ACCESS.2022.3219422","volume":"10","author":"TA Ayall","year":"2022","unstructured":"Ayall TA et al (2022) Graph computing systems and partitioning techniques: a survey. IEEE Access 10:118523\u2013118550","journal-title":"IEEE Access"},{"key":"5492_CR26","doi-asserted-by":"crossref","unstructured":"Mayer R, Orujzade K, Jacobsen H-A (2022) Out-of-core edge partitioning at linear run-time. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE","DOI":"10.1109\/ICDE53745.2022.00242"},{"key":"5492_CR27","doi-asserted-by":"crossref","unstructured":"Ayall T et al (2021) Taking heuristic based graph edge partitioning one step ahead via OffStream partitioning approach. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE","DOI":"10.1109\/ICDE51399.2021.00204"},{"key":"5492_CR28","doi-asserted-by":"crossref","unstructured":"Mayer R, Jacobsen H-A (2021) Hybrid edge partitioner: partitioning large power-law graphs under memory constraints. In: Proceedings of the 2021 International Conference on Management of Data","DOI":"10.1145\/3448016.3457300"},{"key":"5492_CR29","doi-asserted-by":"crossref","unstructured":"Kong D, Xie X, Zhang Z (2022) Clustering-based partitioning for large web graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE","DOI":"10.1109\/ICDE53745.2022.00049"},{"key":"5492_CR30","doi-asserted-by":"crossref","unstructured":"Low Y et al. (2012) Distributed graphlab: a framework for machine learning in the cloud. arXiv preprint arXiv:1204.6078","DOI":"10.14778\/2212351.2212354"},{"key":"5492_CR31","unstructured":"Gonzalez JE et al (2012) {PowerGraph}: distributed {Graph-Parallel} computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)"},{"issue":"3","key":"5492_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y et al (2013) From\" think like a vertex\" to\" think like a graph\". Proc VLDB Endow 7(3):193\u2013204","journal-title":"Proc VLDB Endow"},{"issue":"12","key":"5492_CR33","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.14778\/3137765.3137801","volume":"10","author":"W Fan","year":"2017","unstructured":"Fan W et al (2017) GRAPE: parallelizing sequential graph computations. Proc VLDB Endow 10(12):1889\u20131892","journal-title":"Proc VLDB Endow"},{"key":"5492_CR34","doi-asserted-by":"crossref","unstructured":"Dindokar R, Choudhury N, Simmhan Y (2016) A meta-graph approach to analyze subgraph-centric distributed programming models. In: 2016 IEEE International Conference on Big Data (Big Data). IEEE","DOI":"10.1109\/BigData.2016.7840587"},{"key":"5492_CR35","doi-asserted-by":"crossref","unstructured":"Verma S (2017) An experimental comparison of partitioning strategies in distributed graph processing","DOI":"10.14778\/3055540.3055543"},{"issue":"5","key":"5492_CR36","first-page":"177","volume":"7","author":"Y Kim","year":"2018","unstructured":"Kim Y, Bae M, Oh S (2018) Dynamic block reassignment for load balancing of block centric graph processing systems. KIPS Trans Softw Data Eng 7(5):177\u2013188","journal-title":"KIPS Trans Softw Data Eng"},{"key":"5492_CR37","unstructured":"Wen X, Zhang S, You H (2018) DRONE: a distributed subgraph-centric framework for processing large scale power-law graphs. arXiv preprint arXiv:1812.04380"},{"key":"5492_CR38","doi-asserted-by":"crossref","unstructured":"Zhang S et al (2021) An efficient and balanced graph partition algorithm for the subgraph-centric programming model on large-scale power-law graphs. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS). IEEE","DOI":"10.1109\/ICDCS51616.2021.00016"},{"issue":"2","key":"5492_CR39","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11280-016-0394-0","volume":"20","author":"M Sagharichian","year":"2017","unstructured":"Sagharichian M, Langouri MA, Naderi H (2017) A fast method to exactly calculate the diameter of incremental disconnected graphs. World Wide Web 20(2):399\u2013416","journal-title":"World Wide Web"},{"key":"5492_CR40","volume-title":"Hadoop in action","author":"C Lam","year":"2010","unstructured":"Lam C (2010) Hadoop in action. Simon and Schuster, New York"},{"issue":"1","key":"5492_CR41","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"5492_CR42","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick R, Wayne K (2011) Algorithms, 4th edn. Addison-Wesley Professional, Boston","edition":"4"},{"issue":"1","key":"5492_CR43","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"14","key":"5492_CR44","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.14778\/2556549.2556581","volume":"6","author":"W Xie","year":"2013","unstructured":"Xie W et al (2013) Fast iterative graph computation with block updates. Proc VLDB Endow 6(14):2014\u20132025","journal-title":"Proc VLDB Endow"},{"key":"5492_CR45","unstructured":"Leskovec J, Krevl A (2014)SNAP datasets: Stanford large network dataset collection. Ann Arbor, MI, USA"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05492-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05492-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05492-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:10:34Z","timestamp":1697836234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05492-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,19]]},"references-count":45,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["5492"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05492-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,19]]},"assertion":[{"value":"6 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declares that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with animals or involving human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}