@inproceedings{19016, abstract = {{Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer.}}, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}}, title = {{{On Dynamic Graph Partitioning and Graph Clustering using Diffusion}}}, year = {{2010}}, } @techreport{19018, author = {{Thies, Michael and Gehweiler, Joachim}}, title = {{{Thread Migration and Checkpointing in Java}}}, year = {{2010}}, } @inproceedings{19023, author = {{Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}}, booktitle = {{Artificial Life XII (ALife XII)}}, pages = {{781--788}}, publisher = {{MIT Press}}, title = {{{Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}}}, year = {{2010}}, } @inproceedings{19029, author = {{Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}}, booktitle = {{Workshop on Internet and Network Economics (WINE)}}, isbn = {{9783642175718}}, issn = {{0302-9743}}, title = {{{Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}}}, doi = {{10.1007/978-3-642-17572-5_37}}, year = {{2010}}, } @article{1903, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, journal = {{Informatik Spektrum}}, number = {{5}}, pages = {{468----474}}, title = {{{Algorithmische Grundlagen verteilter Speichersysteme}}}, doi = {{10.1007/s00287-010-0470-2}}, year = {{2010}}, } @inproceedings{19033, author = {{Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}}, booktitle = {{Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}}, isbn = {{9780898717013}}, title = {{{Pricing Randomized Allocations}}}, doi = {{10.1137/1.9781611973075.49}}, year = {{2010}}, } @phdthesis{19041, author = {{Mahlmann, Peter}}, isbn = {{978-3-942647-02-1}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Peer-to-peer networks based on random graphs}}}, volume = {{283}}, year = {{2010}}, } @phdthesis{19042, author = {{Degener, Bastian}}, isbn = {{978-3-939350-97-2 }}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Local, distributed approximation algorithms for geometric assignment problems}}}, volume = {{278}}, year = {{2010}}, } @inproceedings{18136, abstract = {{We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}}, author = {{Fischer, Matthias and Jähn, Claudius and Suess, Tim}}, booktitle = {{Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)}}, pages = {{43--51}}, publisher = {{The Eurographics Association}}, title = {{{Asynchronous Parallel Reliefboard Computation for Scene Object Approximation}}}, doi = {{10.2312/EGPGV/EGPGV10/043-051}}, year = {{2010}}, } @inproceedings{18289, abstract = {{Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations.}}, author = {{Suess, Tim and Wiesemann, Timo and Fischer, Matthias}}, booktitle = {{2010 IEEE Fifth International Conference on Networking, Architecture, and Storage}}, isbn = {{9781424481330}}, pages = {{448 -- 456}}, title = {{{Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments}}}, doi = {{10.1109/nas.2010.52}}, year = {{2010}}, } @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}}, } @article{20255, abstract = {{By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior.}}, author = {{Schmickl, Thomas and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}}, issn = {{0921-8890}}, journal = {{Robotics and Autonomous Systems}}, number = {{9}}, pages = {{913--921}}, title = {{{Two different approaches to a macroscopic model of a bio-inspired robotic swarm}}}, doi = {{10.1016/j.robot.2009.06.002}}, volume = {{6}}, year = {{2009}}, } @inproceedings{20259, author = {{Hamann, Heiko and Troch, Inge and Breitenecker, F.}}, booktitle = {{MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling}}, title = {{{Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System}}}, year = {{2009}}, } @article{17453, author = {{Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}}, journal = {{Public Service Review: Science and Technology}}, title = {{{Self-Organisation and Self-Optimization}}}, volume = {{04}}, year = {{2009}}, } @article{19031, author = {{Briest, Patrick}}, issn = {{1611-2776}}, journal = {{it - Information Technology}}, number = {{1}}, pages = {{62--65}}, title = {{{Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)}}}, doi = {{10.1524/itit.2009.0524}}, volume = {{51}}, year = {{2009}}, } @inbook{23744, abstract = {{In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability. We consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard. Considering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3.}}, author = {{Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}}, booktitle = {{Lecture Notes in Computer Science}}, issn = {{0302-9743}}, title = {{{On Stackelberg Pricing with Computationally Bounded Consumers}}}, doi = {{10.1007/978-3-642-10841-9_6}}, year = {{2009}}, } @inproceedings{18138, abstract = {{Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task.}}, author = {{Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}}, booktitle = {{European Simulation and Modelling Conference (ESM 2009)}}, publisher = {{EUROSIS-ETI}}, title = {{{Concepts for Model Verification and Validation during Simulation Runtime}}}, year = {{2009}}, } @inbook{18291, author = {{Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, pages = {{111----126}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}}}, volume = {{252}}, year = {{2009}}, } @inproceedings{18346, abstract = {{For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The present work explores the trade-off between query time and preprocessing space for these quantities in 2D: exactly, in the approximate deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an O(m^2/n^2) space data structure for S that, given p and time O(log n), allows to approximate the ratio of occluded segments up to arbitrary constant absolute error; here m denotes the size of the Visibility Graph--which may be quadratic, but typically is just linear in the size n of the scene S. On the other hand, we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k) preprocessing time and space with similar approximation properties and query time O(k*polylog n), where k