TY - CONF AB - Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene’s 3D-data used for the simulation model’s visualization. We demonstrate the technique with a multi-floor building example. AU - Fischer, Matthias AU - Renken, Hendrik AU - Laroque, Christoph AU - Schaumann, Guido AU - Dangelmaier, Wilhelm ID - 17422 SN - 9781424498666 T2 - Proceedings of the 2010 Winter Simulation Conference TI - Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations ER - TY - GEN AU - Gehweiler, Joachim AU - Meyer auf der Heide, Friedhelm AU - Schroeder, Ulf-Peter ID - 17462 TI - A Large-Scale Distributed Environment for Peer-to-Peer Services ER - TY - GEN AU - Blesa, Maria J. AU - Blum, Christian AU - de Caro, Angelo AU - Degener, Bastian AU - Kempkes, Barbara AU - Leone, Piere AU - Persiano, Giuseppe AU - Meyer auf der Heide, Friedhelm AU - Mylonas, Georgios ID - 17464 TI - Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study ER - TY - GEN AB - We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance. AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 17586 TI - Building short chains of mobile robots locally with a bounded stepwidth ER - TY - CONF AU - Bar-Yehuda, Reuven AU - Polevoy, Gleb AU - Rawitz, Dror ID - 17665 T2 - DIALM-PODC TI - Bandwidth allocation in cellular networks with multiple interferences ER - TY - CHAP AU - Hamann, Heiko AU - Schmickl, Thomas AU - Stradner, Jürgen AU - Crailsheim, Karl AU - Levi, Paul AU - Kernbach, Serge ID - 18761 T2 - Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution TI - Hormone-based Control for Multi-modular Robotics ER - TY - THES AU - Bienkowski, Marcin ID - 18910 SN - 978-3-942647-01-4 TI - Page migration in dynamic networks VL - 282 ER - TY - THES AU - Dynia, Miroslaw ID - 18927 SN - 978-3-942647-03-8 TI - Collective graph exploration VL - 284 ER - TY - JOUR AU - Degener, Bastian AU - Gehweiler, Joachim AU - Lammersen, Christiane ID - 19011 IS - 3 JF - Algorithmica SN - 0178-4617 TI - Kinetic Facility Location VL - 57 ER - TY - CONF AU - Gehweiler, Joachim AU - Meyerhenke, Henning ID - 19013 SN - 9781424465330 T2 - Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC) TI - A distributed diffusive heuristic for clustering a virtual P2P supercomputer ER - TY - CONF AB - 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. AU - Gehweiler, Joachim AU - Meyerhenke, Henning ID - 19016 T2 - Dagstuhl Seminar Proceedings 10261: Algorithm Engineering TI - On Dynamic Graph Partitioning and Graph Clustering using Diffusion ER - TY - GEN AU - Thies, Michael AU - Gehweiler, Joachim ID - 19018 TI - Thread Migration and Checkpointing in Java ER - TY - CONF AU - Kernbach, Serge AU - Schmickl, Thomas AU - Hamann, Heiko AU - Stradner, Jürgen AU - Schlachter, Florian AU - Schwarzer, Christopher s. F. AU - Winfield, Alan F. T. AU - Matthias, Rene ID - 19023 T2 - Artificial Life XII (ALife XII) TI - Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics ER - TY - CONF AU - Briest, Patrick AU - Chalermsook, Parinya AU - Khanna, Sanjeev AU - Laekhanukit, Bundit AU - Nanongkai, Danupon ID - 19029 SN - 0302-9743 T2 - Workshop on Internet and Network Economics (WINE) TI - Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 1903 IS - 5 JF - Informatik Spektrum TI - Algorithmische Grundlagen verteilter Speichersysteme ER - TY - CONF AU - Briest, Patrick AU - Chawla, Shuchi AU - Kleinberg, Robert AU - Weinberg, S. Matthew ID - 19033 SN - 9780898717013 T2 - Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms TI - Pricing Randomized Allocations ER - TY - THES AU - Mahlmann, Peter ID - 19041 SN - 978-3-942647-02-1 TI - Peer-to-peer networks based on random graphs VL - 283 ER - TY - THES AU - Degener, Bastian ID - 19042 SN - 978-3-939350-97-2 TI - Local, distributed approximation algorithms for geometric assignment problems VL - 278 ER - TY - CONF AB - 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. AU - Fischer, Matthias AU - Jähn, Claudius AU - Suess, Tim ID - 18136 T2 - Eurographics Symposium on Parallel Graphics and Visualization (EGPGV) TI - Asynchronous Parallel Reliefboard Computation for Scene Object Approximation ER - TY - CONF AB - 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. AU - Suess, Tim AU - Wiesemann, Timo AU - Fischer, Matthias ID - 18289 SN - 9781424481330 T2 - 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage TI - Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments ER -