[{"title":"The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems","doi":"10.1109/CEC.2016.7748359","date_updated":"2023-10-16T13:39:06Z","author":[{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike"}],"date_created":"2023-08-04T15:14:52Z","place":"Vancouver, BC, Kanada","year":"2016","citation":{"ieee":"P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi: <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","chicago":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. Vancouver, BC, Kanada, 2016. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>.","ama":"Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>","bibtex":"@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada}, title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }","mla":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","short":"P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016.","apa":"Kerschke, P., &#38; Trautmann, H. (2016). The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>"},"language":[{"iso":"eng"}],"_id":"46368","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented."}],"status":"public","publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","type":"conference"},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46370","status":"public","abstract":[{"text":"This report documents the talks and discussions at the Dagstuhl Seminar 15211 \"Theory of Evolutionary Algorithms\". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution.","lang":"eng"}],"publication":"Dagstuhl Reports","type":"journal_article","doi":"10.4230/DagRep.5.5.57","title":"Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)","volume":5,"author":[{"first_name":"F","full_name":"Neumann, F","last_name":"Neumann"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"}],"date_created":"2023-08-04T15:17:00Z","date_updated":"2023-10-16T13:40:00Z","page":"78–79","intvolume":"         5","citation":{"chicago":"Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i> 5, no. 5 (2016): 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>.","ieee":"F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211),” <i>Dagstuhl Reports</i>, vol. 5, no. 5, pp. 78–79, 2016, doi: <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","ama":"Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>. 2016;5(5):78–79. doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>","mla":"Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i>, vol. 5, no. 5, 2016, pp. 78–79, doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","short":"F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79.","bibtex":"@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>}, number={5}, journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016}, pages={78–79} }","apa":"Neumann, F., &#38; Trautmann, H. (2016). Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>, <i>5</i>(5), 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>"},"year":"2016","issue":"5"},{"date_updated":"2023-10-19T12:07:05Z","publisher":"Association for Computational Linguistics","date_created":"2023-10-19T08:31:58Z","author":[{"id":"101881","full_name":"Habernal, Ivan","last_name":"Habernal","first_name":"Ivan"},{"last_name":"Gurevych","full_name":"Gurevych, Iryna","first_name":"Iryna"}],"title":"What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation","doi":"10.18653/v1/d16-1129","publication_status":"published","year":"2016","citation":{"ieee":"I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","chicago":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>.","ama":"Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. In: <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>","short":"I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016.","mla":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }","apa":"Habernal, I., &#38; Gurevych, I. (2016). What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>"},"_id":"48309","user_id":"15504","department":[{"_id":"34"},{"_id":"820"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing","status":"public"},{"place":"Cham","citation":{"ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>","apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>","short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 48–59.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>."},"page":"48–59","publication_status":"published","publication_identifier":{"isbn":["978-3-319-50349-3"]},"doi":"10.1007/978-3-319-50349-3_4","date_updated":"2023-12-13T10:47:05Z","author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"}],"editor":[{"full_name":"Festa, Paola","last_name":"Festa","first_name":"Paola"},{"last_name":"Sellmann","full_name":"Sellmann, Meinolf","first_name":"Meinolf"},{"first_name":"Joaquin","last_name":"Vanschoren","full_name":"Vanschoren, Joaquin"}],"status":"public","type":"conference","extern":"1","_id":"48873","series_title":"Lecture Notes in Computer Science","user_id":"102979","department":[{"_id":"819"}],"year":"2016","title":"Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers","publisher":"Springer International Publishing","date_created":"2023-11-14T15:58:57Z","abstract":[{"lang":"eng","text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms."}],"publication":"Learning and Intelligent Optimization","keyword":["Algorithm selection","Feature selection","Instance hardness","TSP"],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"keyword":["Artificial Intelligence","Computer Networks and Communications","Information Systems"],"department":[{"_id":"888"}],"user_id":"9503","_id":"52803","status":"public","publication":"Journal on Data Semantics","type":"journal_article","doi":"10.1007/s13740-015-0055-y","title":"Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies","volume":5,"date_created":"2024-03-25T09:23:39Z","author":[{"first_name":"Stefan","full_name":"Borgwardt, Stefan","last_name":"Borgwardt"},{"first_name":"Theofilos","last_name":"Mailis","full_name":"Mailis, Theofilos"},{"full_name":"Peñaloza, Rafael","last_name":"Peñaloza","first_name":"Rafael"},{"first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan"}],"date_updated":"2024-03-25T13:50:33Z","publisher":"Springer Science and Business Media LLC","page":"55-75","intvolume":"         5","citation":{"ama":"Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>. 2016;5(2):55-75. doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>","ieee":"S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” <i>Journal on Data Semantics</i>, vol. 5, no. 2, pp. 55–75, 2016, doi: <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","chicago":"Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i> 5, no. 2 (2016): 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>.","apa":"Borgwardt, S., Mailis, T., Peñaloza, R., &#38; Turhan, A.-Y. (2016). Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>, <i>5</i>(2), 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>","mla":"Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i>, vol. 5, no. 2, Springer Science and Business Media LLC, 2016, pp. 55–75, doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","short":"S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics 5 (2016) 55–75.","bibtex":"@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>}, number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }"},"year":"2016","issue":"2","publication_identifier":{"issn":["1861-2032","1861-2040"]},"publication_status":"published"},{"title":"SoK: Lessons Learned from Android Security Research for Appified Software Platforms","doi":"10.1109/sp.2016.33","publisher":"IEEE","date_updated":"2024-06-05T13:14:55Z","author":[{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Backes, Michael","last_name":"Backes","first_name":"Michael"},{"last_name":"Bugiel","full_name":"Bugiel, Sven","first_name":"Sven"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"},{"first_name":"Patrick","full_name":"McDaniel, Patrick","last_name":"McDaniel"},{"full_name":"Smith, Matthew","last_name":"Smith","first_name":"Matthew"}],"date_created":"2023-09-22T12:41:43Z","year":"2016","citation":{"chicago":"Acar, Yasemin, Michael Backes, Sven Bugiel, Sascha Fahl, Patrick McDaniel, and Matthew Smith. “SoK: Lessons Learned from Android Security Research for Appified Software Platforms.” In <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/sp.2016.33\">https://doi.org/10.1109/sp.2016.33</a>.","ieee":"Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, and M. Smith, “SoK: Lessons Learned from Android Security Research for Appified Software Platforms,” 2016, doi: <a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>.","ama":"Acar Y, Backes M, Bugiel S, Fahl S, McDaniel P, Smith M. SoK: Lessons Learned from Android Security Research for Appified Software Platforms. In: <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>","bibtex":"@inproceedings{Acar_Backes_Bugiel_Fahl_McDaniel_Smith_2016, title={SoK: Lessons Learned from Android Security Research for Appified Software Platforms}, DOI={<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>}, booktitle={2016 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Bugiel, Sven and Fahl, Sascha and McDaniel, Patrick and Smith, Matthew}, year={2016} }","short":"Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, M. Smith, in: 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016.","mla":"Acar, Yasemin, et al. “SoK: Lessons Learned from Android Security Research for Appified Software Platforms.” <i>2016 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/sp.2016.33\">10.1109/sp.2016.33</a>.","apa":"Acar, Y., Backes, M., Bugiel, S., Fahl, S., McDaniel, P., &#38; Smith, M. (2016). SoK: Lessons Learned from Android Security Research for Appified Software Platforms. <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp.2016.33\">https://doi.org/10.1109/sp.2016.33</a>"},"publication_status":"published","extern":"1","language":[{"iso":"eng"}],"_id":"47240","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","status":"public","publication":"2016 IEEE Symposium on Security and Privacy (SP)","type":"conference"},{"type":"conference","publication":"25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016","editor":[{"first_name":"Thorsten","full_name":"Holz, Thorsten","last_name":"Holz"},{"last_name":"Savage","full_name":"Savage, Stefan","first_name":"Stefan"}],"status":"public","_id":"47239","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"language":[{"iso":"eng"}],"extern":"1","year":"2016","citation":{"ama":"Dechand S, Schürmann D, Busse K, Acar Y, Fahl S, Smith M. An Empirical Study of Textual Key-Fingerprint Representations. In: Holz T, Savage S, eds. <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>. USENIX Association; 2016:193–208.","ieee":"S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, and M. Smith, “An Empirical Study of Textual Key-Fingerprint Representations,” in <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, 2016, pp. 193–208.","chicago":"Dechand, Sergej, Dominik Schürmann, Karoline Busse, Yasemin Acar, Sascha Fahl, and Matthew Smith. “An Empirical Study of Textual Key-Fingerprint Representations.” In <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, edited by Thorsten Holz and Stefan Savage, 193–208. USENIX Association, 2016.","short":"S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, M. Smith, in: T. Holz, S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, USENIX Association, 2016, pp. 193–208.","mla":"Dechand, Sergej, et al. “An Empirical Study of Textual Key-Fingerprint Representations.” <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i>, edited by Thorsten Holz and Stefan Savage, USENIX Association, 2016, pp. 193–208.","bibtex":"@inproceedings{Dechand_Schürmann_Busse_Acar_Fahl_Smith_2016, title={An Empirical Study of Textual Key-Fingerprint Representations}, booktitle={25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016}, publisher={USENIX Association}, author={Dechand, Sergej and Schürmann, Dominik and Busse, Karoline and Acar, Yasemin and Fahl, Sascha and Smith, Matthew}, editor={Holz, Thorsten and Savage, Stefan}, year={2016}, pages={193–208} }","apa":"Dechand, S., Schürmann, D., Busse, K., Acar, Y., Fahl, S., &#38; Smith, M. (2016). An Empirical Study of Textual Key-Fingerprint Representations. In T. Holz &#38; S. Savage (Eds.), <i>25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016</i> (pp. 193–208). USENIX Association."},"page":"193–208","date_updated":"2024-06-05T13:15:58Z","publisher":"USENIX Association","author":[{"last_name":"Dechand","full_name":"Dechand, Sergej","first_name":"Sergej"},{"full_name":"Schürmann, Dominik","last_name":"Schürmann","first_name":"Dominik"},{"full_name":"Busse, Karoline","last_name":"Busse","first_name":"Karoline"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"},{"first_name":"Matthew","full_name":"Smith, Matthew","last_name":"Smith"}],"date_created":"2023-09-22T12:40:35Z","title":"An Empirical Study of Textual Key-Fingerprint Representations"},{"_id":"47241","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","language":[{"iso":"eng"}],"extern":"1","publication":"2016 IEEE Symposium on Security and Privacy (SP)","type":"conference","status":"public","publisher":"IEEE","date_updated":"2024-06-05T13:15:19Z","date_created":"2023-09-22T12:42:01Z","author":[{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"full_name":"Backes, Michael","last_name":"Backes","first_name":"Michael"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"},{"last_name":"Kim","full_name":"Kim, Doowon","first_name":"Doowon"},{"full_name":"Mazurek, Michelle L.","last_name":"Mazurek","first_name":"Michelle L."},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"}],"title":"You Get Where You're Looking for: The Impact of Information Sources on Code Security","doi":"10.1109/sp.2016.25","publication_status":"published","year":"2016","citation":{"chicago":"Acar, Yasemin, Michael Backes, Sascha Fahl, Doowon Kim, Michelle L. Mazurek, and Christian Stransky. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” In <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/sp.2016.25\">https://doi.org/10.1109/sp.2016.25</a>.","ieee":"Y. Acar, M. Backes, S. Fahl, D. Kim, M. L. Mazurek, and C. Stransky, “You Get Where You’re Looking for: The Impact of Information Sources on Code Security,” 2016, doi: <a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>.","ama":"Acar Y, Backes M, Fahl S, Kim D, Mazurek ML, Stransky C. You Get Where You’re Looking for: The Impact of Information Sources on Code Security. In: <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>","apa":"Acar, Y., Backes, M., Fahl, S., Kim, D., Mazurek, M. L., &#38; Stransky, C. (2016). You Get Where You’re Looking for: The Impact of Information Sources on Code Security. <i>2016 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp.2016.25\">https://doi.org/10.1109/sp.2016.25</a>","bibtex":"@inproceedings{Acar_Backes_Fahl_Kim_Mazurek_Stransky_2016, title={You Get Where You’re Looking for: The Impact of Information Sources on Code Security}, DOI={<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>}, booktitle={2016 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Fahl, Sascha and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}, year={2016} }","mla":"Acar, Yasemin, et al. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” <i>2016 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/sp.2016.25\">10.1109/sp.2016.25</a>.","short":"Y. Acar, M. Backes, S. Fahl, D. Kim, M.L. Mazurek, C. Stransky, in: 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016."}},{"status":"public","editor":[{"first_name":"P","last_name":"Festa","full_name":"Festa, P"},{"first_name":"M","full_name":"Sellmann, M","last_name":"Sellmann"},{"last_name":"Vanschoren","full_name":"Vanschoren, J","first_name":"J"}],"abstract":[{"text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.","lang":"eng"}],"publication":"Learning and Intelligent Optimization","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","_id":"46365","intvolume":"     10079","page":"48–59","citation":{"ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Vol 10079. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>","ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, vol. 10079, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by P Festa, M Sellmann, and J Vanschoren, 10079:48–59. Lecture Notes in Computer Science. Ischia, Italy: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Ischia, Italy, 2016, pp. 48–59.","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by P Festa et al., vol. 10079, Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Ischia, Italy}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers}, volume={10079}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, P and Sellmann, M and Vanschoren, J}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }","apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (Vol. 10079, pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>"},"year":"2016","place":"Ischia, Italy","publication_identifier":{"isbn":["978-3-319-50348-6"]},"doi":"10.1007/978-3-319-50349-3_4","title":"Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers","volume":10079,"author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"date_created":"2023-08-04T15:10:58Z","publisher":"Springer International Publishing","date_updated":"2024-06-10T11:58:25Z"},{"year":"2016","title":"Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference","date_created":"2023-08-04T15:11:47Z","publisher":"Springer","abstract":[{"text":"State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem (TSP) are known to mostly yield high-quality solutions in reasonable computation times. With the purpose of understanding different levels of instance difficulties, instances for the current State of the Art heuristic TSP solvers LKH+restart and EAX+restart are presented which are evolved using a sophisticated evolutionary algorithm. More specifically, the performance differences of the respective solvers are maximized resulting in instances which are easier to solve for one solver and much more difficult for the other. Focusing on both optimization directions, instance features are identified which characterize both types of instances and increase the understanding of solver performance differences.","lang":"eng"}],"publication":"AI*IA 2016 Advances in Artificial Intelligence","language":[{"iso":"eng"}],"intvolume":"     10037","page":"3–12","citation":{"ieee":"J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,” in <i>AI*IA 2016 Advances in Artificial Intelligence</i>, 2016, vol. 10037, pp. 3–12, doi: <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” In <i>AI*IA 2016 Advances in Artificial Intelligence</i>, edited by G Adorni, S Cagnoni, M Gori, and M Maratea, 10037:3–12. Lecture Notes in Computer Science. Cham: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">https://doi.org/10.1007/978-3-319-49130-1_1</a>.","ama":"Bossek J, Trautmann H. Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. In: Adorni G, Cagnoni S, Gori M, Maratea M, eds. <i>AI*IA 2016 Advances in Artificial Intelligence</i>. Vol 10037. Lecture Notes in Computer Science. Springer; 2016:3–12. doi:<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>","apa":"Bossek, J., &#38; Trautmann, H. (2016). Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. In G. Adorni, S. Cagnoni, M. Gori, &#38; M. Maratea (Eds.), <i>AI*IA 2016 Advances in Artificial Intelligence</i> (Vol. 10037, pp. 3–12). Springer. <a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">https://doi.org/10.1007/978-3-319-49130-1_1</a>","mla":"Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” <i>AI*IA 2016 Advances in Artificial Intelligence</i>, edited by G Adorni et al., vol. 10037, Springer, 2016, pp. 3–12, doi:<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference}, volume={10037}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49130-1_1\">10.1007/978-3-319-49130-1_1</a>}, booktitle={AI*IA 2016 Advances in Artificial Intelligence}, publisher={Springer}, author={Bossek, Jakob and Trautmann, Heike}, editor={Adorni, G and Cagnoni, S and Gori, M and Maratea, M}, year={2016}, pages={3–12}, collection={Lecture Notes in Computer Science} }","short":"J. Bossek, H. Trautmann, in: G. Adorni, S. Cagnoni, M. Gori, M. Maratea (Eds.), AI*IA 2016 Advances in Artificial Intelligence, Springer, Cham, 2016, pp. 3–12."},"place":"Cham","publication_identifier":{"isbn":["978-3-319-49129-5"]},"doi":"10.1007/978-3-319-49130-1_1","volume":10037,"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike","first_name":"Heike"}],"date_updated":"2024-06-10T11:58:12Z","status":"public","editor":[{"full_name":"Adorni, G","last_name":"Adorni","first_name":"G"},{"first_name":"S","last_name":"Cagnoni","full_name":"Cagnoni, S"},{"full_name":"Gori, M","last_name":"Gori","first_name":"M"},{"last_name":"Maratea","full_name":"Maratea, M","first_name":"M"}],"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","_id":"46366"},{"date_created":"2019-03-01T11:19:54Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","title":"A Linear Time Algorithm for Quantum 2-SAT","year":"2016","external_id":{"arxiv":["1508.07338"]},"language":[{"iso":"eng"}],"keyword":["quantum 2-SAT","transfer matrix","strongly connected components","limited backtracking","local Hamiltonian"],"publication":"Proceedings of the 31st Conference on Computational Complexity (CCC 2016)","abstract":[{"text":"The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically motivated generalization of k-SAT to the quantum setting, defining the problem \"quantum k-SAT\". He showed that quantum 2-SAT is also solvable in polynomial time on a classical computer, in particular in deterministic time O(n^4), assuming unit-cost arithmetic over a field extension of the rational numbers, where n is number of variables. In this paper, we present an algorithm for quantum 2-SAT which runs in linear time, i.e. deterministic time O(n+m) for n and m the number of variables and clauses, respectively. Our approach exploits the transfer matrix techniques of Laumann et al. [QIC, 2010] used in the study of phase transitions for random quantum 2-SAT, and bears similarities with both the linear time 2-SAT algorithms of Even, Itai, and Shamir (based on backtracking) [SICOMP, 1976] and Aspvall, Plass, and Tarjan (based on strongly connected components) [IPL, 1979].","lang":"eng"}],"author":[{"last_name":"de Beaudrap","full_name":"de Beaudrap, Niel","first_name":"Niel"},{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag"}],"volume":50,"date_updated":"2023-02-28T11:01:53Z","oa":"1","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2016/5836/","open_access":"1"}],"doi":"10.4230/LIPIcs.CCC.2016.27","conference":{"name":"31st Conference on Computational Complexity (CCC 2016)","location":"Tokyo, Japan"},"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-008-8"]},"citation":{"ama":"de Beaudrap N, Gharibian S. A Linear Time Algorithm for Quantum 2-SAT. In: Raz R, ed. <i>Proceedings of the 31st Conference on Computational Complexity (CCC 2016)</i>. Vol 50. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2016:27:1-17:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">10.4230/LIPIcs.CCC.2016.27</a>","ieee":"N. de Beaudrap and S. Gharibian, “A Linear Time Algorithm for Quantum 2-SAT,” in <i>Proceedings of the 31st Conference on Computational Complexity (CCC 2016)</i>, Tokyo, Japan, 2016, vol. 50, p. 27:1–17:21, doi: <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">10.4230/LIPIcs.CCC.2016.27</a>.","chicago":"Beaudrap, Niel de, and Sevag Gharibian. “A Linear Time Algorithm for Quantum 2-SAT.” In <i>Proceedings of the 31st Conference on Computational Complexity (CCC 2016)</i>, edited by Ran Raz, 50:27:1-17:21. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">https://doi.org/10.4230/LIPIcs.CCC.2016.27</a>.","apa":"de Beaudrap, N., &#38; Gharibian, S. (2016). A Linear Time Algorithm for Quantum 2-SAT. In R. Raz (Ed.), <i>Proceedings of the 31st Conference on Computational Complexity (CCC 2016)</i> (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">https://doi.org/10.4230/LIPIcs.CCC.2016.27</a>","mla":"de Beaudrap, Niel, and Sevag Gharibian. “A Linear Time Algorithm for Quantum 2-SAT.” <i>Proceedings of the 31st Conference on Computational Complexity (CCC 2016)</i>, edited by Ran Raz, vol. 50, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 27:1-17:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">10.4230/LIPIcs.CCC.2016.27</a>.","bibtex":"@inproceedings{de Beaudrap_Gharibian_2016, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Linear Time Algorithm for Quantum 2-SAT}, volume={50}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2016.27\">10.4230/LIPIcs.CCC.2016.27</a>}, booktitle={Proceedings of the 31st Conference on Computational Complexity (CCC 2016)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={de Beaudrap, Niel and Gharibian, Sevag}, editor={Raz, Ran}, year={2016}, pages={27:1–17:21}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"N. de Beaudrap, S. Gharibian, in: R. Raz (Ed.), Proceedings of the 31st Conference on Computational Complexity (CCC 2016), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016, p. 27:1–17:21."},"page":"27:1-17:21","intvolume":"        50","place":"Dagstuhl, Germany","user_id":"71541","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"623"},{"_id":"7"}],"_id":"8159","extern":"1","type":"conference","status":"public","editor":[{"first_name":"Ran","full_name":"Raz, Ran","last_name":"Raz"}]},{"abstract":[{"lang":"eng","text":"In this chapter, we present an introduction to the ReconOS operating system for reconfigurable computing. ReconOS offers a unified multi-threaded programming model and operating system services for threads executing in software and threads mapped to reconfigurable hardware. By supporting standard POSIX operating system functions for both software and hardware threads, ReconOS particularly caters to developers with a software background, because developers can use well-known mechanisms such as semaphores, mutexes, condition variables, and message queues for developing hybrid applications with threads running on the CPU and FPGA concurrently. Through the semantic integration of hardware accelerators into a standard operating system environment, ReconOS allows for rapid design space exploration, supports a structured application development process and improves the portability of applications between different reconfigurable computing systems."}],"publication":"FPGAs for Software Programmers","language":[{"iso":"eng"}],"year":"2016","quality_controlled":"1","title":"ReconOS","date_created":"2017-07-26T15:07:06Z","publisher":"Springer International Publishing","status":"public","editor":[{"last_name":"Koch","full_name":"Koch, Dirk","first_name":"Dirk"},{"first_name":"Frank","full_name":"Hannig, Frank","last_name":"Hannig"},{"last_name":"Ziener","full_name":"Ziener, Daniel","first_name":"Daniel"}],"type":"book_chapter","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"29","project":[{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"page":"227-244","citation":{"ama":"Agne A, Platzner M, Plessl C, Happe M, Lübbers E. ReconOS. In: Koch D, Hannig F, Ziener D, eds. <i>FPGAs for Software Programmers</i>. Springer International Publishing; 2016:227-244. doi:<a href=\"https://doi.org/10.1007/978-3-319-26408-0_13\">10.1007/978-3-319-26408-0_13</a>","ieee":"A. Agne, M. Platzner, C. Plessl, M. Happe, and E. Lübbers, “ReconOS,” in <i>FPGAs for Software Programmers</i>, D. Koch, F. Hannig, and D. Ziener, Eds. Cham: Springer International Publishing, 2016, pp. 227–244.","chicago":"Agne, Andreas, Marco Platzner, Christian Plessl, Markus Happe, and Enno Lübbers. “ReconOS.” In <i>FPGAs for Software Programmers</i>, edited by Dirk Koch, Frank Hannig, and Daniel Ziener, 227–44. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-26408-0_13\">https://doi.org/10.1007/978-3-319-26408-0_13</a>.","bibtex":"@inbook{Agne_Platzner_Plessl_Happe_Lübbers_2016, place={Cham}, title={ReconOS}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-26408-0_13\">10.1007/978-3-319-26408-0_13</a>}, booktitle={FPGAs for Software Programmers}, publisher={Springer International Publishing}, author={Agne, Andreas and Platzner, Marco and Plessl, Christian and Happe, Markus and Lübbers, Enno}, editor={Koch, Dirk and Hannig, Frank and Ziener, Daniel}, year={2016}, pages={227–244} }","mla":"Agne, Andreas, et al. “ReconOS.” <i>FPGAs for Software Programmers</i>, edited by Dirk Koch et al., Springer International Publishing, 2016, pp. 227–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-26408-0_13\">10.1007/978-3-319-26408-0_13</a>.","short":"A. Agne, M. Platzner, C. Plessl, M. Happe, E. Lübbers, in: D. Koch, F. Hannig, D. Ziener (Eds.), FPGAs for Software Programmers, Springer International Publishing, Cham, 2016, pp. 227–244.","apa":"Agne, A., Platzner, M., Plessl, C., Happe, M., &#38; Lübbers, E. (2016). ReconOS. In D. Koch, F. Hannig, &#38; D. Ziener (Eds.), <i>FPGAs for Software Programmers</i> (pp. 227–244). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-26408-0_13\">https://doi.org/10.1007/978-3-319-26408-0_13</a>"},"place":"Cham","publication_identifier":{"isbn":["978-3-319-26406-6","978-3-319-26408-0"]},"publication_status":"published","doi":"10.1007/978-3-319-26408-0_13","author":[{"first_name":"Andreas","full_name":"Agne, Andreas","last_name":"Agne"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"first_name":"Enno","last_name":"Lübbers","full_name":"Lübbers, Enno"}],"date_updated":"2023-09-26T13:25:38Z"},{"date_updated":"2023-09-26T13:25:59Z","date_created":"2017-07-26T15:16:31Z","author":[{"id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler","first_name":"Heinrich"},{"last_name":"Vaz","id":"30332","full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"last_name":"Trainiti","full_name":"Trainiti, Ettore M. G.","first_name":"Ettore M. G."},{"first_name":"Gianluca C.","full_name":"Durelli, Gianluca C.","last_name":"Durelli"},{"full_name":"Bolchini, Cristiana","last_name":"Bolchini","first_name":"Cristiana"}],"title":"Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems","quality_controlled":"1","has_accepted_license":"1","year":"2016","citation":{"ama":"Riebler H, Vaz GF, Plessl C, Trainiti EMG, Durelli GC, Bolchini C. Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems. In: <i>Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)</i>. ; 2016.","ieee":"H. Riebler, G. F. Vaz, C. Plessl, E. M. G. Trainiti, G. C. Durelli, and C. Bolchini, “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems,” 2016.","chicago":"Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G. Trainiti, Gianluca C. Durelli, and Cristiana Bolchini. “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems.” In <i>Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)</i>, 2016.","apa":"Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., &#38; Bolchini, C. (2016). Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems. <i>Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)</i>.","short":"H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, C. Bolchini, in: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC), 2016.","mla":"Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems.” <i>Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)</i>, 2016.","bibtex":"@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Bolchini_2016, title={Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems}, booktitle={Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)}, author={Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G. and Durelli, Gianluca C. and Bolchini, Cristiana}, year={2016} }"},"project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"_id":"31","user_id":"15278","department":[{"_id":"27"},{"_id":"518"}],"ddc":["040"],"file_date_updated":"2019-01-11T11:56:55Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":394563,"file_name":"wrc_upb_polimi_final.pdf","access_level":"closed","file_id":"6626","date_updated":"2019-01-11T11:56:55Z","date_created":"2019-01-11T11:56:55Z","creator":"deffel"}],"status":"public"},{"date_updated":"2023-09-26T13:26:17Z","author":[{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"date_created":"2017-07-26T15:00:43Z","title":"Microdisk Cavity FDTD Simulation on FPGA using OpenCL","quality_controlled":"1","has_accepted_license":"1","year":"2016","citation":{"chicago":"Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation on FPGA Using OpenCL.” In <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2016.","ieee":"T. Kenter and C. Plessl, “Microdisk Cavity FDTD Simulation on FPGA using OpenCL,” 2016.","ama":"Kenter T, Plessl C. Microdisk Cavity FDTD Simulation on FPGA using OpenCL. In: <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>. ; 2016.","mla":"Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation on FPGA Using OpenCL.” <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2016.","short":"T. Kenter, C. Plessl, in: Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC), 2016.","bibtex":"@inproceedings{Kenter_Plessl_2016, title={Microdisk Cavity FDTD Simulation on FPGA using OpenCL}, booktitle={Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)}, author={Kenter, Tobias and Plessl, Christian}, year={2016} }","apa":"Kenter, T., &#38; Plessl, C. (2016). Microdisk Cavity FDTD Simulation on FPGA using OpenCL. <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>."},"_id":"24","project":[{"_id":"32","name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1 / 320898746"},{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - Subproject C2","grant_number":"160364472"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"15278","ddc":["004"],"file_date_updated":"2018-11-14T12:38:45Z","language":[{"iso":"eng"}],"publication":"Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)","type":"conference","status":"public","file":[{"date_updated":"2018-11-14T12:38:45Z","creator":"kenter","date_created":"2018-11-14T12:38:45Z","file_size":129552,"access_level":"closed","file_name":"paper_26.pdf","file_id":"5602","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"quality_controlled":"1","citation":{"ieee":"M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing in Scientific Codes,” 2016.","chicago":"Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate Computing in Scientific Codes.” In <i>Workshop on Approximate Computing (AC)</i>, 2016.","ama":"Lass M, Kühne T, Plessl C. Using Approximate Computing in Scientific Codes. In: <i>Workshop on Approximate Computing (AC)</i>. ; 2016.","bibtex":"@inproceedings{Lass_Kühne_Plessl_2016, title={Using Approximate Computing in Scientific Codes}, booktitle={Workshop on Approximate Computing (AC)}, author={Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2016} }","mla":"Lass, Michael, et al. “Using Approximate Computing in Scientific Codes.” <i>Workshop on Approximate Computing (AC)</i>, 2016.","short":"M. Lass, T. Kühne, C. Plessl, in: Workshop on Approximate Computing (AC), 2016.","apa":"Lass, M., Kühne, T., &#38; Plessl, C. (2016). Using Approximate Computing in Scientific Codes. <i>Workshop on Approximate Computing (AC)</i>."},"year":"2016","author":[{"first_name":"Michael","full_name":"Lass, Michael","id":"24135","orcid":"0000-0002-5708-7632","last_name":"Lass"},{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"date_created":"2017-07-26T15:02:20Z","date_updated":"2023-09-26T13:25:17Z","title":"Using Approximate Computing in Scientific Codes","type":"conference","publication":"Workshop on Approximate Computing (AC)","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"25","language":[{"iso":"eng"}]},{"has_accepted_license":"1","quality_controlled":"1","year":"2016","citation":{"ieee":"H. Riebler <i>et al.</i>, “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems,” in <i>Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)</i>, 2016, pp. 1–5, doi: <a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">10.1109/RTSI.2016.7740545</a>.","chicago":"Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G.  Trainiti, Gianluca C. Durelli, Emanuele Del Sozzo, Marco D.  Santambrogio, and Christina Bolchini. “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems.” In <i>Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)</i>, 1–5. IEEE, 2016. <a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">https://doi.org/10.1109/RTSI.2016.7740545</a>.","ama":"Riebler H, Vaz GF, Plessl C, et al. Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems. In: <i>Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)</i>. IEEE; 2016:1-5. doi:<a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">10.1109/RTSI.2016.7740545</a>","apa":"Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., Del Sozzo, E., Santambrogio, M. D., &#38; Bolchini, C. (2016). Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems. <i>Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)</i>, 1–5. <a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">https://doi.org/10.1109/RTSI.2016.7740545</a>","bibtex":"@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Del Sozzo_Santambrogio_Bolchini_2016, title={Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems}, DOI={<a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">10.1109/RTSI.2016.7740545</a>}, booktitle={Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)}, publisher={IEEE}, author={Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G.  and Durelli, Gianluca C. and Del Sozzo, Emanuele and Santambrogio, Marco D.  and Bolchini, Christina}, year={2016}, pages={1–5} }","short":"H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, E. Del Sozzo, M.D. Santambrogio, C. Bolchini, in: Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI), IEEE, 2016, pp. 1–5.","mla":"Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems.” <i>Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)</i>, IEEE, 2016, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/RTSI.2016.7740545\">10.1109/RTSI.2016.7740545</a>."},"page":"1-5","publisher":"IEEE","date_updated":"2023-09-26T13:28:11Z","date_created":"2017-10-17T12:41:18Z","author":[{"first_name":"Heinrich","last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich"},{"first_name":"Gavin Francis","last_name":"Vaz","full_name":"Vaz, Gavin Francis","id":"30332"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"full_name":"Trainiti, Ettore M. G. ","last_name":"Trainiti","first_name":"Ettore M. G. "},{"full_name":"Durelli, Gianluca C.","last_name":"Durelli","first_name":"Gianluca C."},{"last_name":"Del Sozzo","full_name":"Del Sozzo, Emanuele","first_name":"Emanuele"},{"last_name":"Santambrogio","full_name":"Santambrogio, Marco D. ","first_name":"Marco D. "},{"first_name":"Christina","full_name":"Bolchini, Christina","last_name":"Bolchini"}],"title":"Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems","doi":"10.1109/RTSI.2016.7740545","type":"conference","publication":"Proceedings of International Forum on Research and Technologies for Society and Industry (RTSI)","abstract":[{"lang":"eng","text":"Hardware accelerators are becoming popular in academia and industry. To move one step further from the state-of-the-art multicore plus accelerator approaches, we present in this paper our innovative SAVEHSA architecture. It comprises of a heterogeneous hardware platform with three different high-end accelerators attached over PCIe (GPGPU, FPGA and Intel MIC). Such systems can process parallel workloads very efficiently whilst being more energy efficient than regular CPU systems. To leverage the heterogeneity, the workload has to be distributed among the computing units in a way that each unit is well-suited for the assigned task and executable code must be available. To tackle this problem we present two software components; the first can perform resource allocation at runtime while respecting system and application goals (in terms of throughput, energy, latency, etc.) and the second is able to analyze an application and generate executable code for an accelerator at runtime. We demonstrate the first proof-of-concept implementation of our framework on the heterogeneous platform, discuss different runtime policies and measure the introduced overheads."}],"file":[{"date_updated":"2018-03-21T13:01:09Z","creator":"florida","date_created":"2018-03-21T13:01:09Z","file_size":184334,"access_level":"closed","file_name":"138-07740545.pdf","file_id":"1560","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"610996","_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"_id":"138","user_id":"15278","department":[{"_id":"27"},{"_id":"518"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T13:01:09Z"},{"has_accepted_license":"1","place":"Cham","citation":{"ieee":"A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-aware Compute Nodes,” in <i>Self-aware Computing Systems</i>, Cham: Springer International Publishing, 2016, pp. 145–165.","chicago":"Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco Platzner. “Self-Aware Compute Nodes.” In <i>Self-Aware Computing Systems</i>, 145–65. Natural Computing Series (NCS). Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39675-0_8\">https://doi.org/10.1007/978-3-319-39675-0_8</a>.","ama":"Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-aware Compute Nodes. In: <i>Self-Aware Computing Systems</i>. Natural Computing Series (NCS). Springer International Publishing; 2016:145-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-39675-0_8\">10.1007/978-3-319-39675-0_8</a>","apa":"Agne, A., Happe, M., Lösch, A., Plessl, C., &#38; Platzner, M. (2016). Self-aware Compute Nodes. In <i>Self-aware Computing Systems</i> (pp. 145–165). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-39675-0_8\">https://doi.org/10.1007/978-3-319-39675-0_8</a>","short":"A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, in: Self-Aware Computing Systems, Springer International Publishing, Cham, 2016, pp. 145–165.","bibtex":"@inbook{Agne_Happe_Lösch_Plessl_Platzner_2016, place={Cham}, series={Natural Computing Series (NCS)}, title={Self-aware Compute Nodes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-39675-0_8\">10.1007/978-3-319-39675-0_8</a>}, booktitle={Self-aware Computing Systems}, publisher={Springer International Publishing}, author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian and Platzner, Marco}, year={2016}, pages={145–165}, collection={Natural Computing Series (NCS)} }","mla":"Agne, Andreas, et al. “Self-Aware Compute Nodes.” <i>Self-Aware Computing Systems</i>, Springer International Publishing, 2016, pp. 145–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-39675-0_8\">10.1007/978-3-319-39675-0_8</a>."},"page":"145-165","date_updated":"2023-09-26T13:27:44Z","author":[{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim","id":"43646"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"doi":"10.1007/978-3-319-39675-0_8","type":"book_chapter","status":"public","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"31","name":"Engineering Proprioception in Computing Systems","grant_number":"257906"}],"_id":"156","series_title":"Natural Computing Series (NCS)","user_id":"15278","department":[{"_id":"518"},{"_id":"27"},{"_id":"78"}],"file_date_updated":"2018-11-14T13:20:32Z","quality_controlled":"1","year":"2016","publisher":"Springer International Publishing","date_created":"2017-10-17T12:41:22Z","title":"Self-aware Compute Nodes","publication":"Self-aware Computing Systems","abstract":[{"lang":"eng","text":"Many modern compute nodes are heterogeneous multi-cores that integrate several CPU cores with fixed function or reconfigurable hardware cores. Such systems need to adapt task scheduling and mapping to optimise for performance and energy under varying workloads and, increasingly important, for thermal and fault management and are thus relevant targets for self-aware computing. In this chapter, we take up the generic reference architecture for designing self-aware and self-expressive computing systems and refine it for heterogeneous multi-cores. We present ReconOS, an architecture, programming model and execution environment for heterogeneous multi-cores, and show how the components of the reference architecture can be implemented on top of ReconOS. In particular, the unique feature of dynamic partial reconfiguration supports self-expression through starting and terminating reconfigurable hardware cores. We detail a case study that runs two applications on an architecture with one CPU and 12 reconfigurable hardware cores and present self-expression strategies for adapting under performance, temperature and even conflicting constraints. The case study demonstrates that the reference architecture as a model for self-aware computing is highly useful as it allows us to structure and simplify the design process, which will be essential for designing complex future compute nodes. Furthermore, ReconOS is used as a base technology for flexible protocol stacks in Chapter 10, an approach for self-aware computing at the networking level."}],"file":[{"file_size":833054,"file_id":"5613","access_level":"closed","file_name":"chapter8.pdf","date_updated":"2018-11-14T13:20:32Z","creator":"aloesch","date_created":"2018-11-14T13:20:32Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}]},{"doi":"10.1016/j.compeleceng.2016.04.021","date_updated":"2023-09-26T13:26:38Z","author":[{"last_name":"Vaz","id":"30332","full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis"},{"first_name":"Heinrich","id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler"},{"first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter"},{"full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"volume":55,"citation":{"ieee":"G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code,” <i>Computers and Electrical Engineering</i>, vol. 55, pp. 91–111, 2016, doi: <a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">10.1016/j.compeleceng.2016.04.021</a>.","chicago":"Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl. “Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code.” <i>Computers and Electrical Engineering</i> 55 (2016): 91–111. <a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">https://doi.org/10.1016/j.compeleceng.2016.04.021</a>.","ama":"Vaz GF, Riebler H, Kenter T, Plessl C. Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code. <i>Computers and Electrical Engineering</i>. 2016;55:91-111. doi:<a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">10.1016/j.compeleceng.2016.04.021</a>","bibtex":"@article{Vaz_Riebler_Kenter_Plessl_2016, title={Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code}, volume={55}, DOI={<a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">10.1016/j.compeleceng.2016.04.021</a>}, journal={Computers and Electrical Engineering}, publisher={Elsevier}, author={Vaz, Gavin Francis and Riebler, Heinrich and Kenter, Tobias and Plessl, Christian}, year={2016}, pages={91–111} }","mla":"Vaz, Gavin Francis, et al. “Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code.” <i>Computers and Electrical Engineering</i>, vol. 55, Elsevier, 2016, pp. 91–111, doi:<a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">10.1016/j.compeleceng.2016.04.021</a>.","short":"G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, Computers and Electrical Engineering 55 (2016) 91–111.","apa":"Vaz, G. F., Riebler, H., Kenter, T., &#38; Plessl, C. (2016). Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code. <i>Computers and Electrical Engineering</i>, <i>55</i>, 91–111. <a href=\"https://doi.org/10.1016/j.compeleceng.2016.04.021\">https://doi.org/10.1016/j.compeleceng.2016.04.021</a>"},"page":"91-111","intvolume":"        55","has_accepted_license":"1","publication_identifier":{"issn":["0045-7906"]},"file_date_updated":"2018-03-21T12:45:47Z","project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"610996","_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"_id":"165","user_id":"15278","department":[{"_id":"27"},{"_id":"518"}],"status":"public","type":"journal_article","title":"Potential and Methods for Embedding Dynamic Offloading Decisions into Application Code","publisher":"Elsevier","date_created":"2017-10-17T12:41:24Z","year":"2016","quality_controlled":"1","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"A broad spectrum of applications can be accelerated by offloading computation intensive parts to reconfigurable hardware. However, to achieve speedups, the number of loop it- erations (trip count) needs to be sufficiently large to amortize offloading overheads. Trip counts are frequently not known at compile time, but only at runtime just before entering a loop. Therefore, we propose to generate code for both the CPU and the coprocessor, and defer the offloading decision to the application runtime. We demonstrate how a toolflow, based on the LLVM compiler framework, can automatically embed dynamic offloading de- cisions into the application code. We perform in-depth static and dynamic analysis of pop- ular benchmarks, which confirm the general potential of such an approach. We also pro- pose to optimize the offloading process by decoupling the runtime decision from the loop execution (decision slack). The feasibility of our approach is demonstrated by a toolflow that automatically identifies suitable data-parallel loops and generates code for the FPGA coprocessor of a Convey HC-1. We evaluate the integrated toolflow with representative loops executed for different input data sizes.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T12:45:47Z","creator":"florida","date_updated":"2018-03-21T12:45:47Z","file_id":"1544","access_level":"closed","file_name":"165-1-s2.0-S0045790616301021-main.pdf","file_size":3037854}],"publication":"Computers and Electrical Engineering"},{"has_accepted_license":"1","citation":{"mla":"Lösch, Achim, et al. “Performance-Centric Scheduling with Task Migration for a Heterogeneous Compute Node in the Data Center.” <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, EDA Consortium / IEEE, 2016, pp. 912–17.","bibtex":"@inproceedings{Lösch_Beisel_Kenter_Plessl_Platzner_2016, title={Performance-centric scheduling with task migration for a heterogeneous compute node in the data center}, booktitle={Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)}, publisher={EDA Consortium / IEEE}, author={Lösch, Achim and Beisel, Tobias and Kenter, Tobias and Plessl, Christian and Platzner, Marco}, year={2016}, pages={912–917} }","short":"A. Lösch, T. Beisel, T. Kenter, C. Plessl, M. Platzner, in: Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE), EDA Consortium / IEEE, 2016, pp. 912–917.","apa":"Lösch, A., Beisel, T., Kenter, T., Plessl, C., &#38; Platzner, M. (2016). Performance-centric scheduling with task migration for a heterogeneous compute node in the data center. <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 912–917.","ama":"Lösch A, Beisel T, Kenter T, Plessl C, Platzner M. Performance-centric scheduling with task migration for a heterogeneous compute node in the data center. In: <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. EDA Consortium / IEEE; 2016:912-917.","chicago":"Lösch, Achim, Tobias Beisel, Tobias Kenter, Christian Plessl, and Marco Platzner. “Performance-Centric Scheduling with Task Migration for a Heterogeneous Compute Node in the Data Center.” In <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 912–17. EDA Consortium / IEEE, 2016.","ieee":"A. Lösch, T. Beisel, T. Kenter, C. Plessl, and M. Platzner, “Performance-centric scheduling with task migration for a heterogeneous compute node in the data center,” in <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 2016, pp. 912–917."},"page":"912-917","author":[{"first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim","id":"43646"},{"last_name":"Beisel","full_name":"Beisel, Tobias","first_name":"Tobias"},{"last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145","first_name":"Tobias"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"date_updated":"2023-09-26T13:27:00Z","type":"conference","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"01|H11004A","name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30"}],"_id":"168","file_date_updated":"2018-03-21T12:41:55Z","quality_controlled":"1","year":"2016","date_created":"2017-10-17T12:41:24Z","publisher":"EDA Consortium / IEEE","title":"Performance-centric scheduling with task migration for a heterogeneous compute node in the data center","publication":"Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":261356,"access_level":"closed","file_id":"1541","file_name":"168-07459438.pdf","date_updated":"2018-03-21T12:41:55Z","date_created":"2018-03-21T12:41:55Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"The use of heterogeneous computing resources, such as Graphic Processing Units or other specialized coprocessors, has become widespread in recent years because of their per- formance and energy efficiency advantages. Approaches for managing and scheduling tasks to heterogeneous resources are still subject to research. Although queuing systems have recently been extended to support accelerator resources, a general solution that manages heterogeneous resources at the operating system- level to exploit a global view of the system state is still missing.In this paper we present a user space scheduler that enables task scheduling and migration on heterogeneous processing resources in Linux. Using run queues for available resources we perform scheduling decisions based on the system state and on task characterization from earlier measurements. With a pro- gramming pattern that supports the integration of checkpoints into applications, we preempt tasks and migrate them between three very different compute resources. Considering static and dynamic workload scenarios, we show that this approach can gain up to 17% performance, on average 7%, by effectively avoiding idle resources. We demonstrate that a work-conserving strategy without migration is no suitable alternative."}],"language":[{"iso":"eng"}],"ddc":["040"]},{"title":"Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract)","date_updated":"2023-09-26T13:27:21Z","date_created":"2017-10-17T12:41:25Z","author":[{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"full_name":"Vaz, Gavin Francis","id":"30332","last_name":"Vaz","first_name":"Gavin Francis"},{"first_name":"Heinrich","id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"year":"2016","citation":{"ama":"Kenter T, Vaz GF, Riebler H, Plessl C. Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract). In: <i>Workshop on Reconfigurable Computing (WRC)</i>. ; 2016.","chicago":"Kenter, Tobias, Gavin Francis Vaz, Heinrich Riebler, and Christian Plessl. “Opportunities for Deferring Application Partitioning and Accelerator Synthesis to Runtime (Extended Abstract).” In <i>Workshop on Reconfigurable Computing (WRC)</i>, 2016.","ieee":"T. Kenter, G. F. Vaz, H. Riebler, and C. Plessl, “Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract),” 2016.","apa":"Kenter, T., Vaz, G. F., Riebler, H., &#38; Plessl, C. (2016). Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract). <i>Workshop on Reconfigurable Computing (WRC)</i>.","bibtex":"@inproceedings{Kenter_Vaz_Riebler_Plessl_2016, title={Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract)}, booktitle={Workshop on Reconfigurable Computing (WRC)}, author={Kenter, Tobias and Vaz, Gavin Francis and Riebler, Heinrich and Plessl, Christian}, year={2016} }","short":"T. Kenter, G.F. Vaz, H. Riebler, C. Plessl, in: Workshop on Reconfigurable Computing (WRC), 2016.","mla":"Kenter, Tobias, et al. “Opportunities for Deferring Application Partitioning and Accelerator Synthesis to Runtime (Extended Abstract).” <i>Workshop on Reconfigurable Computing (WRC)</i>, 2016."},"quality_controlled":"1","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:39:46Z","_id":"171","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"15278","status":"public","file":[{"file_size":54421,"access_level":"closed","file_name":"171-plessl16_fpl_wrc.pdf","file_id":"1538","date_updated":"2018-03-21T12:39:46Z","creator":"florida","date_created":"2018-03-21T12:39:46Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Workshop on Reconfigurable Computing (WRC)","type":"conference"}]