[{"author":[{"full_name":"Antoniadis, Antonios","first_name":"Antonios","last_name":"Antoniadis"},{"first_name":"Neal","full_name":"Barcelo, Neal","last_name":"Barcelo"},{"first_name":"Mario","full_name":"Consuegra, Mario","last_name":"Consuegra"},{"full_name":"Kling, Peer","first_name":"Peer","last_name":"Kling"},{"full_name":"Nugent, Michael","first_name":"Michael","last_name":"Nugent"},{"last_name":"Pruhs","full_name":"Pruhs, Kirk","first_name":"Kirk"},{"last_name":"Scquizzato","full_name":"Scquizzato, Michele","first_name":"Michele"}],"citation":{"ama":"Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In: <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>. LIPIcs. ; 2014:63--74. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>","apa":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., &#38; Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 63--74). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>","chicago":"Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 63--74. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>.","ieee":"A. Antoniadis <i>et al.</i>, “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,” in <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74.","mla":"Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>.","bibtex":"@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014, series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>}, booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, year={2014}, pages={63--74}, collection={LIPIcs} }","short":"A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs, M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74."},"series_title":"LIPIcs","department":[{"_id":"63"}],"date_created":"2017-10-17T12:42:16Z","language":[{"iso":"eng"}],"year":"2014","status":"public","file_date_updated":"2018-03-16T11:30:23Z","_id":"435","date_updated":"2022-01-06T07:00:58Z","title":"Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules","file":[{"creator":"florida","file_name":"435-Kling_C2_STACS2014.pdf","file_size":525851,"file_id":"1354","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-16T11:30:23Z","relation":"main_file","date_updated":"2018-03-16T11:30:23Z","success":1}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"has_accepted_license":"1","abstract":[{"text":"We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.","lang":"eng"}],"doi":"10.4230/LIPIcs.STACS.2014.63","user_id":"477","ddc":["040"],"publication":"Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)","type":"conference","page":"63--74"},{"status":"public","type":"mastersthesis","year":"2014","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:16Z","date_updated":"2022-01-06T07:00:58Z","_id":"436","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"author":[{"full_name":"Damschen, Marvin","first_name":"Marvin","last_name":"Damschen"}],"title":"Easy-to-use on-the-fly binary program acceleration on many-cores","user_id":"15504","citation":{"chicago":"Damschen, Marvin. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn, 2014.","ieee":"M. Damschen, <i>Easy-to-use on-the-fly binary program acceleration on many-cores</i>. Universität Paderborn, 2014.","ama":"Damschen M. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn; 2014.","apa":"Damschen, M. (2014). <i>Easy-to-use on-the-fly binary program acceleration on many-cores</i>. Universität Paderborn.","short":"M. Damschen, Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores, Universität Paderborn, 2014.","mla":"Damschen, Marvin. <i>Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores</i>. Universität Paderborn, 2014.","bibtex":"@book{Damschen_2014, title={Easy-to-use on-the-fly binary program acceleration on many-cores}, publisher={Universität Paderborn}, author={Damschen, Marvin}, year={2014} }"}},{"_id":"437","date_updated":"2022-01-06T07:00:59Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:17Z","status":"public","language":[{"iso":"ger"}],"year":"2014","type":"bachelorsthesis","user_id":"42447","citation":{"ieee":"V. Wemhöner, <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","chicago":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","apa":"Wemhöner, V. (2014). <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn.","ama":"Wemhöner V. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn; 2014.","short":"V. Wemhöner, Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells, Universität Paderborn, 2014.","bibtex":"@book{Wemhöner_2014, title={Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells}, publisher={Universität Paderborn}, author={Wemhöner, Vanessa}, year={2014} }","mla":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014."},"department":[{"_id":"280"}],"author":[{"first_name":"Vanessa","full_name":"Wemhöner, Vanessa","last_name":"Wemhöner"}],"title":"Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"date_updated":"2022-01-06T07:01:00Z","_id":"438","type":"bachelorsthesis","year":"2014","status":"public","date_created":"2017-10-17T12:42:17Z","publisher":"Universität Paderborn","citation":{"short":"A. Kokoschka, Designing an Anonymous and Secure Reputation System Using a Group Signature Variant, Universität Paderborn, 2014.","bibtex":"@book{Kokoschka_2014, title={Designing an Anonymous and Secure Reputation System Using a Group Signature Variant}, publisher={Universität Paderborn}, author={Kokoschka, Andreas}, year={2014} }","mla":"Kokoschka, Andreas. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","ieee":"A. Kokoschka, <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","chicago":"Kokoschka, Andreas. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn, 2014.","apa":"Kokoschka, A. (2014). <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn.","ama":"Kokoschka A. <i>Designing an Anonymous and Secure Reputation System Using a Group Signature Variant</i>. Universität Paderborn; 2014."},"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Designing an Anonymous and Secure Reputation System Using a Group Signature Variant","author":[{"first_name":"Andreas","full_name":"Kokoschka, Andreas","last_name":"Kokoschka"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"has_accepted_license":"1","supervisor":[{"id":"20801","last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"}],"title":"Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions","author":[{"id":"18949","last_name":"Kaimann","first_name":"Daniel","full_name":"Kaimann, Daniel"}],"file":[{"file_name":"Dissertation_2014_Kaimann.pdf","file_size":531139,"creator":"dkaimann","date_created":"2018-11-08T09:29:04Z","content_type":"application/pdf","file_id":"5424","access_level":"closed","date_updated":"2018-11-08T09:29:04Z","relation":"main_file","success":1}],"department":[{"_id":"19"},{"_id":"200"},{"_id":"205"},{"_id":"183"}],"citation":{"short":"D. Kaimann, Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions, Universität Paderborn, 2014.","bibtex":"@book{Kaimann_2014, title={Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions}, publisher={Universität Paderborn}, author={Kaimann, Daniel}, year={2014} }","mla":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","ieee":"D. Kaimann, <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","chicago":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","apa":"Kaimann, D. (2014). <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn.","ama":"Kaimann D. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn; 2014."},"user_id":"477","language":[{"iso":"eng"}],"year":"2014","type":"dissertation","status":"public","date_created":"2017-10-17T12:42:17Z","ddc":["330"],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:01Z","_id":"440","file_date_updated":"2018-11-08T09:29:04Z"},{"title":"FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps","extern":"1","file":[{"content_type":"application/pdf","access_level":"closed","file_id":"5258","date_created":"2018-11-02T13:59:33Z","creator":"ups","file_size":406920,"file_name":"p259-arzt.pdf","success":1,"date_updated":"2018-11-02T13:59:33Z","relation":"main_file"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"doi":"10.1145/2594291.2594299","has_accepted_license":"1","main_file_link":[{"url":"http://www.bodden.de/pubs/far+14flowdroid.pdf"}],"user_id":"477","publication":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI '14","ddc":["000"],"type":"conference","author":[{"first_name":"Steven","full_name":"Arzt, Steven","last_name":"Arzt"},{"full_name":"Rasthofer, Siegfried","first_name":"Siegfried","last_name":"Rasthofer"},{"first_name":"Christian","full_name":"Fritz, Christian","last_name":"Fritz"},{"id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","first_name":"Eric","orcid":"0000-0003-3470-3647"},{"last_name":"Bartel","first_name":"Alexandre","full_name":"Bartel, Alexandre"},{"last_name":"Klein","full_name":"Klein, Jacques","first_name":"Jacques"},{"last_name":"Le Traon","full_name":"Le Traon, Yves","first_name":"Yves"},{"full_name":"Octeau, Damien","first_name":"Damien","last_name":"Octeau"},{"full_name":"McDaniel, Patrick","first_name":"Patrick","last_name":"McDaniel"}],"citation":{"ieee":"S. Arzt <i>et al.</i>, “FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps,” in <i>Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14</i>, 2014.","chicago":"Arzt, Steven, Siegfried Rasthofer, Christian Fritz, Eric Bodden, Alexandre Bartel, Jacques Klein, Yves Le Traon, Damien Octeau, and Patrick McDaniel. “FlowDroid: Precise Context, Flow, Field, Object-Sensitive and Lifecycle-Aware Taint Analysis for Android Apps.” In <i>Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14</i>. ACM Press, 2014. <a href=\"https://doi.org/10.1145/2594291.2594299\">https://doi.org/10.1145/2594291.2594299</a>.","apa":"Arzt, S., Rasthofer, S., Fritz, C., Bodden, E., Bartel, A., Klein, J., … McDaniel, P. (2014). FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps. In <i>Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14</i>. ACM Press. <a href=\"https://doi.org/10.1145/2594291.2594299\">https://doi.org/10.1145/2594291.2594299</a>","ama":"Arzt S, Rasthofer S, Fritz C, et al. FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps. In: <i>Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14</i>. ACM Press; 2014. doi:<a href=\"https://doi.org/10.1145/2594291.2594299\">10.1145/2594291.2594299</a>","short":"S. Arzt, S. Rasthofer, C. Fritz, E. Bodden, A. Bartel, J. Klein, Y. Le Traon, D. Octeau, P. McDaniel, in: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14, ACM Press, 2014.","bibtex":"@inproceedings{Arzt_Rasthofer_Fritz_Bodden_Bartel_Klein_Le Traon_Octeau_McDaniel_2014, title={FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps}, DOI={<a href=\"https://doi.org/10.1145/2594291.2594299\">10.1145/2594291.2594299</a>}, booktitle={Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14}, publisher={ACM Press}, author={Arzt, Steven and Rasthofer, Siegfried and Fritz, Christian and Bodden, Eric and Bartel, Alexandre and Klein, Jacques and Le Traon, Yves and Octeau, Damien and McDaniel, Patrick}, year={2014} }","mla":"Arzt, Steven, et al. “FlowDroid: Precise Context, Flow, Field, Object-Sensitive and Lifecycle-Aware Taint Analysis for Android Apps.” <i>Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI ’14</i>, ACM Press, 2014, doi:<a href=\"https://doi.org/10.1145/2594291.2594299\">10.1145/2594291.2594299</a>."},"publication_status":"published","department":[{"_id":"76"}],"date_created":"2018-10-31T10:55:28Z","publisher":"ACM Press","language":[{"iso":"eng"}],"year":"2014","publication_identifier":{"isbn":["9781450327848"]},"status":"public","file_date_updated":"2018-11-02T13:59:33Z","_id":"5189","date_updated":"2022-01-06T07:01:42Z"},{"title":"DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android","extern":"1","file":[{"date_updated":"2018-11-02T13:21:13Z","relation":"main_file","file_size":661565,"file_name":"ralb14droidforce.pdf","creator":"ups","date_created":"2018-11-02T13:21:13Z","file_id":"5247","access_level":"closed","content_type":"application/pdf"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"has_accepted_license":"1","main_file_link":[{"url":"http://www.bodden.de/pubs/ralb14droidforce.pdf"}],"user_id":"477","publication":"International Conference on Availability, Reliability and Security (ARES 2014)","ddc":["004"],"type":"conference","page":"40-49","author":[{"first_name":"Steven","full_name":"Arzt, Steven","last_name":"Arzt"},{"first_name":"Siegfried","full_name":"Rasthofer, Siegfried","last_name":"Rasthofer"},{"last_name":"Lovat","full_name":"Lovat, Enrico","first_name":"Enrico"},{"orcid":"0000-0003-3470-3647","id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","first_name":"Eric"}],"citation":{"ieee":"S. Arzt, S. Rasthofer, E. Lovat, and E. Bodden, “DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android,” in <i>International Conference on Availability, Reliability and Security (ARES 2014)</i>, 2014, pp. 40–49.","chicago":"Arzt, Steven, Siegfried Rasthofer, Enrico Lovat, and Eric Bodden. “DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android.” In <i>International Conference on Availability, Reliability and Security (ARES 2014)</i>, 40–49. IEEE, 2014.","apa":"Arzt, S., Rasthofer, S., Lovat, E., &#38; Bodden, E. (2014). DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android. In <i>International Conference on Availability, Reliability and Security (ARES 2014)</i> (pp. 40–49). IEEE.","ama":"Arzt S, Rasthofer S, Lovat E, Bodden E. DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android. In: <i>International Conference on Availability, Reliability and Security (ARES 2014)</i>. IEEE; 2014:40-49.","short":"S. Arzt, S. Rasthofer, E. Lovat, E. Bodden, in: International Conference on Availability, Reliability and Security (ARES 2014), IEEE, 2014, pp. 40–49.","bibtex":"@inproceedings{Arzt_Rasthofer_Lovat_Bodden_2014, title={DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android}, booktitle={International Conference on Availability, Reliability and Security (ARES 2014)}, publisher={IEEE}, author={Arzt, Steven and Rasthofer, Siegfried and Lovat, Enrico and Bodden, Eric}, year={2014}, pages={40–49} }","mla":"Arzt, Steven, et al. “DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android.” <i>International Conference on Availability, Reliability and Security (ARES 2014)</i>, IEEE, 2014, pp. 40–49."},"department":[{"_id":"76"}],"date_created":"2018-10-31T11:04:43Z","publisher":"IEEE","language":[{"iso":"eng"}],"year":"2014","status":"public","_id":"5190","file_date_updated":"2018-11-02T13:21:13Z","date_updated":"2022-01-06T07:01:43Z"},{"author":[{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"},{"orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian","last_name":"Plessl","id":"16153"}],"editor":[{"last_name":"Künsemöller","full_name":"Künsemöller, Jörn","first_name":"Jörn"},{"last_name":"Eke","full_name":"Eke, Norber Otto","first_name":"Norber Otto"},{"last_name":"Foit","full_name":"Foit, Lioba","first_name":"Lioba"},{"first_name":"Timo","full_name":"Kaerlein, Timo","last_name":"Kaerlein"}],"place":"Paderborn","publication_status":"published","series_title":"Schriftenreihe des Graduiertenkollegs \"Automatismen\"","citation":{"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.","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.","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."},"department":[{"_id":"518"},{"_id":"27"},{"_id":"78"}],"publisher":"Wilhelm Fink","date_created":"2017-10-17T12:41:57Z","status":"public","year":"2014","publication_identifier":{"isbn":["978-3-7705-5730-1"]},"language":[{"iso":"ger"}],"_id":"335","file_date_updated":"2018-03-20T07:29:58Z","date_updated":"2023-09-26T13:32:49Z","file":[{"creator":"florida","file_size":2848154,"file_name":"335-2014_plessl_automatismen.pdf","file_id":"1424","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-20T07:29:58Z","relation":"main_file","date_updated":"2018-03-20T07:29:58Z","success":1}],"title":"Verschiebungen an der Grenze zwischen Hardware und Software","has_accepted_license":"1","abstract":[{"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.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"15278","ddc":["040"],"quality_controlled":"1","publication":"Logiken strukturbildender Prozesse: Automatismen","type":"book_chapter","page":"123-144"},{"publisher":"Springer International Publishing","date_created":"2017-10-17T12:42:07Z","status":"public","year":"2014","language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:02:02Z","_id":"388","date_updated":"2023-09-26T13:34:08Z","author":[{"first_name":"Tobias","full_name":"Kenter, Tobias","last_name":"Kenter","id":"3145"},{"id":"30332","last_name":"Vaz","full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis"},{"id":"16153","last_name":"Plessl","full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982"}],"intvolume":"      8405","place":"Cham","series_title":"Lecture Notes in Computer Science (LNCS)","citation":{"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.","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)} }","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>.","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>.","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>.","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>","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>"},"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"quality_controlled":"1","ddc":["040"],"publication":"Proceedings of the International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications (ARC)","type":"conference","volume":8405,"page":"144-155","file":[{"date_created":"2018-03-20T07:02:02Z","file_id":"1387","content_type":"application/pdf","access_level":"closed","file_name":"388-plessl14_arc.pdf","file_size":330193,"creator":"florida","success":1,"relation":"main_file","date_updated":"2018-03-20T07:02:02Z"}],"title":"Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector Computer","has_accepted_license":"1","abstract":[{"lang":"eng","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."}],"doi":"10.1007/978-3-319-05960-0_13","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"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"user_id":"15278"},{"language":[{"iso":"eng"}],"year":"2014","status":"public","date_created":"2017-10-17T12:42:02Z","publisher":"Elsevier","date_updated":"2023-09-26T13:33:06Z","_id":"363","file_date_updated":"2018-03-20T07:20:31Z","intvolume":"        38","author":[{"full_name":"Agne, Andreas","first_name":"Andreas","last_name":"Agne"},{"last_name":"Hangmann","full_name":"Hangmann, Hendrik","first_name":"Hendrik"},{"full_name":"Happe, Markus","first_name":"Markus","last_name":"Happe"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","first_name":"Christian","full_name":"Plessl, Christian"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"citation":{"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} }","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>","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>","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>.","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."},"type":"journal_article","ddc":["040"],"quality_controlled":"1","publication":"Microprocessors and Microsystems","issue":"8, Part B","page":"911-919","volume":38,"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"grant_number":"160364472","name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"31","name":"Engineering Proprioception in Computing Systems","grant_number":"257906"}],"doi":"10.1016/j.micpro.2013.12.001","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"}],"has_accepted_license":"1","title":"Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators","file":[{"success":1,"relation":"main_file","date_updated":"2018-03-20T07:20:31Z","file_id":"1408","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-20T07:20:31Z","creator":"florida","file_name":"363-plessl13_micpro.pdf","file_size":1499996}],"user_id":"15278"},{"citation":{"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>.","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} }","short":"H. Riebler, T. Kenter, C. Plessl, C. Sorge, in: Proceedings of Field-Programmable Custom Computing Machines (FCCM), IEEE, 2014, pp. 222–229.","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>","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>","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>.","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>."},"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"author":[{"full_name":"Riebler, Heinrich","first_name":"Heinrich","id":"8961","last_name":"Riebler"},{"id":"3145","last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias"},{"last_name":"Plessl","id":"16153","first_name":"Christian","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982"},{"last_name":"Sorge","full_name":"Sorge, Christoph","first_name":"Christoph"}],"file_date_updated":"2018-03-20T07:14:20Z","_id":"377","date_updated":"2023-09-26T13:33:50Z","publisher":"IEEE","date_created":"2017-10-17T12:42:05Z","status":"public","year":"2014","language":[{"iso":"eng"}],"user_id":"15278","keyword":["coldboot"],"file":[{"access_level":"closed","file_id":"1397","content_type":"application/pdf","date_created":"2018-03-20T07:14:20Z","creator":"florida","file_name":"377-FCCM14.pdf","file_size":1003907,"success":1,"relation":"main_file","date_updated":"2018-03-20T07:14:20Z"}],"title":"Reconstructing AES Key Schedules from Decayed Memory with FPGAs","has_accepted_license":"1","doi":"10.1109/FCCM.2014.67","abstract":[{"lang":"eng","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."}],"project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"page":"222-229","publication":"Proceedings of Field-Programmable Custom Computing Machines (FCCM)","quality_controlled":"1","ddc":["040"],"type":"conference"},{"article_number":"13","issue":"2","volume":7,"type":"journal_article","ddc":["040"],"quality_controlled":"1","publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","user_id":"15278","project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"doi":"10.1145/2617596","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."}],"has_accepted_license":"1","title":"Self-awareness as a Model for Designing and Operating Heterogeneous Multicores","file":[{"file_name":"365-plessl14_trets_01.pdf","file_size":916052,"creator":"florida","date_created":"2018-03-20T07:19:19Z","access_level":"closed","content_type":"application/pdf","file_id":"1406","date_updated":"2018-03-20T07:19:19Z","relation":"main_file","success":1}],"date_updated":"2023-09-26T13:33:31Z","_id":"365","file_date_updated":"2018-03-20T07:19:19Z","year":"2014","language":[{"iso":"eng"}],"status":"public","date_created":"2017-10-17T12:42:03Z","publisher":"ACM","department":[{"_id":"27"},{"_id":"78"},{"_id":"518"}],"citation":{"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>.","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>.","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>","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} }","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>"},"intvolume":"         7","author":[{"last_name":"Agne","first_name":"Andreas","full_name":"Agne, Andreas"},{"first_name":"Markus","full_name":"Happe, Markus","last_name":"Happe"},{"first_name":"Achim","full_name":"Lösch, Achim","last_name":"Lösch","id":"43646"},{"orcid":"0000-0001-5728-9982","id":"16153","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}]},{"status":"public","language":[{"iso":"eng"}],"year":"2014","publisher":"IEEE","date_created":"2017-10-17T12:41:55Z","date_updated":"2023-09-26T13:32:31Z","_id":"328","file_date_updated":"2018-03-20T07:31:40Z","intvolume":"        34","author":[{"full_name":"Agne, Andreas","first_name":"Andreas","last_name":"Agne"},{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"full_name":"Keller, Ariane","first_name":"Ariane","last_name":"Keller"},{"full_name":"Lübbers, Enno","first_name":"Enno","last_name":"Lübbers"},{"first_name":"Bernhard","full_name":"Plattner, Bernhard","last_name":"Plattner"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"full_name":"Plessl, Christian","first_name":"Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"citation":{"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>","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>.","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>.","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} }","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>.","short":"A. Agne, M. Happe, A. Keller, E. Lübbers, B. Plattner, M. Platzner, C. Plessl, IEEE Micro 34 (2014) 60–71."},"type":"journal_article","publication":"IEEE Micro","quality_controlled":"1","ddc":["040"],"issue":"1","volume":34,"page":"60-71","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"}],"has_accepted_license":"1","doi":"10.1109/MM.2013.110","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"file":[{"content_type":"application/pdf","access_level":"closed","file_id":"1426","date_created":"2018-03-20T07:31:40Z","creator":"florida","file_name":"328-plessl14_micro_01.pdf","file_size":1877185,"success":1,"date_updated":"2018-03-20T07:31:40Z","relation":"main_file"}],"title":"ReconOS - An Operating System Approach for Reconfigurable Computing","user_id":"15278"},{"page":"1-8","ddc":["040"],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","quality_controlled":"1","type":"conference","user_id":"15278","title":"Deferring Accelerator Offloading Decisions to Application Runtime","file":[{"file_name":"439-plessl14a_reconfig.pdf","file_size":557362,"creator":"florida","date_created":"2018-03-16T11:29:52Z","access_level":"closed","content_type":"application/pdf","file_id":"1353","relation":"main_file","date_updated":"2018-03-16T11:29:52Z","success":1}],"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"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"has_accepted_license":"1","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."}],"doi":"10.1109/ReConFig.2014.7032509","file_date_updated":"2018-03-16T11:29:52Z","_id":"439","date_updated":"2023-09-26T13:37:02Z","date_created":"2017-10-17T12:42:17Z","publisher":"IEEE","year":"2014","language":[{"iso":"eng"}],"status":"public","citation":{"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>.","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.","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>","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>.","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>."},"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"author":[{"last_name":"Vaz","id":"30332","first_name":"Gavin Francis","full_name":"Vaz, Gavin Francis"},{"first_name":"Heinrich","full_name":"Riebler, Heinrich","last_name":"Riebler","id":"8961"},{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","first_name":"Christian","last_name":"Plessl","id":"16153"}]},{"user_id":"15278","file":[{"success":1,"date_updated":"2018-03-16T11:37:42Z","relation":"main_file","file_id":"1366","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-16T11:37:42Z","creator":"florida","file_size":932852,"file_name":"406-ReConFig14.pdf"}],"title":"Kernel-Centric Acceleration of High Accuracy Stereo-Matching","has_accepted_license":"1","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"}],"doi":"10.1109/ReConFig.2014.7032535","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996"}],"page":"1-8","publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","quality_controlled":"1","ddc":["040"],"type":"conference","citation":{"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>.","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>","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} }","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>."},"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"author":[{"first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter"},{"full_name":"Schmitz, Henning","first_name":"Henning","last_name":"Schmitz"},{"last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982"}],"_id":"406","file_date_updated":"2018-03-16T11:37:42Z","date_updated":"2023-09-26T13:36:40Z","publisher":"IEEE","date_created":"2017-10-17T12:42:11Z","status":"public","language":[{"iso":"eng"}],"year":"2014"},{"has_accepted_license":"1","doi":"10.1016/j.econlet.2013.08.013","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-08-09T09:49:34Z","content_type":"application/pdf","file_id":"3869","access_level":"closed","date_created":"2018-08-09T09:49:34Z","creator":"cjhaake","file_name":"Asymmetric Nash bargaining solutions and competitive payoffs.pdf","file_size":374977}],"title":"Asymmetric Nash bargaining solutions and competitive payoffs","user_id":"65453","type":"journal_article","ddc":["040"],"publication":"Economics Letters","issue":"2","volume":121,"page":"224-227","intvolume":"       121","author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"last_name":"Gamp","full_name":"Gamp, Jan-Philip","first_name":"Jan-Philip"}],"department":[{"_id":"205"},{"_id":"475"}],"publication_status":"published","citation":{"ama":"Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>. 2013;121(2):224-227. doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>, <i>121</i>(2), 224–227. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>","ieee":"S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” <i>Economics Letters</i>, vol. 121, no. 2, pp. 224–227, 2013.","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i> 121, no. 2 (2013): 224–27. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>.","bibtex":"@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, volume={121}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, vol. 121, no. 2, Elsevier, 2013, pp. 224–27, doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>.","short":"S. Brangewitz, J.-P. Gamp, Economics Letters 121 (2013) 224–227."},"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0165-1765"]},"year":"2013","publisher":"Elsevier","date_created":"2018-04-26T11:29:16Z","date_updated":"2022-01-06T06:57:04Z","_id":"2543","file_date_updated":"2018-08-09T09:49:34Z"},{"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"author":[{"last_name":"Blumentritt","full_name":"Blumentritt, Fritz","first_name":"Fritz"}],"title":"Cliquenbildung in verteilten Systemen","department":[{"_id":"79"}],"user_id":"477","citation":{"ama":"Blumentritt F. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn; 2013.","apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn.","ieee":"F. Blumentritt, <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","chicago":"Blumentritt, Fritz. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn, 2013.","bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }","mla":"Blumentritt, Fritz. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn, 2013.","short":"F. Blumentritt, Cliquenbildung in Verteilten Systemen, Universität Paderborn, 2013."},"status":"public","year":"2013","type":"bachelorsthesis","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_created":"2020-08-17T08:14:17Z","date_updated":"2022-01-06T06:53:25Z","_id":"18000"},{"_id":"469","file_date_updated":"2018-03-16T11:18:41Z","date_updated":"2022-01-06T07:01:18Z","date_created":"2017-10-17T12:42:23Z","year":"2013","language":[{"iso":"eng"}],"status":"public","series_title":"LNCS","citation":{"ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,” in <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–258.","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead Runtime Monitoring.” In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 244–58. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>.","ama":"Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In: <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>. LNCS. ; 2013:244-258. doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Zero Overhead Runtime Monitoring. In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i> (pp. 244–258). <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero Overhead Runtime Monitoring}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>}, booktitle={Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }","mla":"Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>."},"department":[{"_id":"77"}],"author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"first_name":"Alexander","full_name":"Schremmer, Alexander","last_name":"Schremmer"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"page":"244-258","publication":"Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)","ddc":["040"],"type":"conference","user_id":"477","title":"Zero Overhead Runtime Monitoring","file":[{"content_type":"application/pdf","file_id":"1332","access_level":"closed","date_created":"2018-03-16T11:18:41Z","creator":"florida","file_name":"469-WSW2013-2.pdf","file_size":394804,"success":1,"date_updated":"2018-03-16T11:18:41Z","relation":"main_file"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"abstract":[{"lang":"eng","text":"Runtime monitoring aims at ensuring program safety by monitoring the program's behaviour during execution and taking appropriate action before a program violates some property.Runtime monitoring is in particular important when an exhaustive formal verification fails. While the approach allows for a safe execution of programs, it may impose a significant runtime overhead.In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run as the basis for transforming the program into one where all potential points of failure are replaced by HALT statements. The new program is safe by construction, behaviourally equivalent to the original program (except for unsafe behaviour),and has the same performance characteristics."}],"doi":"10.1007/978-3-642-40561-7_17","has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries."}],"has_accepted_license":"1","doi":"10.1145/2486001.2491710","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file":[{"relation":"main_file","date_updated":"2018-03-16T11:18:01Z","success":1,"file_name":"470-p541-wette_01.pdf","file_size":446835,"creator":"florida","date_created":"2018-03-16T11:18:01Z","content_type":"application/pdf","access_level":"closed","file_id":"1331"}],"title":"Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow","user_id":"15572","type":"conference","publication":"Proceedings of the ACM SIGCOMM '13","ddc":["040"],"page":"541-542","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"department":[{"_id":"75"}],"citation":{"short":"P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.","bibtex":"@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}, DOI={<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>}, booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={541–542}, collection={Digital Library} }","mla":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–42, doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>.","ieee":"P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow,” in <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–542.","chicago":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” In <i>Proceedings of the ACM SIGCOMM ’13</i>, 541–42. Digital Library, 2013. <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>.","apa":"Wette, P., &#38; Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In <i>Proceedings of the ACM SIGCOMM ’13</i> (pp. 541–542). <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>","ama":"Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In: <i>Proceedings of the ACM SIGCOMM ’13</i>. Digital Library. ; 2013:541-542. doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>"},"series_title":"Digital Library","status":"public","year":"2013","date_created":"2017-10-17T12:42:23Z","date_updated":"2022-01-06T07:01:19Z","_id":"470","file_date_updated":"2018-03-16T11:18:01Z"},{"_id":"471","date_updated":"2022-01-06T07:01:19Z","date_created":"2017-10-17T12:42:23Z","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"year":"2013","type":"bachelorsthesis","status":"public","citation":{"apa":"Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn.","ama":"Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn; 2013.","chicago":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","ieee":"A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","mla":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","bibtex":"@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn}, author={Tezer, Alina}, year={2013} }","short":"A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013."},"user_id":"477","department":[{"_id":"64"}],"title":"Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen","author":[{"full_name":"Tezer, Alina","first_name":"Alina","last_name":"Tezer"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}]}]