[{"file":[{"date_updated":"2018-03-14T14:13:48Z","relation":"main_file","file_size":693236,"access_level":"closed","file_name":"639-HumaGerthCAiSE12.pdf","content_type":"application/pdf","success":1,"file_id":"1231","creator":"florida","date_created":"2018-03-14T14:13:48Z"}],"date_created":"2017-10-17T12:42:56Z","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering","abstract":[{"lang":"eng","text":"Service-oriented computing (SOC) emerges as a promising trend solving many issues in distributed software development. Following the essence of SOC, service descriptions are dened by the service partners based on current standards, e.g., WSDL [15]. However, these standards are mostly structural and do not provide any behavioral description, which may lead to inaccurate service discovery results. There is a requirement for a rich service description language for service partners that encompasses the structural as well as behavioral information in the service description. Furthermore, service discovery based on an automatic matching of these comprehensive service descriptions is a complex task, which is further complicated through the heterogeneity of the service partners' domains in terms of dierent underlying ontologies. In this paper, we propose a rich service description language based on UML, which allows the specication of structural and behavioral features of a service. In addition, we also briefly discuss how some existing matching approaches can be extended to dene an automatic matching mechanism for rich service descriptions resolving the underlying heterogeneity."}],"series_title":"CEUR Workshop Proceedings","language":[{"iso":"eng"}],"title":"A UML-based Rich Service Description for Automatic Service Discovery","year":"2012","author":[{"last_name":"Huma","first_name":"Zille","full_name":"Huma, Zille"},{"full_name":"Gerth, Christian","first_name":"Christian","last_name":"Gerth"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"},{"full_name":"Juwig, Oliver","first_name":"Oliver","last_name":"Juwig"}],"date_updated":"2022-01-06T07:03:03Z","file_date_updated":"2018-03-14T14:13:48Z","citation":{"short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp. 90--97.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “A UML-Based Rich Service Description for Automatic Service Discovery.” In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 90--97. CEUR Workshop Proceedings, 2012.","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). A UML-based Rich Service Description for Automatic Service Discovery. In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i> (pp. 90--97).","ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “A UML-based Rich Service Description for Automatic Service Discovery,” in <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 2012, pp. 90--97.","ama":"Huma Z, Gerth C, Engels G, Juwig O. A UML-based Rich Service Description for Automatic Service Discovery. In: <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>. CEUR Workshop Proceedings. ; 2012:90--97.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={CEUR Workshop Proceedings}, title={A UML-based Rich Service Description for Automatic Service Discovery}, booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings} }","mla":"Huma, Zille, et al. “A UML-Based Rich Service Description for Automatic Service Discovery.” <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 2012, pp. 90--97."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"90--97","_id":"639","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1"},{"page":"1261--1271","_id":"640","user_id":"15504","doi":"10.1109/IPDPS.2012.115","ddc":["040"],"status":"public","title":"A Self-Stabilization Process for Small-World Networks","year":"2012","author":[{"last_name":"Kniesburges","first_name":"Sebastian","full_name":"Kniesburges, Sebastian"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T07:03:04Z","has_accepted_license":"1","file":[{"file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","file_size":210176,"access_level":"closed","relation":"main_file","date_updated":"2018-03-14T14:13:13Z","file_id":"1230","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-14T14:13:13Z"}],"date_created":"2017-10-17T12:42:56Z","type":"conference","department":[{"_id":"79"}],"file_date_updated":"2018-03-14T14:13:13Z","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","citation":{"mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1261--1271. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1261--1271). <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1261--1271, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>."},"abstract":[{"text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"publisher":"Universität Paderborn","_id":"641","user_id":"15504","author":[{"first_name":"Jonathan","last_name":"Schluessler","full_name":"Schluessler, Jonathan"}],"status":"public","year":"2012","title":"A Forensic Framework for Automatic Information Retrieval in Distributed Systems","date_updated":"2022-01-06T07:03:04Z","date_created":"2017-10-17T12:42:57Z","type":"mastersthesis","citation":{"apa":"Schluessler, J. (2012). <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn.","ieee":"J. Schluessler, <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","short":"J. Schluessler, A Forensic Framework for Automatic Information Retrieval in Distributed Systems, Universität Paderborn, 2012.","chicago":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","mla":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","ama":"Schluessler J. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn; 2012.","bibtex":"@book{Schluessler_2012, title={A Forensic Framework for Automatic Information Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler, Jonathan}, year={2012} }"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"publication_identifier":{"issn":["0164-0925"]},"author":[{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"},{"full_name":"Lam, Patrick","first_name":"Patrick","last_name":"Lam"},{"last_name":"Hendren","first_name":"Laurie","full_name":"Hendren, Laurie"}],"year":"2012","title":"Partially Evaluating Finite-State Runtime Monitors Ahead of Time","intvolume":"        34","publication_status":"published","date_updated":"2022-01-06T07:01:41Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.bodden.de/pubs/blh12partially.pdf"}],"doi":"10.1145/2220365.2220366","issue":"2","publication":"ACM Transactions on Programming Languages and Systems","extern":"1","date_created":"2018-10-31T10:43:13Z","file":[{"date_created":"2018-11-02T15:42:24Z","creator":"ups","success":1,"content_type":"application/pdf","file_id":"5310","date_updated":"2018-11-02T15:42:24Z","relation":"main_file","file_size":2280938,"access_level":"closed","file_name":"a7-bodden.pdf"}],"department":[{"_id":"76"}],"type":"journal_article","status":"public","has_accepted_license":"1","_id":"5183","publisher":"Association for Computing Machinery (ACM)","page":"1-52","volume":34,"user_id":"477","ddc":["000"],"citation":{"mla":"Bodden, Eric, et al. “Partially Evaluating Finite-State Runtime Monitors Ahead of Time.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 34, no. 2, Association for Computing Machinery (ACM), 2012, pp. 1–52, doi:<a href=\"https://doi.org/10.1145/2220365.2220366\">10.1145/2220365.2220366</a>.","ama":"Bodden E, Lam P, Hendren L. Partially Evaluating Finite-State Runtime Monitors Ahead of Time. <i>ACM Transactions on Programming Languages and Systems</i>. 2012;34(2):1-52. doi:<a href=\"https://doi.org/10.1145/2220365.2220366\">10.1145/2220365.2220366</a>","bibtex":"@article{Bodden_Lam_Hendren_2012, title={Partially Evaluating Finite-State Runtime Monitors Ahead of Time}, volume={34}, DOI={<a href=\"https://doi.org/10.1145/2220365.2220366\">10.1145/2220365.2220366</a>}, number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={Association for Computing Machinery (ACM)}, author={Bodden, Eric and Lam, Patrick and Hendren, Laurie}, year={2012}, pages={1–52} }","apa":"Bodden, E., Lam, P., &#38; Hendren, L. (2012). Partially Evaluating Finite-State Runtime Monitors Ahead of Time. <i>ACM Transactions on Programming Languages and Systems</i>, <i>34</i>(2), 1–52. <a href=\"https://doi.org/10.1145/2220365.2220366\">https://doi.org/10.1145/2220365.2220366</a>","ieee":"E. Bodden, P. Lam, and L. Hendren, “Partially Evaluating Finite-State Runtime Monitors Ahead of Time,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 34, no. 2, pp. 1–52, 2012.","short":"E. Bodden, P. Lam, L. Hendren, ACM Transactions on Programming Languages and Systems 34 (2012) 1–52.","chicago":"Bodden, Eric, Patrick Lam, and Laurie Hendren. “Partially Evaluating Finite-State Runtime Monitors Ahead of Time.” <i>ACM Transactions on Programming Languages and Systems</i> 34, no. 2 (2012): 1–52. <a href=\"https://doi.org/10.1145/2220365.2220366\">https://doi.org/10.1145/2220365.2220366</a>."},"file_date_updated":"2018-11-02T15:42:24Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}]},{"citation":{"mla":"Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation of Multi-Layer Systems.” <i>Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>, 2012, pp. 776–92, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_49\">10.1007/978-3-642-33666-9_49</a>.","ama":"Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and modular transformation of multi-layer systems. In: <i>Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>. LNCS. ; 2012:776-792. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_49\">10.1007/978-3-642-33666-9_49</a>","bibtex":"@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based configuration and modular transformation of multi-layer systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33666-9_49\">10.1007/978-3-642-33666-9_49</a>}, booktitle={Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS} }","apa":"Besova, G., Walther, S., Wehrheim, H., &#38; Becker, S. (2012). Weaving-based configuration and modular transformation of multi-layer systems. In <i>Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i> (pp. 776–792). <a href=\"https://doi.org/10.1007/978-3-642-33666-9_49\">https://doi.org/10.1007/978-3-642-33666-9_49</a>","ieee":"G. Besova, S. Walther, H. Wehrheim, and S. Becker, “Weaving-based configuration and modular transformation of multi-layer systems,” in <i>Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>, 2012, pp. 776–792.","chicago":"Besova, Galina, Sven Walther, Heike Wehrheim, and Steffen Becker. “Weaving-Based Configuration and Modular Transformation of Multi-Layer Systems.” In <i>Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>, 776–92. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_49\">https://doi.org/10.1007/978-3-642-33666-9_49</a>.","short":"G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS), 2012, pp. 776–792."},"file_date_updated":"2018-03-15T10:24:06Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","_id":"565","page":"776-792","user_id":"477","ddc":["040"],"publication":"Proceedings of the 15th International Conference on Model Driven Engineering Languages & Systems (MoDELS)","abstract":[{"text":"In model-driven development of multi-layer systems (e.g. application, platform and infrastructure), each layer is usually described by separate models. When generating analysis models or code, these separate models rst of all need to be linked. Hence, existing model transformations for single layers cannot be simply re-used. In this paper, we present a modular approach to the transformation of multi-layer systems. It employs model weaving to dene the interconnections between models of dierent layers. The weaving models themselves are subject to model transformations: The result of transforming a weaving model constitutes a conguration for the models obtained by transforming single layers, thereby allowing for a re-use of existing model transformations. We exemplify our approach by the generation of analysis models for component-based software.","lang":"eng"}],"date_created":"2017-10-17T12:42:42Z","file":[{"access_level":"closed","file_size":589972,"file_name":"565-Besova_et_al._-_2012_-_Weaving-Based_Configuration_and_Modular_Transformation_of_Multi-layer_Systems_01.pdf","date_updated":"2018-03-15T10:24:06Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1276","creator":"florida","date_created":"2018-03-15T10:24:06Z"}],"department":[{"_id":"77"}],"type":"conference","author":[{"full_name":"Besova, Galina","last_name":"Besova","first_name":"Galina"},{"full_name":"Walther, Sven","last_name":"Walther","first_name":"Sven"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}],"year":"2012","title":"Weaving-based configuration and modular transformation of multi-layer systems","date_updated":"2022-01-06T07:02:20Z","series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-33666-9_49"},{"type":"bachelorsthesis","date_created":"2017-10-17T12:42:42Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"bibtex":"@book{Hilger_2012, title={Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken}, publisher={Universität Paderborn}, author={Hilger, Ina}, year={2012} }","ama":"Hilger I. <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn; 2012.","mla":"Hilger, Ina. <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.","short":"I. Hilger, Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken, Universität Paderborn, 2012.","ieee":"I. Hilger, <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn, 2012.","apa":"Hilger, I. (2012). <i>Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken</i>. Universität Paderborn."},"user_id":"477","_id":"566","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:22Z","author":[{"first_name":"Ina","last_name":"Hilger","full_name":"Hilger, Ina"}],"status":"public","title":"Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken","year":"2012"},{"type":"misc","department":[{"_id":"78"}],"date_created":"2019-09-30T09:24:09Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"citation":{"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} }","ama":"Lewis P, Platzner M, Yao X. <i>An Outlook for Self-Awareness in Computing Systems</i>. Awareness Magazine; 2012.","mla":"Lewis, Peter, et al. <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.","short":"P. Lewis, M. Platzner, X. Yao, An Outlook for Self-Awareness in Computing Systems, Awareness Magazine, 2012.","ieee":"P. Lewis, M. Platzner, and X. Yao, <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."},"user_id":"398","publisher":"Awareness Magazine","_id":"13462","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:36Z","status":"public","year":"2012","title":"An outlook for self-awareness in computing systems","author":[{"last_name":"Lewis","first_name":"Peter","full_name":"Lewis, Peter"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"first_name":"Xin","last_name":"Yao","full_name":"Yao, Xin"}]},{"status":"public","year":"2012","title":"Coalitional and Strategic Market Games","author":[{"last_name":"Brangewitz","first_name":"Sonja","full_name":"Brangewitz, Sonja"}],"date_updated":"2022-11-30T14:47:46Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"34169","ddc":["330"],"user_id":"477","file_date_updated":"2022-11-30T14:44:47Z","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"citation":{"mla":"Brangewitz, Sonja. <i>Coalitional and Strategic Market Games</i>. 2012.","bibtex":"@book{Brangewitz_2012, place={Universität Bielefeld}, title={Coalitional and Strategic Market Games}, author={Brangewitz, Sonja}, year={2012} }","ama":"Brangewitz S. <i>Coalitional and Strategic Market Games</i>.; 2012.","ieee":"S. Brangewitz, <i>Coalitional and Strategic Market Games</i>. Universität Bielefeld, 2012.","apa":"Brangewitz, S. (2012). <i>Coalitional and Strategic Market Games</i>.","short":"S. Brangewitz, Coalitional and Strategic Market Games, Universität Bielefeld, 2012.","chicago":"Brangewitz, Sonja. <i>Coalitional and Strategic Market Games</i>. Universität Bielefeld, 2012."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"file":[{"access_level":"closed","file_size":1277591,"file_name":"Dissertation-Brangewitz.pdf","date_updated":"2022-11-30T14:44:47Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"34170","creator":"florida","date_created":"2022-11-30T14:44:47Z"}],"place":"Universität Bielefeld","date_created":"2022-11-30T14:43:16Z","type":"dissertation","department":[{"_id":"205"}]},{"date_updated":"2023-09-26T13:42:26Z","author":[{"full_name":"Happe, Markus","first_name":"Markus","last_name":"Happe"},{"full_name":"Hangmann, Hendrik","last_name":"Hangmann","first_name":"Hendrik"},{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","id":"16153"}],"year":"2012","title":"Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators","doi":"10.1109/ReConFig.2012.6416745","language":[{"iso":"eng"}],"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, 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.","lang":"eng"}],"publication":"Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:51Z","file":[{"creator":"florida","date_created":"2018-03-15T06:48:32Z","date_updated":"2018-03-15T06:48:32Z","relation":"main_file","file_size":730144,"access_level":"closed","file_name":"615-ReConFig12_01.pdf","content_type":"application/pdf","success":1,"file_id":"1246"}],"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15278","publisher":"IEEE","_id":"615","page":"1-8","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","grant_number":"160364472","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"quality_controlled":"1","citation":{"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>.","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>","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} }","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>","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.","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>."},"file_date_updated":"2018-03-15T06:48:32Z"},{"doi":"10.1109/ReConFig.2012.6416773","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:41:08Z","author":[{"last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145"},{"full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153"},{"first_name":"Henning","last_name":"Schmitz","full_name":"Schmitz, Henning"}],"year":"2012","title":"Pragma based parallelization - Trading hardware efficiency for ease of use?","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:47Z","file":[{"date_created":"2018-03-15T08:33:18Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1257","date_updated":"2018-03-15T08:33:18Z","relation":"main_file","access_level":"closed","file_size":371235,"file_name":"591-ReConFig2012Kenter_Schmitz_Plessl.pdf"}],"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."}],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","ddc":["040"],"user_id":"15278","_id":"591","publisher":"IEEE","page":"1-8","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - Subprojekt C2","grant_number":"160364472","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"31","grant_number":"257906","name":"Engineering Proprioception in Computing Systems"}],"quality_controlled":"1","citation":{"short":"T. Kenter, C. Plessl, H. Schmitz, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.","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>.","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} }","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>","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>."},"file_date_updated":"2018-03-15T08:33:18Z"},{"file_date_updated":"2018-03-15T08:14:17Z","citation":{"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.","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.","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} }","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.","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.","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."},"quality_controlled":"1","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"31","grant_number":"257906","name":"Engineering Proprioception in Computing Systems"}],"page":"8-9","_id":"609","ddc":["040"],"user_id":"15278","status":"public","has_accepted_license":"1","file":[{"content_type":"application/pdf","success":1,"file_id":"1249","date_updated":"2018-03-15T08:14:17Z","relation":"main_file","access_level":"closed","file_size":146789,"file_name":"609-happe12_fpl_awareness.pdf","date_created":"2018-03-15T08:14:17Z","creator":"florida"}],"date_created":"2017-10-17T12:42:50Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"publication":"Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)","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"}],"language":[{"iso":"eng"}],"year":"2012","title":"Hardware/Software Platform for Self-aware Compute Nodes","author":[{"first_name":"Markus","last_name":"Happe","full_name":"Happe, Markus"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","id":"16153"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"date_updated":"2023-09-26T13:41:36Z"},{"author":[{"last_name":"Barrio","first_name":"Pablo","full_name":"Barrio, Pablo"},{"first_name":"Carlos","last_name":"Carreras","full_name":"Carreras, Carlos"},{"last_name":"Sierra","first_name":"Roberto","full_name":"Sierra, Roberto"},{"last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145"},{"id":"16153","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian"}],"title":"Turning control flow graphs into function calls: Code generation for heterogeneous architectures","year":"2012","date_updated":"2023-09-26T13:42:54Z","language":[{"iso":"eng"}],"doi":"10.1109/HPCSim.2012.6266973","publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)","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."}],"date_created":"2017-10-17T12:42:42Z","file":[{"file_id":"1275","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:20:24Z","file_name":"567-ba-ca-12a.pdf","access_level":"closed","file_size":288508,"date_created":"2018-03-15T10:20:24Z","creator":"florida"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","status":"public","has_accepted_license":"1","publisher":"IEEE","_id":"567","page":"559-565","ddc":["040"],"user_id":"15278","citation":{"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>","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} }","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>.","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.","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>.","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>","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>."},"file_date_updated":"2018-03-15T10:20:24Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"quality_controlled":"1"},{"status":"public","has_accepted_license":"1","_id":"612","publisher":"IEEE","page":"559-562","user_id":"15278","ddc":["040"],"citation":{"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.","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>.","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>.","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>","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} }","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>","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>."},"file_date_updated":"2018-03-15T06:49:03Z","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Engineering Proprioception in Computing Systems","grant_number":"257906","_id":"31"}],"quality_controlled":"1","author":[{"full_name":"Rüthing, Christoph","first_name":"Christoph","last_name":"Rüthing"},{"full_name":"Happe, Markus","first_name":"Markus","last_name":"Happe"},{"last_name":"Agne","first_name":"Andreas","full_name":"Agne, Andreas"},{"full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","id":"16153"}],"title":"Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs","year":"2012","date_updated":"2023-09-26T13:42:03Z","language":[{"iso":"eng"}],"doi":"10.1109/FPL.2012.6339370","publication":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)","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."}],"date_created":"2017-10-17T12:42:51Z","file":[{"creator":"florida","date_created":"2018-03-15T06:49:03Z","file_name":"612-ruething_fpl12.pdf","file_size":202923,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T06:49:03Z","file_id":"1247","success":1,"content_type":"application/pdf"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference"},{"language":[{"iso":"eng"}],"doi":"10.1111/j.1742-7363.2011.00158.x","author":[{"full_name":"Dimitrov, Dinko","last_name":"Dimitrov","first_name":"Dinko"},{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"publication_identifier":{"issn":["1742-7355"]},"year":"2011","title":"Proportionality and the power of unequal parties","intvolume":"         7","date_updated":"2022-01-06T06:56:51Z","publication_status":"published","date_created":"2018-04-26T10:43:43Z","file":[{"date_created":"2018-11-07T10:41:24Z","creator":"stela","success":1,"content_type":"application/pdf","file_id":"5408","date_updated":"2018-11-07T10:41:24Z","relation":"main_file","file_size":152349,"access_level":"closed","file_name":"Proportionality and the power of unequal parties.pdf"}],"department":[{"_id":"205"},{"_id":"475"}],"type":"journal_article","publication":"International Journal of Economic Theory","issue":"2","abstract":[{"lang":"eng","text":"In this paper we introduce the concept of an overall power function that is meant\r\nto combine two sources of a party’s power in a parliament. The first source is based\r\non the possibilities for the party to be part of a majority coalition and it is typically\r\nmodeled using a cooperative simple game. The second source takes into account\r\nparties’ asymmetries outside the cooperative game and it is displayed by a vector\r\nof exogenously given weights. We adopt a normative point of view and provide an\r\naxiomatic characterization of a specific overall power function, in which the weights\r\nenter in a proportional fashion."}],"publisher":"Wiley-Blackwell","_id":"2512","page":"189-200","volume":7,"ddc":["040"],"user_id":"65453","jel":["C71","D72"],"status":"public","has_accepted_license":"1","citation":{"apa":"Dimitrov, D., &#38; Haake, C.-J. (2011). Proportionality and the power of unequal parties. <i>International Journal of Economic Theory</i>, <i>7</i>(2), 189–200. <a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">https://doi.org/10.1111/j.1742-7363.2011.00158.x</a>","ieee":"D. Dimitrov and C.-J. Haake, “Proportionality and the power of unequal parties,” <i>International Journal of Economic Theory</i>, vol. 7, no. 2, pp. 189–200, 2011.","chicago":"Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of Unequal Parties.” <i>International Journal of Economic Theory</i> 7, no. 2 (2011): 189–200. <a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">https://doi.org/10.1111/j.1742-7363.2011.00158.x</a>.","short":"D. Dimitrov, C.-J. Haake, International Journal of Economic Theory 7 (2011) 189–200.","mla":"Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of Unequal Parties.” <i>International Journal of Economic Theory</i>, vol. 7, no. 2, Wiley-Blackwell, 2011, pp. 189–200, doi:<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>.","ama":"Dimitrov D, Haake C-J. Proportionality and the power of unequal parties. <i>International Journal of Economic Theory</i>. 2011;7(2):189-200. doi:<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>","bibtex":"@article{Dimitrov_Haake_2011, title={Proportionality and the power of unequal parties}, volume={7}, DOI={<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>}, number={2}, journal={International Journal of Economic Theory}, publisher={Wiley-Blackwell}, author={Dimitrov, Dinko and Haake, Claus-Jochen}, year={2011}, pages={189–200} }"},"file_date_updated":"2018-11-07T10:41:24Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"user_id":"477","publisher":"Universität Paderborn","_id":"17997","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"}],"status":"public","title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","year":"2011","department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2020-08-17T08:08:13Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"ieee":"A. Setzer, <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","apa":"Setzer, A. (2011). <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn.","chicago":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.","mla":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","bibtex":"@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2011} }","ama":"Setzer A. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn; 2011."},"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}]},{"type":"bachelorsthesis","date_created":"2017-10-17T12:42:57Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Diehl M. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn; 2011.","bibtex":"@book{Diehl_2011, title={Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität}, publisher={Universität Paderborn}, author={Diehl, Matthias}, year={2011} }","mla":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","chicago":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","short":"M. Diehl, Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität, Universität Paderborn, 2011.","apa":"Diehl, M. (2011). <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn.","ieee":"M. Diehl, <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011."},"user_id":"477","_id":"642","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:03:04Z","author":[{"first_name":"Matthias","last_name":"Diehl","full_name":"Diehl, Matthias"}],"title":"Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität","year":"2011","status":"public"},{"_id":"643","publisher":"Universität Paderborn","user_id":"15504","status":"public","title":"User-space Scheduling for Heterogeneous System under Linux","year":"2011","author":[{"first_name":"Daniel","last_name":"Welp","full_name":"Welp, Daniel"}],"date_updated":"2022-01-06T07:03:04Z","date_created":"2017-10-17T12:42:57Z","type":"mastersthesis","citation":{"short":"D. Welp, User-Space Scheduling for Heterogeneous System under Linux, 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.","ieee":"D. Welp, <i>User-space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn, 2011.","ama":"Welp D. <i>User-Space Scheduling for Heterogeneous System under Linux</i>. 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} }","mla":"Welp, Daniel. <i>User-Space Scheduling for Heterogeneous System under Linux</i>. Universität Paderborn, 2011."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"author":[{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"}],"title":"Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution","status":"public","year":"2011","has_accepted_license":"1","date_updated":"2022-01-06T07:03:05Z","_id":"644","page":"17-20","user_id":"15504","ddc":["040"],"doi":"10.1145/2024569.2024573","citation":{"ieee":"M. von Detten, “Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution,” in <i>Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)</i>, 2011, pp. 17–20.","apa":"von Detten, M. (2011). Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution. In <i>Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)</i> (pp. 17–20). <a href=\"https://doi.org/10.1145/2024569.2024573\">https://doi.org/10.1145/2024569.2024573</a>","chicago":"Detten, Markus von. “Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution.” In <i>Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)</i>, 17–20, 2011. <a href=\"https://doi.org/10.1145/2024569.2024573\">https://doi.org/10.1145/2024569.2024573</a>.","short":"M. von Detten, in: Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), 2011, pp. 17–20.","mla":"von Detten, Markus. “Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution.” <i>Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)</i>, 2011, pp. 17–20, doi:<a href=\"https://doi.org/10.1145/2024569.2024573\">10.1145/2024569.2024573</a>.","bibtex":"@inproceedings{von Detten_2011, title={Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution}, DOI={<a href=\"https://doi.org/10.1145/2024569.2024573\">10.1145/2024569.2024573</a>}, booktitle={Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)}, author={von Detten, Markus}, year={2011}, pages={17–20} }","ama":"von Detten M. Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution. In: <i>Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)</i>. ; 2011:17-20. doi:<a href=\"https://doi.org/10.1145/2024569.2024573\">10.1145/2024569.2024573</a>"},"file_date_updated":"2018-03-14T14:08:32Z","publication":"Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"lang":"eng","text":"In reverse engineering, dynamic pattern detection is accomplished by collecting execution traces and comparing them to expected behavioral patterns. The traces are collected by manually executing the program in question and therefore represent only part of all relevant program behavior. This can lead to false conclusions about the detected patterns. In this paper, we propose to generate all relevant program traces by using symbolic execution. In order to reduce the created trace data, we allow to limit the trace collection to a user-selectable subset of the statically detected pattern candidates."}],"date_created":"2017-10-17T12:42:57Z","file":[{"creator":"florida","date_created":"2018-03-14T14:08:32Z","file_name":"644-paste09s-vonDetten_01.pdf","access_level":"closed","file_size":121611,"relation":"main_file","date_updated":"2018-03-14T14:08:32Z","file_id":"1229","content_type":"application/pdf","success":1}],"type":"conference"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"abstract":[{"lang":"eng","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."}],"citation":{"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>","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} }","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>.","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.","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>.","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>","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."},"publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-14T13:58:11Z","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:42:57Z","file":[{"creator":"florida","date_created":"2018-03-14T13:58:11Z","relation":"main_file","date_updated":"2018-03-14T13:58:11Z","file_name":"645-spaa70-scheideler.pdf","file_size":268500,"access_level":"closed","file_id":"1228","success":1,"content_type":"application/pdf"}],"has_accepted_license":"1","date_updated":"2022-01-06T07:03:05Z","author":[{"full_name":"Doerr, Benjamin","first_name":"Benjamin","last_name":"Doerr"},{"full_name":"Goldberg, Leslie Ann","last_name":"Goldberg","first_name":"Leslie Ann"},{"first_name":"Lorenz","last_name":"Minder","full_name":"Minder, Lorenz"},{"full_name":"Sauerwald, Thomas","first_name":"Thomas","last_name":"Sauerwald"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"2011","title":"Stabilizing consensus with the power of two choices","status":"public","doi":"10.1145/1989493.1989516","ddc":["040"],"user_id":"15504","_id":"645","page":"149-158"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"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} }","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>.","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>","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.","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.","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>","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>."},"file_date_updated":"2018-03-14T13:57:26Z","user_id":"15504","ddc":["040"],"_id":"646","page":"416-430","has_accepted_license":"1","status":"public","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:42:58Z","file":[{"date_created":"2018-03-14T13:57:26Z","creator":"florida","file_id":"1227","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-14T13:57:26Z","file_name":"646-SSS2011-Scheideler_02.pdf","access_level":"closed","file_size":339664}],"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","doi":"10.1007/978-3-642-24550-3_31","series_title":"LNCS","date_updated":"2022-01-06T07:03:06Z","author":[{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"year":"2011","title":"Self-Stabilizing DeBruijn Networks"}]