{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:28:00Z","timestamp":1756384080246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225117","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Topology-induced Enhancement of Mappings"],"prefix":"10.1145","author":[{"given":"Roland","family":"Glantz","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Maria","family":"Predari","sequence":"additional","affiliation":[{"name":"University of Cologne, Cologne, Germany"}]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[{"name":"University of Cologne, Cologne, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"volume-title":"Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications, Emmanuel Udoh and Frank Zhigang Wang (Eds.). Information Science Reference - Imprint of","author":"Aubanel Eric","key":"e_1_3_2_1_1_1","unstructured":"Eric Aubanel . 2009. Resource-Aware Load Balancing of Parallel Applications . In Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications, Emmanuel Udoh and Frank Zhigang Wang (Eds.). Information Science Reference - Imprint of : IGI Publishing , 12--21. Eric Aubanel. 2009. Resource-Aware Load Balancing of Parallel Applications. In Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications, Emmanuel Udoh and Frank Zhigang Wang (Eds.). Information Science Reference - Imprint of: IGI Publishing, 12--21."},{"key":"e_1_3_2_1_2_1","unstructured":"C. Bichot and P. Siarry (Eds.). 2011. Graph Partitioning. Wiley.  C. Bichot and P. Siarry (Eds.). 2011. Graph Partitioning. Wiley."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compfluid.2012.01.019"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithm Engineering -Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.)","author":"Bulu\u00e7 Aydin","unstructured":"Aydin Bulu\u00e7 , Henning Meyerhenke , Ilya Safro , Peter Sanders , and Christian Schulz . 2016. Recent Advances in Graph Partitioning . In Algorithm Engineering -Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.) . Lecture Notes in Computer Science , Vol. 9220 . 117--158. Aydin Bulu\u00e7, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. 2016. Recent Advances in Graph Partitioning. In Algorithm Engineering -Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.). Lecture Notes in Computer Science, Vol. 9220. 117--158."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-012-0229-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11169-3_14"},{"volume-title":"2011 International Conference on High Performance Computing Simulation. 525--532","author":"Clauss C.","key":"e_1_3_2_1_7_1","unstructured":"C. Clauss , S. Lankes , P. Reble , and T. Bemmerl . 2011. Evaluation and improvements of programming models for the Intel SCC many-core processor . In 2011 International Conference on High Performance Computing Simulation. 525--532 . C. Clauss, S. Lankes, P. Reble, and T. Bemmerl. 2011. Evaluation and improvements of programming models for the Intel SCC many-core processor. In 2011 International Conference on High Performance Computing Simulation. 525--532."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.93"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00226"},{"key":"e_1_3_2_1_10_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2015.21"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995909"},{"key":"e_1_3_2_1_13_1","volume-title":"A simple O(mn) algorithm for recognizing Hamming graphs. Bull. Inst. Comb. Appl","author":"Imrich W.","year":"1993","unstructured":"W. Imrich . 1993. A simple O(mn) algorithm for recognizing Hamming graphs. Bull. Inst. Comb. Appl ( 1993 ), 45--56. W. Imrich. 1993. A simple O(mn) algorithm for recognizing Hamming graphs. Bull. Inst. Comb. Appl (1993), 45--56."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.104"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90004-I"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342015597082"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.04.005"},{"key":"e_1_3_2_1_20_1","volume-title":"18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I (Lecture Notes in Computer Science), Mark de Berg and Ulrich Meyer (Eds.)","volume":"6346","author":"Osipov Vitaly","year":"2010","unstructured":"Vitaly Osipov and Peter Sanders . 2010 . n-Level Graph Partitioning. In Algorithms - ESA 2010 , 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I (Lecture Notes in Computer Science), Mark de Berg and Ulrich Meyer (Eds.) , Vol. 6346 . Springer, 278--289. Vitaly Osipov and Peter Sanders. 2010. n-Level Graph Partitioning. In Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I (Lecture Notes in Computer Science), Mark de Berg and Ulrich Meyer (Eds.), Vol. 6346. Springer, 278--289."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.10.025"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SHPCC.1994.296682"},{"key":"e_1_3_2_1_24_1","first-page":"115","article-title":"Static Mapping of Process Graphs. In Graph Partitioning, Charles-Edmond Bichot and Patrick Siarry (Eds.). John Wiley & Sons","volume":"5","author":"Pellegrini Fran\u00e7ois","year":"2011","unstructured":"Fran\u00e7ois Pellegrini . 2011 . Static Mapping of Process Graphs. In Graph Partitioning, Charles-Edmond Bichot and Patrick Siarry (Eds.). John Wiley & Sons , Chapter 5 , 115 -- 136 . Fran\u00e7ois Pellegrini. 2011. Static Mapping of Process Graphs. In Graph Partitioning, Charles-Edmond Bichot and Patrick Siarry (Eds.). John Wiley & Sons, Chapter 5, 115--136.","journal-title":"Chapter"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.59"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_32"},{"volume-title":"Proc. of the 10th DIMACS Impl. Challenge Workshop: Graph Partitioning and Graph Clustering. AMS, 1--17","author":"Sanders P.","key":"e_1_3_2_1_27_1","unstructured":"P. Sanders and C. Schulz . 2013. High Quality Graph Partitioning . In Proc. of the 10th DIMACS Impl. Challenge Workshop: Graph Partitioning and Graph Clustering. AMS, 1--17 . P. Sanders and C. Schulz. 2013. High Quality Graph Partitioning. In Proc. of the 10th DIMACS Impl. Challenge Workshop: Graph Partitioning and Graph Clustering. AMS, 1--17."},{"key":"e_1_3_2_1_28_1","volume-title":"KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. CoRR abs\/1311.1714","author":"Sanders Peter","year":"2013","unstructured":"Peter Sanders and Christian Schulz . 2013. KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. CoRR abs\/1311.1714 ( 2013 ). Peter Sanders and Christian Schulz. 2013. KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. CoRR abs\/1311.1714 (2013)."},{"key":"e_1_3_2_1_29_1","unstructured":"C. Schulz and J. L. Tr\u00e4ff. 2017. Better Process Mapping and Sparse Quadratic Assignment. CoRR abs\/1702.04164 (2017).  C. Schulz and J. L. Tr\u00e4ff. 2017. Better Process Mapping and Sparse Quadratic Assignment. CoRR abs\/1702.04164 (2017)."},{"volume-title":"Parallel Scientific Computing. Theory, Algorithms, and Applications of Mesh Based and Meshless Methods","author":"Trobec Roman","key":"e_1_3_2_1_30_1","unstructured":"Roman Trobec and Gregor Kosec . 2015. Parallel Scientific Computing. Theory, Algorithms, and Applications of Mesh Based and Meshless Methods . Springer Intl . Publ. Roman Trobec and Gregor Kosec. 2015. Parallel Scientific Computing. Theory, Algorithms, and Applications of Mesh Based and Meshless Methods. Springer Intl. Publ."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.06.014"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00107-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188576"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","sponsor":["University of Oregon University of Oregon"],"location":"Eugene OR USA","acronym":"ICPP 2018"},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225117","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:50Z","timestamp":1750210790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":32,"alternative-id":["10.1145\/3225058.3225117","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225117","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}