[{"citation":{"apa":"Rudolph, G., Schütze, O., Grimme, C., &#38; Trautmann, H. (2014). A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets. In A. Tantar, E. Tantar, J. Sun, W. Zhang, Q. Ding, O. Schütze, M. Emmerich, P. Legrand, M. P. Del, &#38; C. C. Coello (Eds.), <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V</i> (Vol. 288, pp. 261–273). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-07494-8_18\">https://doi.org/10.1007/978-3-319-07494-8_18</a>","ieee":"G. Rudolph, O. Schütze, C. Grimme, and H. Trautmann, “A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets,” in <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V</i>, vol. 288, A. Tantar, E. Tantar, J. Sun, W. Zhang, Q. Ding, O. Schütze, M. Emmerich, P. Legrand, M. P. Del, and C. C. Coello, Eds. Springer International Publishing, 2014, pp. 261–273.","chicago":"Rudolph, G, O Schütze, C Grimme, and Heike Trautmann. “A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets.” In <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V</i>, edited by A Tantar, E Tantar, J Sun, W Zhang, Q Ding, O Schütze, M Emmerich, P Legrand, Moral P Del, and Coello CA Coello, 288:261–273. Advances in Intelligent Systems and Computing. Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-07494-8_18\">https://doi.org/10.1007/978-3-319-07494-8_18</a>.","short":"G. Rudolph, O. Schütze, C. Grimme, H. Trautmann, in: A. Tantar, E. Tantar, J. Sun, W. Zhang, Q. Ding, O. Schütze, M. Emmerich, P. Legrand, M.P. Del, C.C. Coello (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V, Springer International Publishing, 2014, pp. 261–273.","mla":"Rudolph, G., et al. “A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets.” <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V</i>, edited by A Tantar et al., vol. 288, Springer International Publishing, 2014, pp. 261–273, doi:<a href=\"https://doi.org/10.1007/978-3-319-07494-8_18\">10.1007/978-3-319-07494-8_18</a>.","ama":"Rudolph G, Schütze O, Grimme C, Trautmann H. A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets. In: Tantar A, Tantar E, Sun J, et al., eds. <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V</i>. Vol 288. Advances in Intelligent Systems and Computing. Springer International Publishing; 2014:261–273. doi:<a href=\"https://doi.org/10.1007/978-3-319-07494-8_18\">10.1007/978-3-319-07494-8_18</a>","bibtex":"@inbook{Rudolph_Schütze_Grimme_Trautmann_2014, series={Advances in Intelligent Systems and Computing}, title={A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets}, volume={288}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-07494-8_18\">10.1007/978-3-319-07494-8_18</a>}, booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V}, publisher={Springer International Publishing}, author={Rudolph, G and Schütze, O and Grimme, C and Trautmann, Heike}, editor={Tantar, A and Tantar, E and Sun, J and Zhang, W and Ding, Q and Schütze, O and Emmerich, M and Legrand, P and Del, Moral P and Coello, Coello CA}, year={2014}, pages={261–273}, collection={Advances in Intelligent Systems and Computing} }"},"status":"public","user_id":"15504","volume":288,"editor":[{"last_name":"Tantar","first_name":"A","full_name":"Tantar, A"},{"full_name":"Tantar, E","first_name":"E","last_name":"Tantar"},{"last_name":"Sun","first_name":"J","full_name":"Sun, J"},{"full_name":"Zhang, W","last_name":"Zhang","first_name":"W"},{"full_name":"Ding, Q","first_name":"Q","last_name":"Ding"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"first_name":"M","last_name":"Emmerich","full_name":"Emmerich, M"},{"full_name":"Legrand, P","first_name":"P","last_name":"Legrand"},{"full_name":"Del, Moral P","last_name":"Del","first_name":"Moral P"},{"last_name":"Coello","first_name":"Coello CA","full_name":"Coello, Coello CA"}],"page":"261–273","publisher":"Springer International Publishing","_id":"46382","abstract":[{"text":"The incorporation of expert knowledge into multiobjective optimization is an important issue which in this paper is reflected in terms of an aspiration set consisting of multiple reference points. The behaviour of the recently introduced evolutionary multiobjective algorithm AS-EMOA is analysed in detail and comparatively studied for bi-objective optimization problems w.r.t. R-NSGA2 and a respective variant. It will be shown that the averaged Hausdorff distance, integrated into AS-EMOA, is an efficient means to accurately approximate the desired aspiration set.","lang":"eng"}],"publication":"EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V","type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:33:57Z","date_updated":"2023-10-16T13:43:23Z","intvolume":"       288","title":"A Multiobjective Evolutionary Algorithm Guided by Averaged Hausdorff Distance to Aspiration Sets","year":"2014","publication_identifier":{"isbn":["978-3-319-07493-1"]},"author":[{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"first_name":"C","last_name":"Grimme","full_name":"Grimme, C"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"doi":"10.1007/978-3-319-07494-8_18","series_title":"Advances in Intelligent Systems and Computing","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"We propose an evolutionary multiobjective algorithm that approximates multiple reference points (the aspiration set) in a single run using the concept of the averaged Hausdorff distance."}],"publication":"Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:34:44Z","date_updated":"2023-10-16T13:43:59Z","intvolume":"      8426","year":"2014","title":"An Aspiration Set EMOA Based on Averaged Hausdorff Distances","author":[{"full_name":"Rudolph, Günter","first_name":"Günter","last_name":"Rudolph"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"last_name":"Schütze","first_name":"Oliver","full_name":"Schütze, Oliver"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"ama":"Rudolph G, Grimme C, Schütze O, Trautmann H. An Aspiration Set EMOA Based on Averaged Hausdorff Distances. In: <i>Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)</i>. Vol 8426. Lecture Notes in Computer Science. Springer; 2014:153–156.","bibtex":"@inproceedings{Rudolph_Grimme_Schütze_Trautmann_2014, place={Gainesville, Florida, USA}, series={Lecture Notes in Computer Science}, title={An Aspiration Set EMOA Based on Averaged Hausdorff Distances}, volume={8426}, booktitle={Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)}, publisher={Springer}, author={Rudolph, Günter and Grimme, Christian and Schütze, Oliver and Trautmann, Heike}, year={2014}, pages={153–156}, collection={Lecture Notes in Computer Science} }","mla":"Rudolph, Günter, et al. “An Aspiration Set EMOA Based on Averaged Hausdorff Distances.” <i>Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)</i>, vol. 8426, Springer, 2014, pp. 153–156.","chicago":"Rudolph, Günter, Christian Grimme, Oliver Schütze, and Heike Trautmann. “An Aspiration Set EMOA Based on Averaged Hausdorff Distances.” In <i>Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)</i>, 8426:153–156. Lecture Notes in Computer Science. Gainesville, Florida, USA: Springer, 2014.","short":"G. Rudolph, C. Grimme, O. Schütze, H. Trautmann, in: Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8), Springer, Gainesville, Florida, USA, 2014, pp. 153–156.","apa":"Rudolph, G., Grimme, C., Schütze, O., &#38; Trautmann, H. (2014). An Aspiration Set EMOA Based on Averaged Hausdorff Distances. <i>Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)</i>, <i>8426</i>, 153–156.","ieee":"G. Rudolph, C. Grimme, O. Schütze, and H. Trautmann, “An Aspiration Set EMOA Based on Averaged Hausdorff Distances,” in <i>Proceedings of the Learning and Intelligent OptimizatioN Conference (LION 8)</i>, 2014, vol. 8426, pp. 153–156."},"place":"Gainesville, Florida, USA","status":"public","user_id":"15504","volume":8426,"page":"153–156","_id":"46383","publisher":"Springer"},{"_id":"46384","publisher":"Springer","page":"141–150","volume":8672,"editor":[{"full_name":"Bartz-Beielstein, T","last_name":"Bartz-Beielstein","first_name":"T"},{"full_name":"Branke, J","last_name":"Branke","first_name":"J"},{"full_name":"Filipic, B","last_name":"Filipic","first_name":"B"},{"first_name":"J","last_name":"Smith","full_name":"Smith, J"}],"user_id":"15504","status":"public","place":"Ljubljana, Slovenia","citation":{"ieee":"S. Wessing, M. Preuss, and H. Trautmann, “Stopping Criteria for Multimodal Optimization,” in <i>Proceedings of the Parallel Problem Solving from Nature — PPSN XIII</i>, 2014, vol. 8672, pp. 141–150, doi: <a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">10.1007/978-3-319-10762-2_14</a>.","apa":"Wessing, S., Preuss, M., &#38; Trautmann, H. (2014). Stopping Criteria for Multimodal Optimization. In T. Bartz-Beielstein, J. Branke, B. Filipic, &#38; J. Smith (Eds.), <i>Proceedings of the Parallel Problem Solving from Nature — PPSN XIII</i> (Vol. 8672, pp. 141–150). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">https://doi.org/10.1007/978-3-319-10762-2_14</a>","chicago":"Wessing, S, M Preuss, and Heike Trautmann. “Stopping Criteria for Multimodal Optimization.” In <i>Proceedings of the Parallel Problem Solving from Nature — PPSN XIII</i>, edited by T Bartz-Beielstein, J Branke, B Filipic, and J Smith, 8672:141–150. Lecture Notes in Computer Science. Ljubljana, Slovenia: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">https://doi.org/10.1007/978-3-319-10762-2_14</a>.","short":"S. Wessing, M. Preuss, H. Trautmann, in: T. Bartz-Beielstein, J. Branke, B. Filipic, J. Smith (Eds.), Proceedings of the Parallel Problem Solving from Nature — PPSN XIII, Springer, Ljubljana, Slovenia, 2014, pp. 141–150.","mla":"Wessing, S., et al. “Stopping Criteria for Multimodal Optimization.” <i>Proceedings of the Parallel Problem Solving from Nature — PPSN XIII</i>, edited by T Bartz-Beielstein et al., vol. 8672, Springer, 2014, pp. 141–150, doi:<a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">10.1007/978-3-319-10762-2_14</a>.","bibtex":"@inproceedings{Wessing_Preuss_Trautmann_2014, place={Ljubljana, Slovenia}, series={Lecture Notes in Computer Science}, title={Stopping Criteria for Multimodal Optimization}, volume={8672}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">10.1007/978-3-319-10762-2_14</a>}, booktitle={Proceedings of the Parallel Problem Solving from Nature — PPSN XIII}, publisher={Springer}, author={Wessing, S and Preuss, M and Trautmann, Heike}, editor={Bartz-Beielstein, T and Branke, J and Filipic, B and Smith, J}, year={2014}, pages={141–150}, collection={Lecture Notes in Computer Science} }","ama":"Wessing S, Preuss M, Trautmann H. Stopping Criteria for Multimodal Optimization. In: Bartz-Beielstein T, Branke J, Filipic B, Smith J, eds. <i>Proceedings of the Parallel Problem Solving from Nature — PPSN XIII</i>. Vol 8672. Lecture Notes in Computer Science. Springer; 2014:141–150. doi:<a href=\"https://doi.org/10.1007/978-3-319-10762-2_14\">10.1007/978-3-319-10762-2_14</a>"},"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-10762-2_14","author":[{"first_name":"S","last_name":"Wessing","full_name":"Wessing, S"},{"full_name":"Preuss, M","last_name":"Preuss","first_name":"M"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"}],"title":"Stopping Criteria for Multimodal Optimization","year":"2014","intvolume":"      8672","date_updated":"2023-10-16T13:44:15Z","date_created":"2023-08-04T15:36:01Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","publication":"Proceedings of the Parallel Problem Solving from Nature — PPSN XIII","abstract":[{"lang":"eng","text":"Multimodal optimization requires maintenance of a good search space coverage and approximation of several optima at the same time. We analyze two constitutive optimization algorithms and show that in many cases, a phase transition occurs at some point, so that either diversity collapses or optimization stagnates. But how to derive suitable stopping criteria for multimodal optimization? Experimental results indicate that an algorithm’s population contains sufficient information to estimate the point in time when several performance indicators reach their optimum. Thus, stopping criteria are formulated based on summary characteristics employing objective values and mutation strength."}]},{"citation":{"short":"M. Becker, W. Müller, J. Stroop, U. Kiffmeier, Design, Automation and Test in Europe DATE, University Booth, Dresden (2014).","chicago":"Becker, Markus, Wolfgang Müller, Joachim Stroop, and Ulrich Kiffmeier. “HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC.” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden</i>, 2014.","apa":"Becker, M., Müller, W., Stroop, J., &#38; Kiffmeier, U. (2014). HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC. <i>Design, Automation and Test in Europe DATE, University Booth, Dresden</i>.","ieee":"M. Becker, W. Müller, J. Stroop, and U. Kiffmeier, “HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC,” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden</i>, 2014.","ama":"Becker M, Müller W, Stroop J, Kiffmeier U. HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC. <i>Design, Automation and Test in Europe DATE, University Booth, Dresden</i>. Published online 2014.","bibtex":"@article{Becker_Müller_Stroop_Kiffmeier_2014, title={HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC}, journal={Design, Automation and Test in Europe DATE, University Booth, Dresden}, author={Becker, Markus and Müller, Wolfgang and Stroop, Joachim and Kiffmeier, Ulrich}, year={2014} }","mla":"Becker, Markus, et al. “HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC.” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden</i>, 2014."},"publication":"Design, Automation and Test in Europe DATE, University Booth, Dresden","date_created":"2021-09-30T10:17:43Z","department":[{"_id":"672"}],"type":"journal_article","author":[{"full_name":"Becker, Markus","last_name":"Becker","first_name":"Markus"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"full_name":"Stroop, Joachim","first_name":"Joachim","last_name":"Stroop"},{"first_name":"Ulrich","last_name":"Kiffmeier","full_name":"Kiffmeier, Ulrich"}],"status":"public","year":"2014","title":"HeroeS - A Framework for Heterogeneous Software-Intensive System Design with SystemC","date_updated":"2024-04-18T21:06:21Z","_id":"25164","language":[{"iso":"eng"}],"user_id":"16243"},{"publication":"Proceedings of the 9th ACM symposium on Information, computer and communications security","citation":{"bibtex":"@inproceedings{Fahl_Acar_Perl_Smith_2014, title={Why eve and mallory (also) love webmasters}, DOI={<a href=\"https://doi.org/10.1145/2590296.2590341\">10.1145/2590296.2590341</a>}, booktitle={Proceedings of the 9th ACM symposium on Information, computer and communications security}, publisher={ACM}, author={Fahl, Sascha and Acar, Yasemin and Perl, Henning and Smith, Matthew}, year={2014} }","ama":"Fahl S, Acar Y, Perl H, Smith M. Why eve and mallory (also) love webmasters. In: <i>Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security</i>. ACM; 2014. doi:<a href=\"https://doi.org/10.1145/2590296.2590341\">10.1145/2590296.2590341</a>","mla":"Fahl, Sascha, et al. “Why Eve and Mallory (Also) Love Webmasters.” <i>Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security</i>, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2590296.2590341\">10.1145/2590296.2590341</a>.","short":"S. Fahl, Y. Acar, H. Perl, M. Smith, in: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, ACM, 2014.","chicago":"Fahl, Sascha, Yasemin Acar, Henning Perl, and Matthew Smith. “Why Eve and Mallory (Also) Love Webmasters.” In <i>Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2590296.2590341\">https://doi.org/10.1145/2590296.2590341</a>.","ieee":"S. Fahl, Y. Acar, H. Perl, and M. Smith, “Why eve and mallory (also) love webmasters,” 2014, doi: <a href=\"https://doi.org/10.1145/2590296.2590341\">10.1145/2590296.2590341</a>.","apa":"Fahl, S., Acar, Y., Perl, H., &#38; Smith, M. (2014). Why eve and mallory (also) love webmasters. <i>Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security</i>. <a href=\"https://doi.org/10.1145/2590296.2590341\">https://doi.org/10.1145/2590296.2590341</a>"},"extern":"1","date_created":"2023-09-22T11:56:00Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"year":"2014","status":"public","title":"Why eve and mallory (also) love webmasters","author":[{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"full_name":"Perl, Henning","first_name":"Henning","last_name":"Perl"},{"last_name":"Smith","first_name":"Matthew","full_name":"Smith, Matthew"}],"date_updated":"2024-06-05T13:17:31Z","publication_status":"published","_id":"47162","language":[{"iso":"eng"}],"publisher":"ACM","doi":"10.1145/2590296.2590341","user_id":"14931","alternative_title":["a study on the root causes of SSL misconfigurations"]},{"keyword":["Hardness of approximation","polynomial time hierarchy","succinct set cover","quantum complexity"],"type":"journal_article","department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T11:56:55Z","extern":"1","abstract":[{"text":"The polynomial hierarchy plays a central role in classical complexity theory. Here, we define\r\na quantum generalization of the polynomial hierarchy, and initiate its study. We show that\r\nnot only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using the same techniques, we\r\nalso obtain hardness of approximation for the class QCMA. Our approach is based on the\r\nuse of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomial hierarchy [Umans, FOCS 1999].\r\nThe problems for which we prove hardness of approximation for include, among others, a\r\nquantum version of the Succinct Set Cover problem, and a variant of the local Hamiltonian\r\nproblem with hybrid classical-quantum ground states.","lang":"eng"}],"issue":"5-6","publication":"Quantum Information & Computation","main_file_link":[{"url":"https://arxiv.org/abs/1209.1055","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-02-28T11:02:47Z","article_type":"original","intvolume":"        14","year":"2014","title":"Hardness of approximation for quantum problems","author":[{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","first_name":"Sevag","last_name":"Gharibian"},{"full_name":"Kempe, Julia","last_name":"Kempe","first_name":"Julia"}],"oa":"1","external_id":{"arxiv":["1209.1055"]},"citation":{"ama":"Gharibian S, Kempe J. Hardness of approximation for quantum problems. <i>Quantum Information &#38; Computation</i>. 2014;14(5-6):517-540.","bibtex":"@article{Gharibian_Kempe_2014, title={Hardness of approximation for quantum problems}, volume={14}, number={5–6}, journal={Quantum Information &#38; Computation}, author={Gharibian, Sevag and Kempe, Julia}, year={2014}, pages={517–540} }","mla":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 5–6, 2014, pp. 517–40.","chicago":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” <i>Quantum Information &#38; Computation</i> 14, no. 5–6 (2014): 517–40.","short":"S. Gharibian, J. Kempe, Quantum Information &#38; Computation 14 (2014) 517–540.","apa":"Gharibian, S., &#38; Kempe, J. (2014). Hardness of approximation for quantum problems. <i>Quantum Information &#38; Computation</i>, <i>14</i>(5–6), 517–540.","ieee":"S. Gharibian and J. Kempe, “Hardness of approximation for quantum problems,” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 5–6, pp. 517–540, 2014."},"user_id":"71541","volume":14,"page":"517-540","_id":"8171","status":"public"},{"oa":"1","external_id":{"arxiv":["1211.4637"]},"citation":{"mla":"W. Berry, Dominic, et al. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, 2014, pp. 1–30.","apa":"W. Berry, D., Cleve, R., &#38; Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>, <i>14</i>(1–2), 1–30.","ieee":"D. W. Berry, R. Cleve, and S. Gharibian, “Gate-efficient discrete simulations of continuous-time quantum query algorithms,” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, pp. 1–30, 2014.","chicago":"W. Berry, Dominic, Richard Cleve, and Sevag Gharibian. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i> 14, no. 1–2 (2014): 1–30.","short":"D. W. Berry, R. Cleve, S. Gharibian, Quantum Information &#38; Computation 14 (2014) 1–30.","ama":"W. Berry D, Cleve R, Gharibian S. Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>. 2014;14(1-2):1-30.","bibtex":"@article{W. Berry_Cleve_Gharibian_2014, title={Gate-efficient discrete simulations of continuous-time quantum query algorithms}, volume={14}, number={1–2}, journal={Quantum Information &#38; Computation}, author={W. Berry, Dominic and Cleve, Richard and Gharibian, Sevag}, year={2014}, pages={1–30} }"},"user_id":"71541","volume":14,"page":"1-30","_id":"8172","status":"public","type":"journal_article","department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T11:59:24Z","extern":"1","abstract":[{"lang":"eng","text":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar running time."}],"publication":"Quantum Information & Computation","issue":"1-2","main_file_link":[{"url":"https://arxiv.org/abs/1211.4637","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-02-28T11:02:58Z","article_type":"original","intvolume":"        14","year":"2014","title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","author":[{"last_name":"W. Berry","first_name":"Dominic","full_name":"W. Berry, Dominic"},{"full_name":"Cleve, Richard","last_name":"Cleve","first_name":"Richard"},{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag"}]},{"page":"123-144","publisher":"Wilhelm Fink","_id":"335","ddc":["040"],"user_id":"15278","editor":[{"full_name":"Künsemöller, Jörn","last_name":"Künsemöller","first_name":"Jörn"},{"full_name":"Eke, Norber Otto","last_name":"Eke","first_name":"Norber Otto"},{"full_name":"Foit, Lioba","last_name":"Foit","first_name":"Lioba"},{"first_name":"Timo","last_name":"Kaerlein","full_name":"Kaerlein, Timo"}],"status":"public","has_accepted_license":"1","place":"Paderborn","file_date_updated":"2018-03-20T07:29:58Z","citation":{"bibtex":"@inbook{Platzner_Plessl_2014, place={Paderborn}, series={Schriftenreihe des Graduiertenkollegs “Automatismen”}, title={Verschiebungen an der Grenze zwischen Hardware und Software}, booktitle={Logiken strukturbildender Prozesse: Automatismen}, publisher={Wilhelm Fink}, author={Platzner, Marco and Plessl, Christian}, editor={Künsemöller, Jörn and Eke, Norber Otto and Foit, Lioba and Kaerlein, Timo}, year={2014}, pages={123–144}, collection={Schriftenreihe des Graduiertenkollegs “Automatismen”} }","short":"M. Platzner, C. Plessl, in: J. Künsemöller, N.O. Eke, L. Foit, T. Kaerlein (Eds.), Logiken strukturbildender Prozesse: Automatismen, Wilhelm Fink, Paderborn, 2014, pp. 123–144.","ama":"Platzner M, Plessl C. Verschiebungen an der Grenze zwischen Hardware und Software. In: Künsemöller J, Eke NO, Foit L, Kaerlein T, eds. <i>Logiken strukturbildender Prozesse: Automatismen</i>. Schriftenreihe des Graduiertenkollegs “Automatismen.” Wilhelm Fink; 2014:123-144.","chicago":"Platzner, Marco, and Christian Plessl. “Verschiebungen an der Grenze zwischen Hardware und Software.” In <i>Logiken strukturbildender Prozesse: Automatismen</i>, edited by Jörn Künsemöller, Norber Otto Eke, Lioba Foit, and Timo Kaerlein, 123–44. Schriftenreihe des Graduiertenkollegs “Automatismen.” Paderborn: Wilhelm Fink, 2014.","ieee":"M. Platzner and C. Plessl, “Verschiebungen an der Grenze zwischen Hardware und Software,” in <i>Logiken strukturbildender Prozesse: Automatismen</i>, J. Künsemöller, N. O. Eke, L. Foit, and T. Kaerlein, Eds. Paderborn: Wilhelm Fink, 2014, pp. 123–144.","mla":"Platzner, Marco, and Christian Plessl. “Verschiebungen an der Grenze zwischen Hardware und Software.” <i>Logiken strukturbildender Prozesse: Automatismen</i>, edited by Jörn Künsemöller et al., Wilhelm Fink, 2014, pp. 123–44.","apa":"Platzner, M., &#38; Plessl, C. (2014). Verschiebungen an der Grenze zwischen Hardware und Software. In J. Künsemöller, N. O. Eke, L. Foit, &#38; T. Kaerlein (Eds.), <i>Logiken strukturbildender Prozesse: Automatismen</i> (pp. 123–144). Wilhelm Fink."},"quality_controlled":"1","project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"ger"}],"series_title":"Schriftenreihe des Graduiertenkollegs \"Automatismen\"","year":"2014","title":"Verschiebungen an der Grenze zwischen Hardware und Software","author":[{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153"}],"publication_identifier":{"isbn":["978-3-7705-5730-1"]},"date_updated":"2023-09-26T13:32:49Z","publication_status":"published","file":[{"file_id":"1424","content_type":"application/pdf","success":1,"file_name":"335-2014_plessl_automatismen.pdf","access_level":"closed","file_size":2848154,"relation":"main_file","date_updated":"2018-03-20T07:29:58Z","date_created":"2018-03-20T07:29:58Z","creator":"florida"}],"date_created":"2017-10-17T12:41:57Z","type":"book_chapter","department":[{"_id":"518"},{"_id":"27"},{"_id":"78"}],"publication":"Logiken strukturbildender Prozesse: Automatismen","abstract":[{"lang":"eng","text":"Im Bereich der Computersysteme ist die Festlegung der Grenze zwischen Hardware und Software eine zentrale Problemstellung. Diese Grenze hat in den letzten Jahrzehnten nicht nur die Entwicklung von Computersystemen bestimmt, sondern auch die Strukturierung der Ausbildung in den Computerwissenschaften beeinflusst und sogar zur Entstehung von neuen Forschungsrichtungen gef{\\\"u}hrt. In diesem Beitrag besch{\\\"a}ftigen wir uns mit Verschiebungen an der Grenze zwischen Hardware und Software und diskutieren insgesamt drei qualitativ unterschiedliche Formen solcher Verschiebungen. Wir beginnen mit der Entwicklung von Computersystemen im letzten Jahrhundert und der Entstehung dieser Grenze, die Hardware und Software erst als eigenst{\\\"a}ndige Produkte differenziert. Dann widmen wir uns der Frage, welche Funktionen in einem Computersystem besser in Hardware und welche besser in Software realisiert werden sollten, eine Fragestellung die zu Beginn der 90er-Jahre zur Bildung einer eigenen Forschungsrichtung, dem sogenannten Hardware/Software Co-design, gef{\\\"u}hrt hat. Im Hardware/Software Co-design findet eine Verschiebung von Funktionen an der Grenze zwischen Hardware und Software w{\\\"a}hrend der Entwicklung eines Produktes statt, um Produkteigenschaften zu optimieren. Im fertig entwickelten und eingesetzten Produkt hingegen k{\\\"o}nnen wir dann eine feste Grenze zwischen Hardware und Software beobachten. Im dritten Teil dieses Beitrags stellen wir mit selbst-adaptiven Systemen eine hochaktuelle Forschungsrichtung vor. In unserem Kontext bedeutet Selbstadaption, dass ein System Verschiebungen von Funktionen an der Grenze zwischen Hardware und Software autonom w{\\\"a}hrend der Betriebszeit vornimmt. Solche Systeme beruhen auf rekonfigurierbarer Hardware, einer relativ neuen Technologie mit der die Hardware eines Computers w{\\\"a}hrend der Laufzeit ver{\\\"a}ndert werden kann. Diese Technologie f{\\\"u}hrt zu einer durchl{\\\"a}ssigen Grenze zwischen Hardware und Software bzw. l{\\\"o}st sie die herk{\\\"o}mmliche Vorstellung einer festen Hardware und einer flexiblen Software damit auf."}]},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:07Z","file":[{"date_created":"2018-03-20T07:02:02Z","creator":"florida","file_id":"1387","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:02:02Z","file_name":"388-plessl14_arc.pdf","access_level":"closed","file_size":330193}],"abstract":[{"text":"In order to leverage the use of reconfigurable architectures in general-purpose computing, quick and automated methods to find suitable accelerator designs are required. We tackle this challenge in both regards. In order to avoid long synthesis times, we target a vector copro- cessor, implemented on the FPGAs of a Convey HC-1. Previous studies showed that existing tools were not able to accelerate a real-world application with low effort. We present a toolflow to automatically identify suitable loops for vectorization, generate a corresponding hardware/software bipartition, and generate coprocessor code. Where applicable, we leverage outer-loop vectorization. We evaluate our tools with a set of characteristic loops, systematically analyzing different dependency and data layout properties.","lang":"eng"}],"publication":"Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)","doi":"10.1007/978-3-319-05960-0_13","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science (LNCS)","intvolume":"      8405","date_updated":"2023-09-26T13:34:08Z","author":[{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"id":"30332","last_name":"Vaz","first_name":"Gavin Francis","full_name":"Vaz, Gavin Francis"},{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"}],"title":"Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer","year":"2014","place":"Cham","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_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"}],"quality_controlled":"1","citation":{"mla":"Kenter, Tobias, et al. “Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer.” <i>Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)</i>, vol. 8405, Springer International Publishing, 2014, pp. 144–55, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">10.1007/978-3-319-05960-0_13</a>.","bibtex":"@inproceedings{Kenter_Vaz_Plessl_2014, place={Cham}, series={Lecture Notes in Computer Science (LNCS)}, title={Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer}, volume={8405}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">10.1007/978-3-319-05960-0_13</a>}, booktitle={Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)}, publisher={Springer International Publishing}, author={Kenter, Tobias and Vaz, Gavin Francis and Plessl, Christian}, year={2014}, pages={144–155}, collection={Lecture Notes in Computer Science (LNCS)} }","ama":"Kenter T, Vaz GF, Plessl C. Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer. In: <i>Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)</i>. Vol 8405. Lecture Notes in Computer Science (LNCS). Springer International Publishing; 2014:144-155. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">10.1007/978-3-319-05960-0_13</a>","ieee":"T. Kenter, G. F. Vaz, and C. Plessl, “Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer,” in <i>Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)</i>, 2014, vol. 8405, pp. 144–155, doi: <a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">10.1007/978-3-319-05960-0_13</a>.","apa":"Kenter, T., Vaz, G. F., &#38; Plessl, C. (2014). Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer. <i>Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)</i>, <i>8405</i>, 144–155. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">https://doi.org/10.1007/978-3-319-05960-0_13</a>","short":"T. Kenter, G.F. Vaz, C. Plessl, in: Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC), Springer International Publishing, Cham, 2014, pp. 144–155.","chicago":"Kenter, Tobias, Gavin Francis Vaz, and Christian Plessl. “Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer.” In <i>Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)</i>, 8405:144–55. Lecture Notes in Computer Science (LNCS). Cham: Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_13\">https://doi.org/10.1007/978-3-319-05960-0_13</a>."},"file_date_updated":"2018-03-20T07:02:02Z","volume":8405,"ddc":["040"],"user_id":"15278","_id":"388","publisher":"Springer International Publishing","page":"144-155","has_accepted_license":"1","status":"public"},{"status":"public","has_accepted_license":"1","page":"911-919","_id":"363","publisher":"Elsevier","ddc":["040"],"user_id":"15278","volume":38,"file_date_updated":"2018-03-20T07:20:31Z","citation":{"apa":"Agne, A., Hangmann, H., Happe, M., Platzner, M., &#38; Plessl, C. (2014). Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators. <i>Microprocessors and Microsystems</i>, <i>38</i>(8, Part B), 911–919. <a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">https://doi.org/10.1016/j.micpro.2013.12.001</a>","ieee":"A. Agne, H. Hangmann, M. Happe, M. Platzner, and C. Plessl, “Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators,” <i>Microprocessors and Microsystems</i>, vol. 38, no. 8, Part B, pp. 911–919, 2014, doi: <a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">10.1016/j.micpro.2013.12.001</a>.","chicago":"Agne, Andreas, Hendrik Hangmann, Markus Happe, Marco Platzner, and Christian Plessl. “Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators.” <i>Microprocessors and Microsystems</i> 38, no. 8, Part B (2014): 911–19. <a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">https://doi.org/10.1016/j.micpro.2013.12.001</a>.","short":"A. Agne, H. Hangmann, M. Happe, M. Platzner, C. Plessl, Microprocessors and Microsystems 38 (2014) 911–919.","mla":"Agne, Andreas, et al. “Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators.” <i>Microprocessors and Microsystems</i>, vol. 38, no. 8, Part B, Elsevier, 2014, pp. 911–19, doi:<a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">10.1016/j.micpro.2013.12.001</a>.","ama":"Agne A, Hangmann H, Happe M, Platzner M, Plessl C. Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators. <i>Microprocessors and Microsystems</i>. 2014;38(8, Part B):911-919. doi:<a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">10.1016/j.micpro.2013.12.001</a>","bibtex":"@article{Agne_Hangmann_Happe_Platzner_Plessl_2014, title={Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators}, volume={38}, DOI={<a href=\"https://doi.org/10.1016/j.micpro.2013.12.001\">10.1016/j.micpro.2013.12.001</a>}, number={8, Part B}, journal={Microprocessors and Microsystems}, publisher={Elsevier}, author={Agne, Andreas and Hangmann, Hendrik and Happe, Markus and Platzner, Marco and Plessl, Christian}, year={2014}, pages={911–919} }"},"quality_controlled":"1","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","grant_number":"257906","_id":"31"}],"title":"Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators","year":"2014","author":[{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Hangmann, Hendrik","first_name":"Hendrik","last_name":"Hangmann"},{"full_name":"Happe, Markus","first_name":"Markus","last_name":"Happe"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian"}],"date_updated":"2023-09-26T13:33:06Z","intvolume":"        38","language":[{"iso":"eng"}],"doi":"10.1016/j.micpro.2013.12.001","publication":"Microprocessors and Microsystems","issue":"8, Part B","abstract":[{"text":"Due to the continuously shrinking device structures and increasing densities of FPGAs, thermal aspects have become the new focus for many research projects over the last years. Most researchers rely on temperature simulations to evaluate their novel thermal management techniques. However, these temperature simulations require a high computational effort if a detailed thermal model is used and their accuracies are often unclear. In contrast to simulations, the use of synthetic heat sources allows for experimental evaluation of temperature management methods. In this paper we investigate the creation of significant rises in temperature on modern FPGAs to enable future evaluation of thermal management techniques based on experiments. To that end, we have developed seven different heat-generating cores that use different subsets of FPGA resources. Our experimental results show that, according to external temperature probes connected to the FPGA’s heat sink, we can increase the temperature by an average of 81 !C. This corresponds to an average increase of 156.3 !C as measured by the built-in thermal diodes of our Virtex-5 FPGAs in less than 30 min by only utilizing about 21 percent of the slices.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1408","date_updated":"2018-03-20T07:20:31Z","relation":"main_file","access_level":"closed","file_size":1499996,"file_name":"363-plessl13_micpro.pdf","date_created":"2018-03-20T07:20:31Z","creator":"florida"}],"date_created":"2017-10-17T12:42:02Z","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}]},{"file":[{"content_type":"application/pdf","success":1,"file_id":"1397","date_updated":"2018-03-20T07:14:20Z","relation":"main_file","access_level":"closed","file_size":1003907,"file_name":"377-FCCM14.pdf","date_created":"2018-03-20T07:14:20Z","creator":"florida"}],"date_created":"2017-10-17T12:42:05Z","type":"conference","keyword":["coldboot"],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"publication":"Proceedings of Field-Programmable Custom Computing Machines (FCCM)","abstract":[{"text":"In this paper, we study how AES key schedules can be reconstructed from decayed memory. This operation is a crucial and time consuming operation when trying to break encryption systems with cold-boot attacks. In software, the reconstruction of the AES master key can be performed using a recursive, branch-and-bound tree-search algorithm that exploits redundancies in the key schedule for constraining the search space. In this work, we investigate how this branch-and-bound algorithm can be accelerated with FPGAs. We translated the recursive search procedure to a state machine with an explicit stack for each recursion level and create optimized datapaths to accelerate in particular the processing of the most frequently accessed tree levels. We support two different decay models, of which especially the more realistic non-idealized asymmetric decay model causes very high runtimes in software. Our implementation on a Maxeler dataflow computing system outperforms a software implementation for this model by up to 27x, which makes cold-boot attacks against AES practical even for high error rates.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1109/FCCM.2014.67","year":"2014","title":"Reconstructing AES Key Schedules from Decayed Memory with FPGAs","author":[{"id":"8961","last_name":"Riebler","first_name":"Heinrich","full_name":"Riebler, Heinrich"},{"full_name":"Kenter, Tobias","first_name":"Tobias","last_name":"Kenter","id":"3145"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"last_name":"Sorge","first_name":"Christoph","full_name":"Sorge, Christoph"}],"date_updated":"2023-09-26T13:33:50Z","file_date_updated":"2018-03-20T07:14:20Z","citation":{"apa":"Riebler, H., Kenter, T., Plessl, C., &#38; Sorge, C. (2014). Reconstructing AES Key Schedules from Decayed Memory with FPGAs. <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 222–229. <a href=\"https://doi.org/10.1109/FCCM.2014.67\">https://doi.org/10.1109/FCCM.2014.67</a>","ieee":"H. Riebler, T. Kenter, C. Plessl, and C. Sorge, “Reconstructing AES Key Schedules from Decayed Memory with FPGAs,” in <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 2014, pp. 222–229, doi: <a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>.","chicago":"Riebler, Heinrich, Tobias Kenter, Christian Plessl, and Christoph Sorge. “Reconstructing AES Key Schedules from Decayed Memory with FPGAs.” In <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 222–29. IEEE, 2014. <a href=\"https://doi.org/10.1109/FCCM.2014.67\">https://doi.org/10.1109/FCCM.2014.67</a>.","short":"H. Riebler, T. Kenter, C. Plessl, C. Sorge, in: Proceedings of Field-Programmable Custom Computing Machines (FCCM), IEEE, 2014, pp. 222–229.","mla":"Riebler, Heinrich, et al. “Reconstructing AES Key Schedules from Decayed Memory with FPGAs.” <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE, 2014, pp. 222–29, doi:<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>.","ama":"Riebler H, Kenter T, Plessl C, Sorge C. Reconstructing AES Key Schedules from Decayed Memory with FPGAs. In: <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE; 2014:222-229. doi:<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>","bibtex":"@inproceedings{Riebler_Kenter_Plessl_Sorge_2014, title={Reconstructing AES Key Schedules from Decayed Memory with FPGAs}, DOI={<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>}, booktitle={Proceedings of Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Plessl, Christian and Sorge, Christoph}, year={2014}, pages={222–229} }"},"quality_controlled":"1","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34","grant_number":"610996"}],"page":"222-229","publisher":"IEEE","_id":"377","user_id":"15278","ddc":["040"],"status":"public","has_accepted_license":"1"},{"doi":"10.1145/2617596","article_number":"13","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:33:31Z","intvolume":"         7","title":"Self-awareness as a Model for Designing and Operating Heterogeneous Multicores","year":"2014","author":[{"last_name":"Agne","first_name":"Andreas","full_name":"Agne, Andreas"},{"full_name":"Happe, Markus","first_name":"Markus","last_name":"Happe"},{"id":"43646","first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim"},{"id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"type":"journal_article","department":[{"_id":"27"},{"_id":"78"},{"_id":"518"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:19:19Z","relation":"main_file","date_updated":"2018-03-20T07:19:19Z","file_name":"365-plessl14_trets_01.pdf","file_size":916052,"access_level":"closed","file_id":"1406","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:42:03Z","abstract":[{"lang":"eng","text":"Self-aware computing is a paradigm for structuring and simplifying the design and operation of computing systems that face unprecedented levels of system dynamics and thus require novel forms of adaptivity. The generality of the paradigm makes it applicable to many types of computing systems and, previously, researchers started to introduce concepts of self-awareness to multicore architectures. In our work we build on a recent reference architectural framework as a model for self-aware computing and instantiate it for an FPGA-based heterogeneous multicore running the ReconOS reconfigurable architecture and operating system. After presenting the model for self-aware computing and ReconOS, we demonstrate with a case study how a multicore application built on the principle of self-awareness, autonomously adapts to changes in the workload and system state. Our work shows that the reference architectural framework as a model for self-aware computing can be practically applied and allows us to structure and simplify the design process, which is essential for designing complex future computing systems."}],"issue":"2","publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","ddc":["040"],"user_id":"15278","volume":7,"_id":"365","publisher":"ACM","has_accepted_license":"1","status":"public","quality_controlled":"1","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"file_date_updated":"2018-03-20T07:19:19Z","citation":{"bibtex":"@article{Agne_Happe_Lösch_Plessl_Platzner_2014, title={Self-awareness as a Model for Designing and Operating Heterogeneous Multicores}, volume={7}, DOI={<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>}, number={213}, journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={ACM}, author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian and Platzner, Marco}, year={2014} }","ama":"Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-awareness as a Model for Designing and Operating Heterogeneous Multicores. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>. 2014;7(2). doi:<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>","mla":"Agne, Andreas, et al. “Self-Awareness as a Model for Designing and Operating Heterogeneous Multicores.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 7, no. 2, 13, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>.","chicago":"Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco Platzner. “Self-Awareness as a Model for Designing and Operating Heterogeneous Multicores.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i> 7, no. 2 (2014). <a href=\"https://doi.org/10.1145/2617596\">https://doi.org/10.1145/2617596</a>.","short":"A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, ACM Transactions on Reconfigurable Technology and Systems (TRETS) 7 (2014).","ieee":"A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-awareness as a Model for Designing and Operating Heterogeneous Multicores,” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 7, no. 2, Art. no. 13, 2014, doi: <a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>.","apa":"Agne, A., Happe, M., Lösch, A., Plessl, C., &#38; Platzner, M. (2014). Self-awareness as a Model for Designing and Operating Heterogeneous Multicores. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, <i>7</i>(2), Article 13. <a href=\"https://doi.org/10.1145/2617596\">https://doi.org/10.1145/2617596</a>"}},{"citation":{"apa":"Agne, A., Happe, M., Keller, A., Lübbers, E., Plattner, B., Platzner, M., &#38; Plessl, C. (2014). ReconOS - An Operating System Approach for Reconfigurable Computing. <i>IEEE Micro</i>, <i>34</i>(1), 60–71. <a href=\"https://doi.org/10.1109/MM.2013.110\">https://doi.org/10.1109/MM.2013.110</a>","ieee":"A. Agne <i>et al.</i>, “ReconOS - An Operating System Approach for Reconfigurable Computing,” <i>IEEE Micro</i>, vol. 34, no. 1, pp. 60–71, 2014, doi: <a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>.","short":"A. Agne, M. Happe, A. Keller, E. Lübbers, B. Plattner, M. Platzner, C. Plessl, IEEE Micro 34 (2014) 60–71.","chicago":"Agne, Andreas, Markus Happe, Ariane Keller, Enno Lübbers, Bernhard Plattner, Marco Platzner, and Christian Plessl. “ReconOS - An Operating System Approach for Reconfigurable Computing.” <i>IEEE Micro</i> 34, no. 1 (2014): 60–71. <a href=\"https://doi.org/10.1109/MM.2013.110\">https://doi.org/10.1109/MM.2013.110</a>.","mla":"Agne, Andreas, et al. “ReconOS - An Operating System Approach for Reconfigurable Computing.” <i>IEEE Micro</i>, vol. 34, no. 1, IEEE, 2014, pp. 60–71, doi:<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>.","ama":"Agne A, Happe M, Keller A, et al. ReconOS - An Operating System Approach for Reconfigurable Computing. <i>IEEE Micro</i>. 2014;34(1):60-71. doi:<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>","bibtex":"@article{Agne_Happe_Keller_Lübbers_Plattner_Platzner_Plessl_2014, title={ReconOS - An Operating System Approach for Reconfigurable Computing}, volume={34}, DOI={<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>}, number={1}, journal={IEEE Micro}, publisher={IEEE}, author={Agne, Andreas and Happe, Markus and Keller, Ariane and Lübbers, Enno and Plattner, Bernhard and Platzner, Marco and Plessl, Christian}, year={2014}, pages={60–71} }"},"file_date_updated":"2018-03-20T07:31:40Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"quality_controlled":"1","status":"public","has_accepted_license":"1","publisher":"IEEE","_id":"328","page":"60-71","volume":34,"ddc":["040"],"user_id":"15278","issue":"1","publication":"IEEE Micro","abstract":[{"lang":"eng","text":"The ReconOS operating system for reconfigurable computing offers a unified multi-threaded programming model and operating system services for threads executing in software and threads mapped to reconfigurable hardware. The operating system interface allows hardware threads to interact with software threads using well-known mechanisms such as semaphores, mutexes, condition variables, and message queues. By semantically integrating 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"}],"date_created":"2017-10-17T12:41:55Z","file":[{"date_created":"2018-03-20T07:31:40Z","creator":"florida","file_id":"1426","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:31:40Z","file_name":"328-plessl14_micro_01.pdf","file_size":1877185,"access_level":"closed"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"journal_article","author":[{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"first_name":"Markus","last_name":"Happe","full_name":"Happe, Markus"},{"last_name":"Keller","first_name":"Ariane","full_name":"Keller, Ariane"},{"first_name":"Enno","last_name":"Lübbers","full_name":"Lübbers, Enno"},{"full_name":"Plattner, Bernhard","first_name":"Bernhard","last_name":"Plattner"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"title":"ReconOS - An Operating System Approach for Reconfigurable Computing","year":"2014","intvolume":"        34","date_updated":"2023-09-26T13:32:31Z","language":[{"iso":"eng"}],"doi":"10.1109/MM.2013.110"},{"date_created":"2018-03-26T13:40:14Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"publication":"Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)","citation":{"apa":"C. Durelli, G., Pogliani, M., Miele, A., Plessl, C., Riebler, H., Vaz, G. F., D. Santambrogio, M., &#38; Bolchini, C. (2014). Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach. <i>Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)</i>, 142–149. <a href=\"https://doi.org/10.1109/ISPA.2014.27\">https://doi.org/10.1109/ISPA.2014.27</a>","mla":"C. Durelli, Gianluca, et al. “Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach.” <i>Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)</i>, IEEE, 2014, pp. 142–49, doi:<a href=\"https://doi.org/10.1109/ISPA.2014.27\">10.1109/ISPA.2014.27</a>.","ieee":"G. C. Durelli <i>et al.</i>, “Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach,” in <i>Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)</i>, 2014, pp. 142–149, doi: <a href=\"https://doi.org/10.1109/ISPA.2014.27\">10.1109/ISPA.2014.27</a>.","chicago":"C. Durelli, Gianluca, Marcello Pogliani, Antonio Miele, Christian Plessl, Heinrich Riebler, Gavin Francis Vaz, Marco D. Santambrogio, and Cristiana Bolchini. “Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach.” In <i>Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)</i>, 142–49. IEEE, 2014. <a href=\"https://doi.org/10.1109/ISPA.2014.27\">https://doi.org/10.1109/ISPA.2014.27</a>.","short":"G. C. Durelli, M. Pogliani, A. Miele, C. Plessl, H. Riebler, G.F. Vaz, M. D. Santambrogio, C. Bolchini, in: Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA), IEEE, 2014, pp. 142–149.","ama":"C. Durelli G, Pogliani M, Miele A, et al. Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach. In: <i>Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)</i>. IEEE; 2014:142-149. doi:<a href=\"https://doi.org/10.1109/ISPA.2014.27\">10.1109/ISPA.2014.27</a>","bibtex":"@inproceedings{C. Durelli_Pogliani_Miele_Plessl_Riebler_Vaz_D. Santambrogio_Bolchini_2014, title={Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach}, DOI={<a href=\"https://doi.org/10.1109/ISPA.2014.27\">10.1109/ISPA.2014.27</a>}, booktitle={Proc. Int. Symp. on Parallel and Distributed Processing with Applications (ISPA)}, publisher={IEEE}, author={C. Durelli, Gianluca and Pogliani, Marcello and Miele, Antonio and Plessl, Christian and Riebler, Heinrich and Vaz, Gavin Francis and D. Santambrogio, Marco and Bolchini, Cristiana}, year={2014}, pages={142–149} }"},"quality_controlled":"1","project":[{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34","grant_number":"610996"}],"page":"142-149","publisher":"IEEE","_id":"1778","language":[{"iso":"eng"}],"user_id":"15278","doi":"10.1109/ISPA.2014.27","title":"Runtime Resource Management in Heterogeneous System Architectures: The SAVE Approach","year":"2014","status":"public","author":[{"last_name":"C. Durelli","first_name":"Gianluca","full_name":"C. Durelli, Gianluca"},{"last_name":"Pogliani","first_name":"Marcello","full_name":"Pogliani, Marcello"},{"full_name":"Miele, Antonio","first_name":"Antonio","last_name":"Miele"},{"orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"full_name":"Riebler, Heinrich","first_name":"Heinrich","last_name":"Riebler","id":"8961"},{"last_name":"Vaz","first_name":"Gavin Francis","full_name":"Vaz, Gavin Francis","id":"30332"},{"full_name":"D. Santambrogio, Marco","last_name":"D. Santambrogio","first_name":"Marco"},{"full_name":"Bolchini, Cristiana","last_name":"Bolchini","first_name":"Cristiana"}],"date_updated":"2023-09-26T13:35:40Z"},{"ddc":["040"],"user_id":"15278","publisher":"IEEE","_id":"439","page":"1-8","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"34","grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"quality_controlled":"1","citation":{"chicago":"Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl. “Deferring Accelerator Offloading Decisions to Application Runtime.” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2014. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">https://doi.org/10.1109/ReConFig.2014.7032509</a>.","short":"G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.","apa":"Vaz, G. F., Riebler, H., Kenter, T., &#38; Plessl, C. (2014). Deferring Accelerator Offloading Decisions to Application Runtime. <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">https://doi.org/10.1109/ReConFig.2014.7032509</a>","ieee":"G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Deferring Accelerator Offloading Decisions to Application Runtime,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>.","ama":"Vaz GF, Riebler H, Kenter T, Plessl C. Deferring Accelerator Offloading Decisions to Application Runtime. In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2014:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>","bibtex":"@inproceedings{Vaz_Riebler_Kenter_Plessl_2014, title={Deferring Accelerator Offloading Decisions to Application Runtime}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Vaz, Gavin Francis and Riebler, Heinrich and Kenter, Tobias and Plessl, Christian}, year={2014}, pages={1–8} }","mla":"Vaz, Gavin Francis, et al. “Deferring Accelerator Offloading Decisions to Application Runtime.” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2014, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>."},"file_date_updated":"2018-03-16T11:29:52Z","doi":"10.1109/ReConFig.2014.7032509","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:37:02Z","author":[{"id":"30332","last_name":"Vaz","first_name":"Gavin Francis","full_name":"Vaz, Gavin Francis"},{"id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich","last_name":"Riebler"},{"full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias","id":"3145"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"title":"Deferring Accelerator Offloading Decisions to Application Runtime","year":"2014","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:17Z","file":[{"file_id":"1353","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-16T11:29:52Z","file_name":"439-plessl14a_reconfig.pdf","access_level":"closed","file_size":557362,"date_created":"2018-03-16T11:29:52Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Reconfigurable architectures provide an opportunityto accelerate a wide range of applications, frequentlyby exploiting data-parallelism, where the same operations arehomogeneously executed on a (large) set of data. However, whenthe sequential code is executed on a host CPU and only dataparallelloops are executed on an FPGA coprocessor, a sufficientlylarge number of loop iterations (trip counts) is required, such thatthe control- and data-transfer overheads to the coprocessor canbe amortized. However, the trip count of large data-parallel loopsis frequently not known at compile time, but only at runtime justbefore entering a loop. Therefore, we propose to generate codeboth for the CPU and the coprocessor, and to defer the decisionwhere to execute the appropriate code to the runtime of theapplication when the trip count of the loop can be determinedjust at runtime. We demonstrate how an LLVM compiler basedtoolflow can automatically insert appropriate decision blocks intothe application code. Analyzing popular benchmark suites, weshow that this kind of runtime decisions is often applicable. Thepractical feasibility of our approach is demonstrated by a toolflowthat automatically identifies loops suitable for vectorization andgenerates code for the FPGA coprocessor of a Convey HC-1. Thetoolflow adds decisions based on a comparison of the runtimecomputedtrip counts to thresholds for specific loops and alsoincludes support to move just the required data to the coprocessor.We evaluate the integrated toolflow with characteristic loopsexecuted on different input data sizes."}],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)"},{"status":"public","has_accepted_license":"1","publisher":"IEEE","_id":"406","page":"1-8","ddc":["040"],"user_id":"15278","citation":{"apa":"Kenter, T., Schmitz, H., &#38; Plessl, C. (2014). Kernel-Centric Acceleration of High Accuracy Stereo-Matching. <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">https://doi.org/10.1109/ReConFig.2014.7032535</a>","mla":"Kenter, Tobias, et al. “Kernel-Centric Acceleration of High Accuracy Stereo-Matching.” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2014, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>.","ieee":"T. Kenter, H. Schmitz, and C. Plessl, “Kernel-Centric Acceleration of High Accuracy Stereo-Matching,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>.","chicago":"Kenter, Tobias, Henning Schmitz, and Christian Plessl. “Kernel-Centric Acceleration of High Accuracy Stereo-Matching.” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2014. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">https://doi.org/10.1109/ReConFig.2014.7032535</a>.","ama":"Kenter T, Schmitz H, Plessl C. Kernel-Centric Acceleration of High Accuracy Stereo-Matching. In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2014:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>","short":"T. Kenter, H. Schmitz, C. Plessl, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.","bibtex":"@inproceedings{Kenter_Schmitz_Plessl_2014, title={Kernel-Centric Acceleration of High Accuracy Stereo-Matching}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Schmitz, Henning and Plessl, Christian}, year={2014}, pages={1–8} }"},"file_date_updated":"2018-03-16T11:37:42Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34","grant_number":"610996"}],"quality_controlled":"1","author":[{"id":"3145","last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias"},{"full_name":"Schmitz, Henning","last_name":"Schmitz","first_name":"Henning"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"year":"2014","title":"Kernel-Centric Acceleration of High Accuracy Stereo-Matching","date_updated":"2023-09-26T13:36:40Z","language":[{"iso":"eng"}],"doi":"10.1109/ReConFig.2014.7032535","publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","abstract":[{"text":"Stereo-matching algorithms recently received a lot of attention from the FPGA acceleration community. Presented solutions range from simple, very resource efficient systems with modest matching quality for small embedded systems to sophisticated algorithms with several processing steps, implemented on big FPGAs. In order to achieve high throughput, most implementations strongly focus on pipelining and data reuse between different computation steps. This approach leads to high efficiency, but limits the supported computation patterns and due the high integration of the implementation, adaptions to the algorithm are difficult. In this work, we present a stereo-matching implementation, that starts by offloading individual kernels from the CPU to the FPGA. Between subsequent compute steps on the FPGA, data is stored off-chip in on-board memory of the FPGA accelerator card. This enables us to accelerate the AD-census algorithm with cross-based aggregation and scanline optimization for the first time without algorithmic changes and for up to full HD image dimensions. Analyzing throughput and bandwidth requirements, we outline some trade-offs that are involved with this approach, compared to tighter integration of more kernel loops into one design.","lang":"eng"}],"date_created":"2017-10-17T12:42:11Z","file":[{"content_type":"application/pdf","success":1,"file_id":"1366","access_level":"closed","file_size":932852,"file_name":"406-ReConFig14.pdf","date_updated":"2018-03-16T11:37:42Z","relation":"main_file","date_created":"2018-03-16T11:37:42Z","creator":"florida"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference"},{"title":"SAVE: Towards efficient resource management in heterogeneous system architectures","status":"public","year":"2014","author":[{"first_name":"Gianluca","last_name":"C. Durelli","full_name":"C. Durelli, Gianluca"},{"full_name":"Copolla, Marcello","first_name":"Marcello","last_name":"Copolla"},{"last_name":"Djafarian","first_name":"Karim","full_name":"Djafarian, Karim"},{"last_name":"Koranaros","first_name":"George","full_name":"Koranaros, George"},{"last_name":"Miele","first_name":"Antonio","full_name":"Miele, Antonio"},{"full_name":"Paolino, Michele","first_name":"Michele","last_name":"Paolino"},{"last_name":"Pell","first_name":"Oliver","full_name":"Pell, Oliver"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"},{"last_name":"D. Santambrogio","first_name":"Marco","full_name":"D. Santambrogio, Marco"},{"last_name":"Bolchini","first_name":"Cristiana","full_name":"Bolchini, Cristiana"}],"date_updated":"2023-09-26T13:36:20Z","publisher":"Springer","_id":"1780","language":[{"iso":"eng"}],"user_id":"15278","doi":"10.1007/978-3-319-05960-0_38","publication":"Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)","citation":{"mla":"C. Durelli, Gianluca, et al. “SAVE: Towards Efficient Resource Management in Heterogeneous System Architectures.” <i>Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)</i>, Springer, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">10.1007/978-3-319-05960-0_38</a>.","ama":"C. Durelli G, Copolla M, Djafarian K, et al. SAVE: Towards efficient resource management in heterogeneous system architectures. In: <i>Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)</i>. Springer; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">10.1007/978-3-319-05960-0_38</a>","bibtex":"@inproceedings{C. Durelli_Copolla_Djafarian_Koranaros_Miele_Paolino_Pell_Plessl_D. Santambrogio_Bolchini_2014, title={SAVE: Towards efficient resource management in heterogeneous system architectures}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">10.1007/978-3-319-05960-0_38</a>}, booktitle={Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)}, publisher={Springer}, author={C. Durelli, Gianluca and Copolla, Marcello and Djafarian, Karim and Koranaros, George and Miele, Antonio and Paolino, Michele and Pell, Oliver and Plessl, Christian and D. Santambrogio, Marco and Bolchini, Cristiana}, year={2014} }","apa":"C. Durelli, G., Copolla, M., Djafarian, K., Koranaros, G., Miele, A., Paolino, M., Pell, O., Plessl, C., D. Santambrogio, M., &#38; Bolchini, C. (2014). SAVE: Towards efficient resource management in heterogeneous system architectures. <i>Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)</i>. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">https://doi.org/10.1007/978-3-319-05960-0_38</a>","ieee":"G. C. Durelli <i>et al.</i>, “SAVE: Towards efficient resource management in heterogeneous system architectures,” 2014, doi: <a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">10.1007/978-3-319-05960-0_38</a>.","short":"G. C. Durelli, M. Copolla, K. Djafarian, G. Koranaros, A. Miele, M. Paolino, O. Pell, C. Plessl, M. D. Santambrogio, C. Bolchini, in: Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC), Springer, 2014.","chicago":"C. Durelli, Gianluca, Marcello Copolla, Karim Djafarian, George Koranaros, Antonio Miele, Michele Paolino, Oliver Pell, Christian Plessl, Marco D. Santambrogio, and Cristiana Bolchini. “SAVE: Towards Efficient Resource Management in Heterogeneous System Architectures.” In <i>Proc. Int. Conf. on Reconfigurable Computing: Architectures, Tools and Applications (ARC)</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_38\">https://doi.org/10.1007/978-3-319-05960-0_38</a>."},"quality_controlled":"1","project":[{"_id":"34","grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"date_created":"2018-03-26T13:45:35Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}]},{"publication":"ACM SIGARCH Computer Architecture News","issue":"5","date_created":"2018-03-26T13:42:34Z","keyword":["funding-maxup","tet_topic_hpc"],"type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"},{"_id":"78"}],"title":"Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers","year":"2014","publication_identifier":{"issn":["0163-5964"]},"author":[{"first_name":"Heiner","last_name":"Giefers","full_name":"Giefers, Heiner"},{"id":"16153","full_name":"Plessl, Christian","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"},{"full_name":"Förstner, Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens","id":"158"}],"date_updated":"2023-09-26T13:35:58Z","intvolume":"        41","language":[{"iso":"eng"}],"doi":"10.1145/2641361.2641372","citation":{"ieee":"H. Giefers, C. Plessl, and J. Förstner, “Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers,” <i>ACM SIGARCH Computer Architecture News</i>, vol. 41, no. 5, pp. 65–70, 2014, doi: <a href=\"https://doi.org/10.1145/2641361.2641372\">10.1145/2641361.2641372</a>.","apa":"Giefers, H., Plessl, C., &#38; Förstner, J. (2014). Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers. <i>ACM SIGARCH Computer Architecture News</i>, <i>41</i>(5), 65–70. <a href=\"https://doi.org/10.1145/2641361.2641372\">https://doi.org/10.1145/2641361.2641372</a>","short":"H. Giefers, C. Plessl, J. Förstner, ACM SIGARCH Computer Architecture News 41 (2014) 65–70.","chicago":"Giefers, Heiner, Christian Plessl, and Jens Förstner. “Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers.” <i>ACM SIGARCH Computer Architecture News</i> 41, no. 5 (2014): 65–70. <a href=\"https://doi.org/10.1145/2641361.2641372\">https://doi.org/10.1145/2641361.2641372</a>.","mla":"Giefers, Heiner, et al. “Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers.” <i>ACM SIGARCH Computer Architecture News</i>, vol. 41, no. 5, ACM, 2014, pp. 65–70, doi:<a href=\"https://doi.org/10.1145/2641361.2641372\">10.1145/2641361.2641372</a>.","bibtex":"@article{Giefers_Plessl_Förstner_2014, title={Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers}, volume={41}, DOI={<a href=\"https://doi.org/10.1145/2641361.2641372\">10.1145/2641361.2641372</a>}, number={5}, journal={ACM SIGARCH Computer Architecture News}, publisher={ACM}, author={Giefers, Heiner and Plessl, Christian and Förstner, Jens}, year={2014}, pages={65–70} }","ama":"Giefers H, Plessl C, Förstner J. Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers. <i>ACM SIGARCH Computer Architecture News</i>. 2014;41(5):65-70. doi:<a href=\"https://doi.org/10.1145/2641361.2641372\">10.1145/2641361.2641372</a>"},"quality_controlled":"1","status":"public","page":"65-70","_id":"1779","publisher":"ACM","user_id":"15278","volume":41},{"date_created":"2021-09-29T10:47:35Z","type":"journal_article","department":[{"_id":"672"}],"publication":"Design and Verification Conference (DVCON EUROPE)","citation":{"apa":"Koppelmann, B., Messidat, B., Becker, M., Kuznik, C., Müller, W., &#38; Scheytt, J. C. (2014). Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU. <i>Design and Verification Conference (DVCON EUROPE)</i>.","mla":"Koppelmann, Bastian, et al. “Fast and Open Virtual Platforms for TriCore-Based SoCs Using QEMU.” <i>Design and Verification Conference (DVCON EUROPE)</i>, 2014.","ieee":"B. Koppelmann, B. Messidat, M. Becker, C. Kuznik, W. Müller, and J. C. Scheytt, “Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU,” <i>Design and Verification Conference (DVCON EUROPE)</i>, 2014.","chicago":"Koppelmann, Bastian, Bernd Messidat, Markus Becker, Christoph Kuznik, Wolfgang Müller, and J. Christoph Scheytt. “Fast and Open Virtual Platforms for TriCore-Based SoCs Using QEMU.” <i>Design and Verification Conference (DVCON EUROPE)</i>, 2014.","short":"B. Koppelmann, B. Messidat, M. Becker, C. Kuznik, W. Müller, J.C. Scheytt, Design and Verification Conference (DVCON EUROPE) (2014).","ama":"Koppelmann B, Messidat B, Becker M, Kuznik C, Müller W, Scheytt JC. Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU. <i>Design and Verification Conference (DVCON EUROPE)</i>. Published online 2014.","bibtex":"@article{Koppelmann_Messidat_Becker_Kuznik_Müller_Scheytt_2014, title={Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU}, journal={Design and Verification Conference (DVCON EUROPE)}, author={Koppelmann, Bastian and Messidat, Bernd and Becker, Markus and Kuznik, Christoph and Müller, Wolfgang and Scheytt, J. Christoph}, year={2014} }"},"_id":"25117","language":[{"iso":"eng"}],"user_id":"5786","title":"Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU","status":"public","year":"2014","author":[{"first_name":"Bastian","last_name":"Koppelmann","full_name":"Koppelmann, Bastian","id":"25260"},{"full_name":"Messidat, Bernd","last_name":"Messidat","first_name":"Bernd"},{"last_name":"Becker","first_name":"Markus","full_name":"Becker, Markus"},{"full_name":"Kuznik, Christoph","last_name":"Kuznik","first_name":"Christoph"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"id":"37144","full_name":"Scheytt, J. Christoph","last_name":"Scheytt","first_name":"J. Christoph","orcid":"https://orcid.org/0000-0002-5950-6618"}],"date_updated":"2025-02-26T14:44:48Z"},{"language":[{"iso":"eng"}],"_id":"25162","user_id":"5786","author":[{"first_name":"Christoph","last_name":"Kuznik","full_name":"Kuznik, Christoph"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"}],"title":"Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure","year":"2014","status":"public","date_updated":"2025-02-26T14:45:04Z","date_created":"2021-09-30T10:05:28Z","department":[{"_id":"672"}],"type":"journal_article","citation":{"bibtex":"@article{Kuznik_Müller_2014, title={Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure}, journal={Design, Automation and Test in Europe DATE, University Booth, Dresden }, author={Kuznik, Christoph and Müller, Wolfgang}, year={2014} }","chicago":"Kuznik, Christoph, and Wolfgang Müller. “Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure.” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden </i>, 2014.","short":"C. Kuznik, W. Müller, Design, Automation and Test in Europe DATE, University Booth, Dresden  (2014).","ama":"Kuznik C, Müller W. Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure. <i>Design, Automation and Test in Europe DATE, University Booth, Dresden </i>. Published online 2014.","ieee":"C. Kuznik and W. Müller, “Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure,” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden </i>, 2014.","mla":"Kuznik, Christoph, and Wolfgang Müller. “Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure.” <i>Design, Automation and Test in Europe DATE, University Booth, Dresden </i>, 2014.","apa":"Kuznik, C., &#38; Müller, W. (2014). Verific-MM: Systematized Verification Metrics Generation with UCIS for Improved Automation on Verification Closure. <i>Design, Automation and Test in Europe DATE, University Booth, Dresden </i>."},"publication":"Design, Automation and Test in Europe DATE, University Booth, Dresden "}]