@inbook{18290, abstract = {{Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen, die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster eingesetzt werden. }}, author = {{Suess, Tim and Wiesemann, Timo and Fischer, Matthias}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, pages = {{39--52}}, title = {{{Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems}}}, year = {{2010}}, } @inproceedings{16414, author = {{Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.}}, isbn = {{9781450300797}}, title = {{{Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10}}}, doi = {{10.1145/1810479}}, year = {{2010}}, } @inbook{16505, abstract = {{We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.}}, author = {{Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642172885}}, issn = {{0302-9743}}, title = {{{Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}}}, doi = {{10.1007/978-3-642-17289-2_60}}, year = {{2010}}, } @inbook{16365, author = {{Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783642132834}}, issn = {{0302-9743}}, pages = {{168--182}}, title = {{{A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}}}, doi = {{10.1007/978-3-642-13284-1_14}}, year = {{2010}}, } @inproceedings{16401, author = {{Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10}}, isbn = {{9781450300797}}, title = {{{A local O(n2) gathering algorithm}}}, doi = {{10.1145/1810479.1810523}}, year = {{2010}}, } @book{16403, editor = {{Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.}}, isbn = {{9783642141614}}, issn = {{0302-9743}}, title = {{{Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}}}, doi = {{10.1007/978-3-642-14162-1}}, year = {{2010}}, } @book{16404, editor = {{Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.}}, isbn = {{9783642141614}}, issn = {{0302-9743}}, title = {{{Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}}}, doi = {{10.1007/978-3-642-14165-2}}, year = {{2010}}, } @phdthesis{19605, author = {{Lürwer-Brüggemeier, Katharina}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}}}, volume = {{261}}, year = {{2009}}, } @phdthesis{19614, author = {{Mense, Mario}}, isbn = {{978-3-939350-79-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{On Fault-Tolerant Data Placement in Storage Networks}}}, volume = {{260}}, year = {{2009}}, } @phdthesis{19617, author = {{Kortenjan, Michael}}, isbn = {{978-3-939350-77-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}}}, volume = {{258}}, year = {{2009}}, } @phdthesis{19618, author = {{Bonorden, Olaf}}, isbn = {{978-3-939350-76-7}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}}}, volume = {{257}}, year = {{2009}}, } @techreport{19722, author = {{Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}}, title = {{{Complexity and approximation of a geometric local robot assignment problem}}}, year = {{2009}}, } @inbook{19724, abstract = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}}, author = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}}, booktitle = {{Algorithmic Aspects of Wireless Sensor Networks}}, isbn = {{9783642054334}}, issn = {{0302-9743}}, pages = {{252--262}}, publisher = {{Springer}}, title = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}}, doi = {{10.1007/978-3-642-05434-1_25}}, year = {{2009}}, } @techreport{19825, abstract = {{Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.}}, author = {{Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}}, publisher = {{Paderborn, Germany}}, title = {{{3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}}, year = {{2009}}, } @article{19830, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, issn = {{1383-469X}}, journal = {{Mobile Networks and Applications (MONET)}}, pages = {{309--321}}, title = {{{Minimal Energy Path Planning for Wireless Robots}}}, doi = {{10.1007/s11036-008-0150-5}}, year = {{2009}}, } @article{19831, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, issn = {{1018-4864}}, journal = {{Telecommunication Systems}}, pages = {{25--37}}, title = {{{Utilizing detours for energy conservation in mobile wireless networks}}}, doi = {{10.1007/s11235-009-9188-3}}, volume = {{43}}, year = {{2009}}, } @inproceedings{19901, author = {{Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and Spirakis, Paul G.}}, booktitle = {{34st International Symposium on Mathematical Foundations of Computer Science}}, isbn = {{9781493928637}}, pages = {{600----611}}, title = {{{Colouring Non-sparse Random Intersection Graphs}}}, doi = {{10.1007/978-1-4939-2864-4_597}}, year = {{2009}}, } @inproceedings{19904, author = {{Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}}, booktitle = {{ Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium}}, pages = {{1----11}}, title = {{{Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}}}, doi = {{10.1109/IPDPS.2009.5161002}}, year = {{2009}}, } @inproceedings{19934, author = {{Deveci, Deniz and Kortenjan, Michael and Schomaker, Gunnar}}, booktitle = {{ Parallel and Distributed Computing and Systems, Nr. 21}}, title = {{{Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions}}}, year = {{2009}}, } @inproceedings{20254, abstract = {{One of the prominent challenges in mobile robotics is to develop control methodologies that allow the adaptation to dynamic and unforeseen environments. The classic approach of hand-coded controllers is very efficient for well-defined tasks and specific environments but poor in adapting to changing environmental conditions. One alternative approach is the application of evolutionary algorithms which need, in turn, easily evolvable representations of controllers. In this paper, we investigate one promising approach of an artificial hormone system as a control paradigm which is believed to be easily optimized by evolutionary processes. In a first step of this research, we focus on the simple task of collision avoidance. We present a brief mathematical analysis of this controller approach and an implementation of the controller on a mobile robot to check the feasibility in principle of our approach. The task is successfully accomplished and we conclude with a discussion of the hormone dynamics in the robot.}}, author = {{Stradner, Jürgen and Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{2009 IEEE/RSJ International Conference on Intelligent Robots and Systems}}, isbn = {{9781424438037}}, title = {{{Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware}}}, doi = {{10.1109/iros.2009.5354056}}, year = {{2009}}, }