{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:41:08Z","timestamp":1759992068113,"version":"3.44.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856649"},{"type":"electronic","value":"9783030856656"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85665-6_11","type":"book-chapter","created":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T03:06:52Z","timestamp":1630120012000},"page":"167-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures"],"prefix":"10.1007","author":[{"given":"Maria","family":"Predari","sequence":"first","affiliation":[]},{"given":"Charilaos","family":"Tzovas","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,25]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/978-3-642-32820-6_82","volume-title":"Euro-Par 2012 Parallel Processing","author":"HM Aktulga","year":"2012","unstructured":"Aktulga, H.M., Yang, C., Ng, E.G., Maris, P., Vary, J.P.: Topology-aware mappings for large-scale eigenvalue problems. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 830\u2013842. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32820-6_82"},{"issue":"7","key":"11_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3390\/a12070127","volume":"12","author":"E Angriman","year":"2019","unstructured":"Angriman, E., et al.: Guidelines for experimental algorithmics: a case study in network analysis. Algorithms 12(7), 127 (2019)","journal-title":"Algorithms"},{"issue":"5439","key":"11_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bhatel\u00e9, A., Kal\u00e9, L.V., Kumar, S.: Dynamic topology aware load balancing algorithms for molecular dynamics applications. In: Proceedings of the 23rd International Conference on Supercomputing, pp. 110\u2013116. ICS 2009. Association for Computing Machinery, New York, NY, USA (2009)","DOI":"10.1145\/1542275.1542295"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bhatel\u00e9, A., Gupta, G.R., Kal\u00e9, L.V., Chung, I.: Automated mapping of regular communication graphs on mesh interconnects. In: 2010 International Conference on High Performance Computing, pp. 1\u201310 (2010)","DOI":"10.1109\/HIPC.2010.5713190"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.compfluid.2012.01.019","volume":"80","author":"B Brandfass","year":"2013","unstructured":"Brandfass, B., Alrutz, T., Gerhold, T.: Rank reordering for MPI communication optimization. Comput. Fluids 80, 372\u2013380 (2013). https:\/\/doi.org\/10.1016\/j.compfluid.2012.01.019","journal-title":"Comput. Fluids"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Algorithm Engineering - Selected Results and Surveys. Lecture Notes in Computer Science, vol.\u00a09220, pp. 117\u2013158 (2016)","DOI":"10.1007\/978-3-319-49487-6_4"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10586-012-0229-4","volume":"15","author":"SY Chan","year":"2012","unstructured":"Chan, S.Y., Ling, T.C., Aubanel, E.: The Impact of heterogeneous multi-core clusters on graph partitioning: an empirical study. Cluster Comput. 15(3), 281\u2013302 (2012)","journal-title":"Cluster Comput."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Chen, W., Huang, J., Robert, B., Kuhn, H.: MPIPP: an automatic profile-guided parallel process placement toolset for SMP clusters and multiclusters. In: Proceedings of the 20th Annual International Conference on Supercomputing, pp. 353\u2013360. ICS 2006. Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/1183401.1183451"},{"key":"11_CR10","unstructured":"Faraj, M.F., van der Grinten, A., Meyerhenke, H., Tr\u00e4ff, J.L., Schulz, C.: High-Quality Hierarchical Process Mapping. In: 18th International Symposium on Experimental Algorithms (SEA 2020), vol. 160, pp. 4:1\u20134:15. Dagstuhl, Germany (2020)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Funke, D., Lamm, S., Sanders, P., Schulz, C., Strash, D., von Looz, M.: Communication-free massively distributed graph generation. In: 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018, May 21\u2013May 25 2018, Vancouver, BC, Canada (2018)","DOI":"10.1109\/IPDPS.2018.00043"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Glantz, R., Meyerhenke, H., Noe, A.: Algorithms for mapping parallel processes onto grid and torus architectures. In: 23rd Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2015, Turku, Finland, pp. 236\u2013243 (2015)","DOI":"10.1109\/PDP.2015.21"},{"key":"11_CR13","unstructured":"Glantz, R., Predari, M., Meyerhenke, H.: Topology-induced enhancement of mappings. CoRR abs\/1804.07131 (2018). http:\/\/arxiv.org\/abs\/1804.07131"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Hoefler, T., Snir, M.: Generic topology mapping strategies for large-scale parallel architectures. In: ACM International Conference on Supercomputing (ICS 2011), pp. 75\u201385. ACM (2011)","DOI":"10.1145\/1995896.1995909"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hoefler, T., Jeannot, E., Mercier, G.: An overview of process mapping techniques and algorithms in high-performance computing. In: High Performance Computing on Complex Environments, pp. 75\u201394. Wiley, June 2014","DOI":"10.1002\/9781118711897.ch5"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Jeannot, E., Mercier, G., Tessier, F.: Process placement in multicore clusters: algorithmic issues and practical techniques. IEEE Trans. Parallel Distrib. Syst. (99), p. 1 (2013). https:\/\/doi.org\/10.1109\/TPDS.2013.104","DOI":"10.1109\/TPDS.2013.104"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TPDS.2013.104","volume":"25","author":"E Jeannot","year":"2014","unstructured":"Jeannot, E., Mercier, G., Tessier, F.: Process placement in multicore clusters: algorithmic issues and practical techniques. IEEE Trans. Parallel Distrib. Syst. 25(4), 993\u20131002 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Gupta, R., Bhuyan, L.N.: Scalable SIMD-efficient graph processing on GPUs. In: Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques, pp. 39\u201350. PACT 2015 (2015)","DOI":"10.1109\/PACT.2015.15"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3409667","volume":"25","author":"KV Kirchbach","year":"2020","unstructured":"Kirchbach, K.V., Schulz, C., Tr\u00e4ff, J.L.: Better process mapping and sparse quadratic assignment. ACM J. Exp. Algorithmics 25, 1\u201319 (2020)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1","key":"11_CR20","first-page":"91","volume":"31","author":"S Kirmani","year":"2017","unstructured":"Kirmani, S., Park, J., Raghavan, P.: An embedded sectioning scheme for multiprocessor topology-aware mapping of irregular applications. IJHPCA 31(1), 91\u2013103 (2017)","journal-title":"IJHPCA"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 163\u2013170. STOC 2000. Association for Computing Machinery, New York, NY, USA (2000)","DOI":"10.1145\/335305.335325"},{"key":"11_CR22","unstructured":"Leskovec, J.: Stanford Network Analysis Package (SNAP). http:\/\/snap.stanford.edu\/index.html"},{"issue":"8","key":"11_CR23","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"11_CR24","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1109\/TPDS.2017.2671868","volume":"28","author":"H Meyerhenke","year":"2017","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Parallel graph partitioning for complex networks. IEEE Trans. Parallel Distributed Syst. 28(9), 2625\u20132638 (2017)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: Static mapping by dual recursive bipartitioning of process and architecture graphs. In: Scalable High-Performance Computing Conference (SHPCC), pp. 486\u2013493. IEEE, May 1994","DOI":"10.1109\/SHPCC.1994.296682"},{"key":"11_CR26","unstructured":"Pellegrini, F.: Scotch and libscotch 5.0 user\u2019s guide. Technical report, LaBRI, Universit\u00e9 Bordeaux I, December 2007"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: Static mapping of process graphs. In: Graph Partitioning, chap. 5, pp. 115\u2013136. John Wiley & Sons (2011)","DOI":"10.1002\/9781118601181.ch5"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: Scotch and PT-scotch graph partitioning software: an overview. In: Naumann, U., Schenk, O. (eds.) Combinatorial Scientific Computing, pp. 373\u2013406. CRC Press (2012)","DOI":"10.1201\/b11644-15"},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Salihoglu, S., Widom, J.: GPS: a graph processing system. In: Scientific and Statistical Database Management. Stanford InfoLab, July 2013","DOI":"10.1145\/2484838.2484843"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. In: Proceedings of the Meeting on Algorithm Engineering and Expermiments, pp. 16\u201329. ALENEX 2012, Society for Industrial and Applied Mathematics, USA (2012)","DOI":"10.1137\/1.9781611972924.2"},{"key":"11_CR32","unstructured":"Sanders, P., Schulz, C.: Kahip v0.53 - karlsruhe high quality partitioning - user guide. CoRR abs\/1311.1714 (2013)"},{"issue":"3","key":"11_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/cpe.605","volume":"14","author":"K Schloegel","year":"2002","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Parallel static and dynamic multi-constraint graph partitioning. Concurrency Comput. Pract. Experience 14(3), 219\u2013240 (2002)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Rajamanickam, S., Devine, K., Madduri, K.: Partitioning trillion-edge graphs in minutes. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 646\u2013655 (2017)","DOI":"10.1109\/IPDPS.2017.95"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Lee, S.-Y., Aggarwal: A mapping strategy for parallel processing. IEEE Trans. Comput. C-36(4), 433\u2013442 (1987)","DOI":"10.1109\/TC.1987.1676925"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Walshaw, C., Cross, M.: JOSTLE: parallel multilevel graph-partitioning software - an overview. In: Magoules, F. (ed.) Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27\u201358. Civil-Comp Ltd. (2007). (Invited chapter)","DOI":"10.4203\/csets.17.2"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2021: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85665-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:02:26Z","timestamp":1756332146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85665-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856649","9783030856656"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85665-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}