{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T01:23:37Z","timestamp":1746667417190,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10766-023-00753-w","type":"journal-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T08:02:49Z","timestamp":1683273769000},"page":"231-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning-Aware Performance Modeling of Distributed Graph Processing Tasks"],"prefix":"10.1007","volume":"51","author":[{"given":"Daniel","family":"Presser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Siqueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,5]]},"reference":[{"issue":"6","key":"753_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"753_CR2","unstructured":"Avery, C.: Giraph: Large-scale graph processing infrastructure on Hadoop. In: Proceedings of Hadoop Summit (2011)"},{"key":"753_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the 13th International World Wide Web Conference, pp. 595\u2013601. Manhattan, USA (2004)","DOI":"10.1145\/988672.988752"},{"issue":"2","key":"753_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"753_CR5","doi-asserted-by":"crossref","unstructured":"Cordeiro, M., Sarmento, R.P., Brazdil, P., Gama, J.: Evolving networks and social network analysis methods and techniques. In: Social Media and Journalism-Trends, Connections, Implications. IntechOpen (2018)","DOI":"10.5772\/intechopen.79041"},{"key":"753_CR6","doi-asserted-by":"crossref","unstructured":"Danilevsky, M., Koh, E.: Information graph model and application to online advertising. In: Proceedings of the 1st Workshop on User Engagement Optimization, pp. 11\u201314. ACM (2013)","DOI":"10.1145\/2512875.2512878"},{"issue":"1","key":"753_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"753_CR8","unstructured":"Fernandes, K., Melhem, R., Hammoud, M.: Investigating and modeling performance scalability for distributed graph analytics. In: 2018 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), IEEE, pp. 34\u20133, (2018)"},{"issue":"1","key":"753_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/3140565","volume":"1","author":"K Garimella","year":"2018","unstructured":"Garimella, K., Morales, G.D.F., Gionis, A., Mathioudakis, M.: Quantifying controversy on social media. ACM Trans. Social Comput. 1(1), 3 (2018)","journal-title":"ACM Trans. Social Comput."},{"key":"753_CR10","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th Symposium on Operating System Design and Implementation (2012)"},{"issue":"12","key":"753_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.14778\/2732977.2732980","volume":"7","author":"M Han","year":"2014","unstructured":"Han, M., Daudjee, K., Ammar, K., \u00d6zsu, M.T., Wang, X., Jin, T.: An experimental comparison of Pregel-like graph processing systems. Proc. VLDB Endow. 7(12), 1047\u201358 (2014). https:\/\/doi.org\/10.14778\/2732977.2732980","journal-title":"Proc. VLDB Endow."},{"key":"753_CR12","doi-asserted-by":"crossref","unstructured":"Joaquim, P., Bravo, M., Rodrigues, L., Matos, M.: Hourglass: leveraging transient resources for time-constrained graph processing in the cloud. In: Proceedings of the Fourteenth EuroSys Conference 2019, ACM, p.\u00a035, (2019)","DOI":"10.1145\/3302424.3303964"},{"key":"753_CR13","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: ICPP (3), pp. 113\u2013122 (1995)","DOI":"10.1145\/224170.224229"},{"issue":"2","key":"753_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TPDS.2015.2405552","volume":"27","author":"M Khan","year":"2016","unstructured":"Khan, M., Jin, Y., Li, M., Xiang, Y., Jiang, C.: Hadoop performance modeling for job estimation and resource provisioning. IEEE Trans. Parallel Distrib. Syst. 27(2), 441\u2013454 (2016). https:\/\/doi.org\/10.1109\/TPDS.2015.2405552","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"753_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, D., Raj, A., Dharanipragada, J.: Graphsteal: Dynamic re-partitioning for efficient graph processing in heterogeneous clusters. In: Cloud Computing (CLOUD), 2017 IEEE 10th International Conference on, pp. 439\u2013446. IEEE (2017)","DOI":"10.1109\/CLOUD.2017.63"},{"key":"753_CR16","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014)"},{"key":"753_CR17","doi-asserted-by":"crossref","unstructured":"Li, Z., Zhang, B., Ren, S., Liu, Y., Qin, Z., Goh, R.S.M., Gurusamy, M.: Performance modelling and cost effective execution for distributed graph processing on configurable VMs. Proceedings of the 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing pp. 74\u201383 (2017)","DOI":"10.1109\/CCGRID.2017.85"},{"issue":"01","key":"753_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.: Challenges in parallel graph processing. Parallel Process. Lett. 17(01), 5\u201320 (2007)","journal-title":"Parallel Process. Lett."},{"key":"753_CR19","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"753_CR20","volume-title":"The pagerank citation ranking: bringing order to the web","author":"L Page","year":"1999","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Tech. rep, Stanford InfoLab (1999)"},{"key":"753_CR21","doi-asserted-by":"crossref","unstructured":"Presser, D., Siqueira, F., Reina, F.: Performance modeling and task scheduling in distributed graph processing. In: 2018 IEEE International Congress on Big Data (BigData Congress), pp. 135\u2013142. IEEE (2018)","DOI":"10.1109\/BigDataCongress.2018.00025"},{"key":"753_CR22","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). URL http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"753_CR23","unstructured":"Rule Quest Research: Data mining with cubist (2020). URL https:\/\/www.rulequest.com\/cubist-info.html"},{"key":"753_CR24","doi-asserted-by":"crossref","unstructured":"Salihoglu, S., Widom, J.: GPS: A graph processing system. In: Proceedings of the 25th International Conference on Scientific and Statistical Database Management (2013)","DOI":"10.1145\/2484838.2484843"},{"key":"753_CR25","doi-asserted-by":"crossref","unstructured":"Seo, S., Yoon, E.J., Kim, J., Jin, S., Kim, J.S., Maeng, S.: Hama: An efficient matrix computation with the mapreduce framework. In: Proceedings of the 2nd IEEE International Conference on Cloud Computing Technology and Science, pp. 721\u2013726 (2010)","DOI":"10.1109\/CloudCom.2010.17"},{"key":"753_CR26","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: Fennel: Streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM international conference on Web search and data mining, pp. 333\u2013342. ACM (2014)","DOI":"10.1145\/2556195.2556213"},{"key":"753_CR27","doi-asserted-by":"publisher","unstructured":"Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms scheduling parallelizable tasks. In: Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (1992). https:\/\/doi.org\/10.1145\/140901.141909","DOI":"10.1145\/140901.141909"},{"issue":"8","key":"753_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"753_CR29","unstructured":"Webber, J.: Real-time fraud detection with graphs (2016). URL https:\/\/www.infoq.com\/presentations\/graph-fraud-detection"},{"key":"753_CR30","volume-title":"Hadoop: The definitive guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop: The definitive guide. O\u2019Reilly Media, Inc., USA (2012)"},{"key":"753_CR31","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: A resilient distributed graph system on spark. In: Proceedings of the 1st International Workshop on Graph Data Management Experiences and Systems (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"753_CR32","doi-asserted-by":"crossref","unstructured":"Xue, J., Yang, Z., Hou, S., Dai, Y.: When computing meets heterogeneous cluster: Workload assignment in graph computation. In: Big Data (Big Data), 2015 IEEE International Conference on, IEEE, pp. 154\u2013163, (2015)","DOI":"10.1109\/BigData.2015.7363752"},{"key":"753_CR33","doi-asserted-by":"crossref","unstructured":"Yalavarthi, V.K., Khan, A.: Steering top-k influencers in dynamic graphs via local updates. In: 2018 IEEE International Conference on Big Data (Big Data), IEEE, pp. 576\u2013583, (2018)","DOI":"10.1109\/BigData.2018.8621873"},{"issue":"11","key":"753_CR34","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2934664","volume":"59","author":"M Zaharia","year":"2016","unstructured":"Zaharia, M., Xin, R.S., Wendell, P., Das, T., Armbrust, M., Dave, A., Meng, X., Rosen, J., Venkataraman, S., Franklin, M.J., et al.: Apache Spark: A unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-023-00753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-023-00753-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-023-00753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T17:48:36Z","timestamp":1690393716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-023-00753-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,5]]},"references-count":34,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["753"],"URL":"https:\/\/doi.org\/10.1007\/s10766-023-00753-w","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2023,5,5]]},"assertion":[{"value":"21 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}