{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:48Z","timestamp":1740122808383,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T00:00:00Z","timestamp":1594771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T00:00:00Z","timestamp":1594771200000},"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":["J Heuristics"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10732-020-09448-8","type":"journal-article","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T06:15:35Z","timestamp":1594793735000},"page":"771-799","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Evolutionary multi-level acyclic graph partitioning"],"prefix":"10.1007","volume":"26","author":[{"given":"Orlando","family":"Moreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5916-8180","authenticated-orcid":false,"given":"Merten","family":"Popp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,15]]},"reference":[{"key":"9448_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: Proceedings of 20th International Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639360"},{"issue":"6","key":"9448_CR2","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"9448_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Ph.D. Thesis (1996)","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"9448_CR4","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: Benchmarking for graph clustering and partitioning. In: Encyclopedia of Social Network Analysis and Mining (2014)","DOI":"10.1007\/978-1-4614-6170-8_23"},{"volume-title":"Graph Partitioning","year":"2011","key":"9448_CR5","unstructured":"Bichot, C., Siarry, P. (eds.): Graph Partitioning. Wiley, Hoboken (2011)"},{"key":"9448_CR6","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Algorithm Engineering\u2014Selected Topics (2014). arXiv:1311.3144"},{"key":"9448_CR7","doi-asserted-by":"crossref","unstructured":"Cardoso, J.M.P., Neto, H.C.: An enhanced static-list scheduling algorithm for temporal partitioning onto RPUs. In: VLSI: Systems on a Chip, pp. 485\u2013496. Springer (2000)","DOI":"10.1007\/978-0-387-35498-9_43"},{"key":"9448_CR8","unstructured":"Chen, Y., Zhou, H.: Buffer minimization in pipelined SDF scheduling on multi-core platforms. In: Design Automation Conference (ASP-DAC), 2012 17th Asia and South Pacific, pp. 127\u2013132. IEEE (2012)"},{"issue":"6\u20138","key":"9448_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.parco.2007.12.001","volume":"34","author":"C Chevalier","year":"2008","unstructured":"Chevalier, C., Pellegrini, F.: PT-Scotch. Parallel Comput. 34(6\u20138), 318\u2013331 (2008)","journal-title":"Parallel Comput."},{"key":"9448_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, Proceedings, Part II, LNCS, vol. 6756, pp. 502\u2013513. Springer (2011)","DOI":"10.1007\/978-3-642-22012-8_40"},{"issue":"4","key":"9448_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0743-7315(92)90014-E","volume":"16","author":"DG Feitelson","year":"1992","unstructured":"Feitelson, D.G., Rudolph, L.: Gang scheduling performance benefits for fine-grain synchronization. J. Parallel Distrib. Comput. 16(4), 306\u2013318 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9448_CR12","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Conference on Design Automation, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"9448_CR13","unstructured":"Gary, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness (1979)"},{"issue":"1","key":"9448_CR14","first-page":"04-1","volume":"3","author":"J Goossens","year":"2016","unstructured":"Goossens, J., Richard, P.: Optimal Scheduling of Periodic Gang Tasks. Leibniz Trans. Embed. Syst. 3(1), 04-1 (2016)","journal-title":"Leibniz Trans. Embed. Syst."},{"key":"9448_CR15","doi-asserted-by":"crossref","unstructured":"Herrmann, J., Kho, J., U\u00e7ar, B., Kaya, K., \u00c7ataly\u00fcrek, \u00dc.V.: Acyclic partitioning of large directed acyclic graphs. In: Proceedings of the 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, pp. 371\u2013380. IEEE Press (2017)","DOI":"10.1109\/CCGRID.2017.101"},{"issue":"12","key":"9448_CR16","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1109\/TVLSI.2007.909806","volume":"15","author":"YC Jiang","year":"2007","unstructured":"Jiang, Y.C., Wang, J.F.: Temporal partitioning data flow graphs for dynamically reconfigurable computing. IEEE Trans. Very Large Scale Integr. VLSI Syst. 15(12), 1351\u20131361 (2007)","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"issue":"11","key":"9448_CR17","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"9448_CR18","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TPDS.2014.2312924","volume":"26","author":"CC Kao","year":"2015","unstructured":"Kao, C.C.: Performance-oriented partitioning for task scheduling of parallel reconfigurable architectures. IEEE Trans. Parallel Distrib. Syst. 26(3), 858\u2013867 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9448_CR19","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9448_CR20","unstructured":"Khronos Group: The OpenVX specification: vision functions. https:\/\/www.khronos.org\/registry\/OpenVX\/specs\/1.0\/html\/da\/db6\/group__group__vision__functions.html (2017)"},{"key":"9448_CR21","doi-asserted-by":"crossref","unstructured":"Kim, J., Hwang, I., Kim, Y.H., Moon, B.R.: Genetic approaches for graph partitioning: a survey. In: Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO\u201911), pp. 473\u2013480. ACM (2011)","DOI":"10.1145\/2001576.2001642"},{"key":"9448_CR22","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. In: Proceedings of 20th International Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639295"},{"key":"9448_CR23","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Partitioning complex networks via size-constrained clustering. In: Proceedings of the 13th International Symposium on Experimental Algorithms, LNCS. Springer (2014)","DOI":"10.1007\/978-3-319-07959-2_30"},{"issue":"2","key":"9448_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"BL Miller","year":"1996","unstructured":"Miller, B.L., Goldberg, D.E.: Genetic algorithms, tournament selection, and the effects of noise. Evol. Comput. 4(2), 113\u2013131 (1996)","journal-title":"Evol. Comput."},{"issue":"4","key":"9448_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/2010324.1964963","volume":"30","author":"S Paris","year":"2011","unstructured":"Paris, S., Hasinoff, S.W., Kautz, J.: Local Laplacian filters: edge-aware image processing with a Laplacian pyramid. ACM Trans. Graph. 30(4), 68 (2011)","journal-title":"ACM Trans. Graph."},{"key":"9448_CR26","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: Scotch and PT-scotch graph partitioning software: an overview. In: Combinatorial Scientific Computing, pp. 373\u2013406 (2012)","DOI":"10.1201\/b11644-15"},{"key":"9448_CR27","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"JC Picard","year":"1980","unstructured":"Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Math. Program. Stud. 13, 8\u201316 (1980)","journal-title":"Math. Program. Stud."},{"key":"9448_CR28","unstructured":"Pouchet, L.: Polybench: the polyhedral benchmark suite. http:\/\/www.cs.ucla.edu\/pouchet\/software\/polybench (2012)"},{"key":"9448_CR29","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: Proceedings of the 19th European Symposium on Algorithms, LNCS, vol. 6942, pp. 469\u2013480. Springer (2011)","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"9448_CR30","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: The Sourcebook of Parallel Computing, pp. 491\u2013541 (2003)"},{"issue":"872","key":"9448_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1098\/rspa.1935.0134","volume":"151","author":"RV Southwell","year":"1935","unstructured":"Southwell, R.V.: Stress-calculation in frameworks by the method of \u201csystematic relaxation of constraints\u201d. Proc. R. Soc. Lond. 151(872), 56\u201395 (1935)","journal-title":"Proc. R. Soc. Lond."},{"key":"9448_CR32","doi-asserted-by":"crossref","unstructured":"Stavrinides, G.L., Karatza, H.D.: Scheduling different types of applications in a SaaS Cloud. In: Proceedings of the 6th International Symposium on Business Modeling and Software Design (BMSD\u201916), pp. 144\u2013151 (2016)","DOI":"10.5220\/0006223101440151"},{"issue":"1","key":"9448_CR33","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J. Sci. Comput. 22(1), 63\u201380 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"9448_CR34","doi-asserted-by":"crossref","unstructured":"Walshaw, C., Cross, M.: JOSTLE: parallel multilevel graph-partitioning software\u2014an overview. In: Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27\u201358 (2007)","DOI":"10.4203\/csets.17.2"},{"key":"9448_CR35","doi-asserted-by":"crossref","unstructured":"Wolf, M.: Platforms and architectures for distributed smart cameras. In: Distributed Embedded Smart Cameras, pp. 3\u201323. Springer (2014)","DOI":"10.1007\/978-1-4614-7705-1_1"},{"key":"9448_CR36","doi-asserted-by":"crossref","unstructured":"Wolf, M.: Embedded computer vision. In: Handbook of Hardware\/Software Codesign, pp. 1\u201314 (2017)","DOI":"10.1007\/978-94-017-7358-4_40-1"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09448-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-020-09448-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09448-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:17:28Z","timestamp":1626308248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-020-09448-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,15]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9448"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09448-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2020,7,15]]},"assertion":[{"value":"18 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}