{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:20Z","timestamp":1783576880849,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"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,7,2]]},"DOI":"10.1145\/3205455.3205464","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:30:37Z","timestamp":1530621037000},"page":"332-339","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Evolutionary multi-level acyclic graph partitioning"],"prefix":"10.1145","author":[{"given":"Orlando","family":"Moreira","sequence":"first","affiliation":[{"name":"Intel Corporation, Eindhoven, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Merten","family":"Popp","sequence":"additional","affiliation":[{"name":"Intel Corporation, Eindhoven, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899055"},{"key":"e_1_3_2_2_3_1","unstructured":"C. Bichot and P. Siarry (Eds.). 2011. Graph Partitioning. Wiley."},{"key":"e_1_3_2_2_4_1","first-page":"3144","article-title":"Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Topics, to app","volume":"1311","author":"Bulu\u00e7 A.","year":"2014","unstructured":"A. Bulu\u00e7, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz. 2014. Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Topics, to app., ArXiv:1311.3144.","journal-title":"ArXiv"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","unstructured":"J.M.P. Cardoso and H. C. Neto. 2000. An enhanced static-list scheduling algorithm for temporal partitioning onto RPUs. In VLSI: Systems on a Chip. Springer 485--496.","DOI":"10.5555\/647030.714831"},{"key":"e_1_3_2_2_6_1","volume-title":"Design Automation Conference (ASP-DAC)","author":"Chen Y.","year":"2012","unstructured":"Y. Chen and H. Zhou. 2012. Buffer minimization in pipelined SDF scheduling on multi-core platforms. In Design Automation Conference (ASP-DAC), 2012 17th Asia and South Pacific. IEEE, 127--132."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027274"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90014-E"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/800263.809204"},{"key":"e_1_3_2_2_11_1","unstructured":"J. Goossens and P. Richard. 2016. Optimal Scheduling of Periodic Gang Tasks. Leibniz transactions on embedded systems 3 1 (2016) 04--1."},{"key":"e_1_3_2_2_12_1","unstructured":"Khronos Vision Working Group et al. 2017. The OpenVXTM Specification vi. 1. Web:https:\/\/www.khronos.org\/registry\/OpenVX\/specs\/1.1\/OpenVX_Specification_1_1.pdf (2017)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2017.101"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.909806"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369025"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2312924"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1898991"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.113"},{"key":"e_1_3_2_2_21_1","unstructured":"O. Moreira M. Popp and C. Schulz. 2017. Graph Partitioning with Acyclicity Constraints. arXiv preprint arXiv:1704.00705 (2017)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/375977.375978"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964963"},{"key":"e_1_3_2_2_24_1","volume-title":"Scotch and PT-scotch graph partitioning software: an overview. Combinatorial Scientific Computing","year":"2012","unstructured":"Fran\u00e7ois Pellegrini. 2012. Scotch and PT-scotch graph partitioning software: an overview. Combinatorial Scientific Computing (2012), 373--406."},{"key":"e_1_3_2_2_25_1","volume-title":"Polybench: The polyhedral benchmark suite. URL: http:\/\/www.cs.ucla.edu\/pouchet\/software\/polybench","author":"Pouchet L.","year":"2012","unstructured":"L. Pouchet. 2012. Polybench: The polyhedral benchmark suite. URL: http:\/\/www.cs.ucla.edu\/pouchet\/software\/polybench (2012)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040624"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2790265.2790267"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","unstructured":"K. Schloegel G. Karypis and V. Kumar. 2003. Graph Partitioning for High Performance Scientific Simulations. In The Sourcebook of Parallel Computing. 491--541.","DOI":"10.5555\/941480.941499"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1935.0134"},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the 6th International Symposium on Business Modeling and Software Design (BMSD'16)","author":"Stavrinides G. L.","unstructured":"G. L. Stavrinides and H. D. Karatza. 2016. Scheduling Different Types of Applications in a SaaS Cloud. In Proceedings of the 6th International Symposium on Business Modeling and Software Design (BMSD'16). 144--151."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598337373"},{"key":"e_1_3_2_2_32_1","volume-title":"JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. In Mesh Partitioning Techniques and Domain Decomposition Techniques. 27--58.","author":"Walshaw C.","year":"2007","unstructured":"C. Walshaw and M. Cross. 2007. JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. In Mesh Partitioning Techniques and Domain Decomposition Techniques. 27--58."}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","location":"Kyoto Japan","acronym":"GECCO '18","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205464","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:56Z","timestamp":1750208936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":31,"alternative-id":["10.1145\/3205455.3205464","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205464","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}