[{"title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","author":[{"first_name":"Thomas","full_name":"Haarhoff, Thomas","last_name":"Haarhoff"}],"date_created":"2017-10-17T12:42:50Z","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","citation":{"apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","bibtex":"@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }","ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012."},"year":"2012","language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"607","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"bachelorsthesis"},{"year":"2012","citation":{"apa":"Hangmann, H. (2012). <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn.","mla":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","short":"H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012.","bibtex":"@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }","chicago":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","ieee":"H. Hangmann, <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn, 2012.","ama":"Hangmann H. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn; 2012."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:53Z","date_created":"2017-10-17T12:42:51Z","author":[{"full_name":"Hangmann, Hendrik","last_name":"Hangmann","first_name":"Hendrik"}],"title":"Generating Adjustable Temperature Gradients on modern FPGAs","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"611","user_id":"15504"},{"year":"2012","citation":{"apa":"Wohlfarth, S. (2012). <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn.","bibtex":"@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}, publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }","short":"S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens, Universität Paderborn, 2012.","mla":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","ama":"Wohlfarth S. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn; 2012.","ieee":"S. Wohlfarth, <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","chicago":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012."},"title":"Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens","date_updated":"2022-01-06T07:02:53Z","publisher":"Universität Paderborn","author":[{"first_name":"Stefan","full_name":"Wohlfarth, Stefan","last_name":"Wohlfarth"}],"date_created":"2017-10-17T12:42:51Z","status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"613","user_id":"477"},{"year":"2012","citation":{"bibtex":"@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }","mla":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","short":"R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012.","apa":"Mittendorf, R. (2012). <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn.","ama":"Mittendorf R. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn; 2012.","chicago":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","ieee":"R. Mittendorf, <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:56Z","date_created":"2017-10-17T12:42:52Z","author":[{"last_name":"Mittendorf","full_name":"Mittendorf, Robert","first_name":"Robert"}],"title":"Datenschutzgerechtes DRM im Cloud Computing","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"620","user_id":"477","language":[{"iso":"ger"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"621","citation":{"ama":"Sekula S. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn; 2012.","chicago":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","ieee":"S. Sekula, <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","short":"S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012.","mla":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","bibtex":"@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }","apa":"Sekula, S. (2012). <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn."},"year":"2012","title":"Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing","date_created":"2017-10-17T12:42:53Z","author":[{"last_name":"Sekula","full_name":"Sekula, Stephan","first_name":"Stephan"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:57Z"},{"title":"Competitive and fair throughput for co-existing networks under adversarial interference","doi":"10.1145/2332432.2332488","date_updated":"2022-01-06T07:02:58Z","date_created":"2017-10-17T12:42:53Z","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"full_name":"Zhang, Jin ","last_name":"Zhang","first_name":"Jin "}],"year":"2012","citation":{"chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>","apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300."},"page":"291-300","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T06:45:25Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"623","user_id":"15504","department":[{"_id":"79"}],"abstract":[{"text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.","lang":"eng"}],"file":[{"file_size":210382,"file_name":"623-PODC-2012_01.pdf","access_level":"closed","file_id":"1241","date_updated":"2018-03-15T06:45:25Z","creator":"florida","date_created":"2018-03-15T06:45:25Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)"},{"language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"629","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"status":"public","type":"bachelorsthesis","title":"Attribute-basierte Verschlüsselung","date_created":"2017-10-17T12:42:54Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"author":[{"last_name":"Schleiter","full_name":"Schleiter, Patrick","first_name":"Patrick"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:00Z","citation":{"chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","ieee":"P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","ama":"Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn; 2012.","bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","mla":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","apa":"Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn."},"year":"2012"},{"title":"Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze","language":[{"iso":"ger"}],"_id":"633","date_updated":"2022-01-06T07:03:01Z","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"_id":"4","name":"SFB 901 - Project Area C"}],"author":[{"first_name":"Daniel","full_name":"Pischel, Daniel","last_name":"Pischel"}],"date_created":"2017-10-17T12:42:55Z","user_id":"477","year":"2012","status":"public","citation":{"short":"D. Pischel, Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze, Universität Paderborn, 2012.","bibtex":"@book{Pischel_2012, title={Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze}, publisher={Universität Paderborn}, author={Pischel, Daniel}, year={2012} }","mla":"Pischel, Daniel. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012.","apa":"Pischel, D. (2012). <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn.","ieee":"D. Pischel, <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012.","chicago":"Pischel, Daniel. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn, 2012.","ama":"Pischel D. <i>Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze</i>. Universität Paderborn; 2012."},"type":"mastersthesis"},{"language":[{"iso":"ger"}],"user_id":"477","_id":"634","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","type":"bachelorsthesis","title":"Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen","author":[{"first_name":"Julian","last_name":"Kratzmann","full_name":"Kratzmann, Julian"}],"date_created":"2017-10-17T12:42:55Z","date_updated":"2022-01-06T07:03:01Z","publisher":"Universität Paderborn","citation":{"ieee":"J. Kratzmann, <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","chicago":"Kratzmann, Julian. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","ama":"Kratzmann J. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn; 2012.","mla":"Kratzmann, Julian. <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn, 2012.","bibtex":"@book{Kratzmann_2012, title={Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen}, publisher={Universität Paderborn}, author={Kratzmann, Julian}, year={2012} }","short":"J. Kratzmann, Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen, Universität Paderborn, 2012.","apa":"Kratzmann, J. (2012). <i>Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen</i>. Universität Paderborn."},"year":"2012"},{"title":"An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems","date_updated":"2022-01-06T07:03:02Z","author":[{"first_name":"Corinna","full_name":"Dohle (married name: Hallmann) , Corinna","last_name":"Dohle (married name: Hallmann) "},{"full_name":"Suhl, Leena","last_name":"Suhl","first_name":"Leena"}],"date_created":"2017-10-17T12:42:55Z","year":"2012","page":"404-408","citation":{"ieee":"C. Dohle (married name: Hallmann)  and L. Suhl, “An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems,” in <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 2012, pp. 404–408.","chicago":"Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” In <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 404–8, 2012.","ama":"Dohle (married name: Hallmann)  C, Suhl L. An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In: <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>. ; 2012:404-408.","apa":"Dohle (married name: Hallmann) , C., &#38; Suhl, L. (2012). An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems. In <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i> (pp. 404–408).","bibtex":"@inproceedings{Dohle (married name: Hallmann) _Suhl_2012, title={An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems}, booktitle={Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)}, author={Dohle (married name: Hallmann) , Corinna and Suhl, Leena}, year={2012}, pages={404–408} }","mla":"Dohle (married name: Hallmann) , Corinna, and Leena Suhl. “An Optimization Model for the Optimal Usage of Water Tanks in Water Supply Systems.” <i>Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)</i>, 2012, pp. 404–08.","short":"C. Dohle (married name: Hallmann) , L. Suhl, in: Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD), 2012, pp. 404–408."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-14T14:15:10Z","_id":"635","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"15504","abstract":[{"lang":"eng","text":"In Germany, the optimization of water supply systems has gained more and more attention due to a growing cost pressure for German municipal utilities. In this work, a model is presented which optimizes the usage of water tanks. On the one hand locations of new tanks are identified, and on the other hand the size of existing tanks is optimized, subject to satisfying the demand of clients and providing the necessary amount of fire water during all time periods. The main difficulty is the consideration of the head loss equation which is required to model the hydraulic properties of a water supply system. As this equation is non-convex and quadratic the optimization model becomes a non-convex Mixed Integer Quadratically Constrained Program (MIQCP). To solve this MIQCP different solution methods are applied."}],"status":"public","file":[{"date_updated":"2018-03-14T14:15:10Z","creator":"florida","date_created":"2018-03-14T14:15:10Z","file_size":164455,"file_id":"1233","file_name":"635-Dohle_Apmod_2012.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)","type":"conference"},{"year":"2012","citation":{"apa":"Hilger, I. (2012). <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn.","mla":"Hilger, Ina. <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn, 2012.","bibtex":"@book{Hilger_2012, title={Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken}, publisher={Universität Paderborn}, author={Hilger, Ina}, year={2012} }","short":"I. Hilger, Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken, Universität Paderborn, 2012.","ama":"Hilger I. <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn; 2012.","ieee":"I. Hilger, <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn, 2012.","chicago":"Hilger, Ina. <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn, 2012."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:22Z","author":[{"last_name":"Hilger","full_name":"Hilger, Ina","first_name":"Ina"}],"date_created":"2017-10-17T12:42:42Z","title":"Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"566","user_id":"477","language":[{"iso":"ger"}]},{"status":"public","type":"misc","language":[{"iso":"eng"}],"user_id":"398","department":[{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"_id":"13462","citation":{"ieee":"P. Lewis, M. Platzner, and X. Yao, <i>An outlook for self-awareness in computing systems</i>. Awareness Magazine, 2012.","chicago":"Lewis, Peter, Marco Platzner, and Xin Yao. <i>An Outlook for Self-Awareness in Computing Systems</i>. Awareness Magazine, 2012.","ama":"Lewis P, Platzner M, Yao X. <i>An Outlook for Self-Awareness in Computing Systems</i>. Awareness Magazine; 2012.","apa":"Lewis, P., Platzner, M., &#38; Yao, X. (2012). <i>An outlook for self-awareness in computing systems</i>. Awareness Magazine.","mla":"Lewis, Peter, et al. <i>An Outlook for Self-Awareness in Computing Systems</i>. Awareness Magazine, 2012.","bibtex":"@book{Lewis_Platzner_Yao_2012, title={An outlook for self-awareness in computing systems}, publisher={Awareness Magazine}, author={Lewis, Peter and Platzner, Marco and Yao, Xin}, year={2012} }","short":"P. Lewis, M. Platzner, X. Yao, An Outlook for Self-Awareness in Computing Systems, Awareness Magazine, 2012."},"year":"2012","title":"An outlook for self-awareness in computing systems","date_created":"2019-09-30T09:24:09Z","author":[{"last_name":"Lewis","full_name":"Lewis, Peter","first_name":"Peter"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Xin","full_name":"Yao, Xin","last_name":"Yao"}],"publisher":"Awareness Magazine","date_updated":"2022-01-06T06:51:36Z"},{"doi":"10.1109/ReConFig.2012.6416745","author":[{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"first_name":"Hendrik","last_name":"Hangmann","full_name":"Hangmann, Hendrik"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"date_updated":"2023-09-26T13:42:26Z","citation":{"short":"M. Happe, H. Hangmann, A. Agne, C. Plessl, in: Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.","bibtex":"@inproceedings{Happe_Hangmann_Agne_Plessl_2012, title={Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>}, booktitle={Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Hangmann, Hendrik and Agne, Andreas and Plessl, Christian}, year={2012}, pages={1–8} }","mla":"Happe, Markus, et al. “Eight Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2012, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>.","apa":"Happe, M., Hangmann, H., Agne, A., &#38; Plessl, C. (2012). Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators. <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">https://doi.org/10.1109/ReConFig.2012.6416745</a>","ieee":"M. Happe, H. Hangmann, A. Agne, and C. Plessl, “Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators,” in <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 2012, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>.","chicago":"Happe, Markus, Hendrik Hangmann, Andreas Agne, and Christian Plessl. “Eight Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” In <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2012. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">https://doi.org/10.1109/ReConFig.2012.6416745</a>.","ama":"Happe M, Hangmann H, Agne A, Plessl C. Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators. In: <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2012:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>"},"page":"1-8","has_accepted_license":"1","file_date_updated":"2018-03-15T06:48:32Z","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"_id":"615","status":"public","type":"conference","title":"Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators","date_created":"2017-10-17T12:42:51Z","publisher":"IEEE","year":"2012","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"creator":"florida","date_created":"2018-03-15T06:48:32Z","date_updated":"2018-03-15T06:48:32Z","access_level":"closed","file_name":"615-ReConFig12_01.pdf","file_id":"1246","file_size":730144,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","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, the accuracy of the simulations is to some extent questionable and they require a high computational effort if a detailed thermal model is used.For experimental evaluation of real-world temperature management methods, often synthetic heat sources are employed. Therefore, in this paper we investigated the question if we can create significant rises in temperature on modern FPGAs to enable future evaluation of thermal management techniques based on experiments in contrast to simulations. Therefore, we have developed eight different heat-generating cores that use different subsets of the FPGA resources. Our experimental results show that, according to the built-in thermal diode of our Xilinx Virtex-5 FPGA, we can increase the chip temperature by 134 degree C in less than 12 minutes by only utilizing about 21% of the slices."}],"publication":"Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)"},{"quality_controlled":"1","year":"2012","date_created":"2017-10-17T12:42:47Z","publisher":"IEEE","title":"Pragma based parallelization - Trading hardware efficiency for ease of use?","publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":371235,"file_id":"1257","file_name":"591-ReConFig2012Kenter_Schmitz_Plessl.pdf","access_level":"closed","date_updated":"2018-03-15T08:33:18Z","creator":"florida","date_created":"2018-03-15T08:33:18Z"}],"abstract":[{"lang":"eng","text":"One major obstacle for a wide spread FPGA usage in general-purpose computing is the development tool flow that requires much higher effort than for pure software solutions. Convey Computer promises a solution to this problem for their HC-1 platform, where the FPGAs are configured to run as a vector processor and the software source code can be annotated with pragmas that guide an automated vectorization process. We investigate this approach for a stereo matching algorithm that has abundant parallelism and a number of different computational patterns. We note that for this case study the automated vectorization in its current state doesn’t hold its productivity promise. However, we also show that using the Vector Personality can yield a significant speedups compared to CPU implementations in two of three investigated phases of the algorithm. Those speedups don’t match custom FPGA implementations, but can come with much reduced development effort."}],"language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"chicago":"Kenter, Tobias, Christian Plessl, and Henning Schmitz. “Pragma Based Parallelization - Trading Hardware Efficiency for Ease of Use?” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2012. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">https://doi.org/10.1109/ReConFig.2012.6416773</a>.","ieee":"T. Kenter, C. Plessl, and H. Schmitz, “Pragma based parallelization - Trading hardware efficiency for ease of use?,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2012, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>.","ama":"Kenter T, Plessl C, Schmitz H. Pragma based parallelization - Trading hardware efficiency for ease of use? In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2012:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>","apa":"Kenter, T., Plessl, C., &#38; Schmitz, H. (2012). Pragma based parallelization - Trading hardware efficiency for ease of use? <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">https://doi.org/10.1109/ReConFig.2012.6416773</a>","bibtex":"@inproceedings{Kenter_Plessl_Schmitz_2012, title={Pragma based parallelization - Trading hardware efficiency for ease of use?}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Plessl, Christian and Schmitz, Henning}, year={2012}, pages={1–8} }","short":"T. Kenter, C. Plessl, H. Schmitz, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.","mla":"Kenter, Tobias, et al. “Pragma Based Parallelization - Trading Hardware Efficiency for Ease of Use?” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2012, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>."},"page":"1-8","author":[{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"},{"first_name":"Henning","full_name":"Schmitz, Henning","last_name":"Schmitz"}],"date_updated":"2023-09-26T13:41:08Z","doi":"10.1109/ReConFig.2012.6416773","type":"conference","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"_id":"591","file_date_updated":"2018-03-15T08:33:18Z"},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"609","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":"31","name":"Engineering Proprioception in Computing Systems","grant_number":"257906"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:14:17Z","ddc":["040"],"publication":"Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)","type":"conference","status":"public","file":[{"file_size":146789,"file_name":"609-happe12_fpl_awareness.pdf","access_level":"closed","file_id":"1249","date_updated":"2018-03-15T08:14:17Z","creator":"florida","date_created":"2018-03-15T08:14:17Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Today's design and operation principles and methods do not scale well with future reconfigurable computing systems due to an increased complexity in system architectures and applications, run-time dynamics and corresponding requirements. Hence, novel design and operation principles and methods are needed that possibly break drastically with the static ones we have built into our systems and the fixed abstraction layers we have cherished over the last decades. Thus, we propose a HW/SW platform that collects and maintains information about its state and progress which enables the system to reason about its behavior (self-awareness) and utilizes its knowledge to effectively and autonomously adapt its behavior to changing requirements (self-expression).To enable self-awareness, our compute nodes collect information using a variety of sensors, i.e. performance counters and thermal diodes, and use internal self-awareness models that process these information. For self-awareness, on-line learning is crucial such that the node learns and continuously updates its models at run-time to react to changing conditions. To enable self-expression, we break with the classic design-time abstraction layers of hardware, operating system and software. In contrast, our system is able to vertically migrate functionalities between the layers at run-time to exploit trade-offs between abstraction and optimization.This paper presents a heterogeneous multi-core architecture, that enables self-awareness and self-expression, an operating system for our proposed hardware/software platform and a novel self-expression method.","lang":"eng"}],"date_created":"2017-10-17T12:42:50Z","author":[{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_updated":"2023-09-26T13:41:36Z","title":"Hardware/Software Platform for Self-aware Compute Nodes","has_accepted_license":"1","quality_controlled":"1","page":"8-9","citation":{"ama":"Happe M, Agne A, Plessl C, Platzner M. Hardware/Software Platform for Self-aware Compute Nodes. In: <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>. ; 2012:8-9.","chicago":"Happe, Markus, Andreas Agne, Christian Plessl, and Marco Platzner. “Hardware/Software Platform for Self-Aware Compute Nodes.” In <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 8–9, 2012.","ieee":"M. Happe, A. Agne, C. Plessl, and M. Platzner, “Hardware/Software Platform for Self-aware Compute Nodes,” in <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 2012, pp. 8–9.","apa":"Happe, M., Agne, A., Plessl, C., &#38; Platzner, M. (2012). Hardware/Software Platform for Self-aware Compute Nodes. <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 8–9.","bibtex":"@inproceedings{Happe_Agne_Plessl_Platzner_2012, title={Hardware/Software Platform for Self-aware Compute Nodes}, booktitle={Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)}, author={Happe, Markus and Agne, Andreas and Plessl, Christian and Platzner, Marco}, year={2012}, pages={8–9} }","short":"M. Happe, A. Agne, C. Plessl, M. Platzner, in: Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.","mla":"Happe, Markus, et al. “Hardware/Software Platform for Self-Aware Compute Nodes.” <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 2012, pp. 8–9."},"year":"2012"},{"publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:20:24Z","date_created":"2018-03-15T10:20:24Z","creator":"florida","file_size":288508,"access_level":"closed","file_id":"1275","file_name":"567-ba-ca-12a.pdf"}],"abstract":[{"lang":"eng","text":"Heterogeneous machines are gaining momentum in the High Performance Computing field, due to the theoretical speedups and power consumption. In practice, while some applications meet the performance expectations, heterogeneous architectures still require a tremendous effort from the application developers. This work presents a code generation method to port codes into heterogeneous platforms, based on transformations of the control flow into function calls. The results show that the cost of the function-call mechanism is affordable for the tested HPC kernels. The complete toolchain, based on the LLVM compiler infrastructure, is fully automated once the sequential specification is provided."}],"language":[{"iso":"eng"}],"ddc":["040"],"quality_controlled":"1","year":"2012","date_created":"2017-10-17T12:42:42Z","publisher":"IEEE","title":"Turning control flow graphs into function calls: Code generation for heterogeneous architectures","type":"conference","status":"public","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","_id":"567","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-15T10:20:24Z","has_accepted_license":"1","page":"559-565","citation":{"apa":"Barrio, P., Carreras, C., Sierra, R., Kenter, T., &#38; Plessl, C. (2012). Turning control flow graphs into function calls: Code generation for heterogeneous architectures. <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 559–565. <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">https://doi.org/10.1109/HPCSim.2012.6266973</a>","bibtex":"@inproceedings{Barrio_Carreras_Sierra_Kenter_Plessl_2012, title={Turning control flow graphs into function calls: Code generation for heterogeneous architectures}, DOI={<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)}, publisher={IEEE}, author={Barrio, Pablo and Carreras, Carlos and Sierra, Roberto and Kenter, Tobias and Plessl, Christian}, year={2012}, pages={559–565} }","short":"P. Barrio, C. Carreras, R. Sierra, T. Kenter, C. Plessl, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS), IEEE, 2012, pp. 559–565.","mla":"Barrio, Pablo, et al. “Turning Control Flow Graphs into Function Calls: Code Generation for Heterogeneous Architectures.” <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, IEEE, 2012, pp. 559–65, doi:<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>.","ieee":"P. Barrio, C. Carreras, R. Sierra, T. Kenter, and C. Plessl, “Turning control flow graphs into function calls: Code generation for heterogeneous architectures,” in <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 2012, pp. 559–565, doi: <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>.","chicago":"Barrio, Pablo, Carlos Carreras, Roberto Sierra, Tobias Kenter, and Christian Plessl. “Turning Control Flow Graphs into Function Calls: Code Generation for Heterogeneous Architectures.” In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 559–65. IEEE, 2012. <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">https://doi.org/10.1109/HPCSim.2012.6266973</a>.","ama":"Barrio P, Carreras C, Sierra R, Kenter T, Plessl C. Turning control flow graphs into function calls: Code generation for heterogeneous architectures. In: <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>. IEEE; 2012:559-565. doi:<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>"},"author":[{"first_name":"Pablo","full_name":"Barrio, Pablo","last_name":"Barrio"},{"full_name":"Carreras, Carlos","last_name":"Carreras","first_name":"Carlos"},{"full_name":"Sierra, Roberto","last_name":"Sierra","first_name":"Roberto"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"date_updated":"2023-09-26T13:42:54Z","doi":"10.1109/HPCSim.2012.6266973"},{"year":"2012","page":"559-562","citation":{"ama":"Rüthing C, Happe M, Agne A, Plessl C. Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs. In: <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2012:559-562. doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>","ieee":"C. Rüthing, M. Happe, A. Agne, and C. Plessl, “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs,” in <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 2012, pp. 559–562, doi: <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","chicago":"Rüthing, Christoph, Markus Happe, Andreas Agne, and Christian Plessl. “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs.” In <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 559–62. IEEE, 2012. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>.","bibtex":"@inproceedings{Rüthing_Happe_Agne_Plessl_2012, title={Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs}, DOI={<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>}, booktitle={Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Rüthing, Christoph and Happe, Markus and Agne, Andreas and Plessl, Christian}, year={2012}, pages={559–562} }","short":"C. Rüthing, M. Happe, A. Agne, C. Plessl, in: Proceedings of the International Conference on Field Programmable Logic and Applications (FPL), IEEE, 2012, pp. 559–562.","mla":"Rüthing, Christoph, et al. “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs.” <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2012, pp. 559–62, doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","apa":"Rüthing, C., Happe, M., Agne, A., &#38; Plessl, C. (2012). Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs. <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 559–562. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>"},"has_accepted_license":"1","quality_controlled":"1","title":"Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs","doi":"10.1109/FPL.2012.6339370","publisher":"IEEE","date_updated":"2023-09-26T13:42:03Z","date_created":"2017-10-17T12:42:51Z","author":[{"first_name":"Christoph","last_name":"Rüthing","full_name":"Rüthing, Christoph"},{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"abstract":[{"lang":"eng","text":"While numerous publications have presented ring oscillator designs for temperature measurements a detailed study of the ring oscillator's design space is still missing. In this work, we introduce metrics for comparing the performance and area efficiency of ring oscillators and a methodology for determining these metrics. As a result, we present a systematic study of the design space for ring oscillators for a Xilinx Virtex-5 platform FPGA."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"612-ruething_fpl12.pdf","file_id":"1247","file_size":202923,"creator":"florida","date_created":"2018-03-15T06:49:03Z","date_updated":"2018-03-15T06:49:03Z"}],"publication":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:49:03Z","_id":"612","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278"},{"_id":"643","date_updated":"2022-01-06T07:03:04Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:57Z","author":[{"first_name":"Daniel","full_name":"Welp, Daniel","last_name":"Welp"}],"user_id":"15504","title":"User-space Scheduling for Heterogeneous System under Linux","type":"mastersthesis","year":"2011","status":"public","citation":{"ama":"Welp D. <i>User-Space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn; 2011.","ieee":"D. Welp, <i>User-space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn, 2011.","chicago":"Welp, Daniel. <i>User-Space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn, 2011.","apa":"Welp, D. (2011). <i>User-space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn.","mla":"Welp, Daniel. <i>User-Space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn, 2011.","short":"D. Welp, User-Space Scheduling for Heterogeneous System under Linux, Universität Paderborn, 2011.","bibtex":"@book{Welp_2011, title={User-space Scheduling for Heterogeneous System under Linux}, publisher={Universität Paderborn}, author={Welp, Daniel}, year={2011} }"}},{"file":[{"date_updated":"2018-03-14T13:58:11Z","date_created":"2018-03-14T13:58:11Z","creator":"florida","file_size":268500,"file_name":"645-spaa70-scheideler.pdf","access_level":"closed","file_id":"1228","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"text":"In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-14T13:58:11Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"645","citation":{"ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–158.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 149–58, 2011. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>.","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2011:149-158. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>","short":"B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>.","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011}, pages={149–158} }","apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 149–158). <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>"},"page":"149-158","year":"2011","has_accepted_license":"1","doi":"10.1145/1989493.1989516","title":"Stabilizing consensus with the power of two choices","author":[{"full_name":"Doerr, Benjamin","last_name":"Doerr","first_name":"Benjamin"},{"first_name":"Leslie Ann","full_name":"Goldberg, Leslie Ann","last_name":"Goldberg"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:42:57Z","date_updated":"2022-01-06T07:03:05Z"},{"author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2017-10-17T12:42:58Z","date_updated":"2022-01-06T07:03:06Z","doi":"10.1007/978-3-642-24550-3_31","title":"Self-Stabilizing DeBruijn Networks","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing DeBruijn Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler, Christian}, year={2011}, pages={416–430}, collection={LNCS} }","mla":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 416–30, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>.","short":"A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","apa":"Richa, A. W., &#38; Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 416–430). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">https://doi.org/10.1007/978-3-642-24550-3_31</a>","chicago":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 416–30. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">https://doi.org/10.1007/978-3-642-24550-3_31</a>.","ieee":"A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 416–430.","ama":"Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:416-430. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>"},"page":"416-430","year":"2011","user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"646","file_date_updated":"2018-03-14T13:57:26Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"date_updated":"2018-03-14T13:57:26Z","date_created":"2018-03-14T13:57:26Z","creator":"florida","file_size":339664,"file_name":"646-SSS2011-Scheideler_02.pdf","file_id":"1227","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected."}]}]