@inproceedings{20151,
author = {Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Schwarzer, Christopher and Michiels, Nico K. and Esparcia-Alcazar, Anna Isabel},
booktitle = {Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)},
pages = {579--588},
title = {{Virtual Spatiality in Agent Controllers: Encoding Compartmentalization}},
doi = {10.1007/978-3-642-37192-9_58},
volume = {7835},
year = {2013},
}
@inproceedings{580,
abstract = {We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.},
author = {Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik},
booktitle = {Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)},
editor = {Even, Guy and Rawitz, Dror},
pages = {218--231},
title = {{Slow Down & Sleep for Profit in Online Deadline Scheduling}},
doi = {10.1007/978-3-642-34862-4_17},
year = {2012},
}
@inproceedings{636,
abstract = {We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.},
author = {Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter},
booktitle = {Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)},
pages = {61--72},
title = {{An Algorithm for Facility Leasing}},
doi = {10.1007/978-3-642-31104-8_6},
year = {2012},
}
@article{579,
abstract = {A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.},
author = {Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till},
journal = {Transactions on Algorithms},
number = {3},
pages = {30},
publisher = {ACM},
title = {{Smoothed analysis of left-to-right maxima with applications}},
doi = {10.1145/2229163.2229174},
year = {2012},
}
@inbook{16448,
author = {Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {Algorithms for Sensor Systems},
isbn = {9783642282089},
issn = {0302-9743},
title = {{Local, Self-organizing Strategies for Robotic Formation Problems}},
doi = {10.1007/978-3-642-28209-6_2},
year = {2012},
}
@phdthesis{601,
abstract = {Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren hergeleitet.},
author = {Kempkes, Barbara},
publisher = {Universität Paderborn},
title = {{Local strategies for robot formation problems}},
year = {2012},
}
@inproceedings{619,
abstract = {Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.},
author = {Brandes, Philipp and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)},
pages = {9--14},
title = {{Distributed Computing in Fault-Prone Dynamic Networks}},
doi = {10.1145/2414815.2414818},
year = {2012},
}
@misc{638,
author = {Eidens, Fabian},
publisher = {Universität Paderborn},
title = {{Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}},
year = {2012},
}
@inbook{16445,
author = {Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {Experimental Algorithms},
isbn = {9783642308499},
issn = {0302-9743},
title = {{Continuous Local Strategies for Robotic Formation Problems}},
doi = {10.1007/978-3-642-30850-5_2},
year = {2012},
}
@inproceedings{16446,
author = {Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA '12},
isbn = {9781450312134},
title = {{Optimal and competitive runtime bounds for continuous, local gathering of mobile robots}},
doi = {10.1145/2312005.2312009},
year = {2012},
}
@inproceedings{628,
abstract = {Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.},
author = {Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander},
booktitle = {Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)},
pages = {72----83},
title = {{Basic Network Creation Games with Communication Interests}},
doi = {10.1007/978-3-642-33996-7_7},
year = {2012},
}
@inproceedings{16408,
abstract = {We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time.
},
author = {Süß, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
booktitle = {Advances in Visual Computing},
isbn = {9783642331787},
issn = {0302-9743},
pages = {502--512},
title = {{Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}},
doi = {10.1007/978-3-642-33179-4_48},
volume = {7431},
year = {2012},
}
@inproceedings{16428,
author = {Rajaraman, Rajmohan and Meyer auf der Heide, Friedhelm},
isbn = {9781450307437},
title = {{Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11}},
doi = {10.1145/1989493},
year = {2011},
}
@inproceedings{16454,
author = {Kling, Peter and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11},
isbn = {9781450307437},
title = {{Convergence of local communication chain strategies via linear transformations}},
doi = {10.1145/1989493.1989517},
year = {2011},
}
@inbook{16459,
author = {Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {Structural Information and Communication Complexity},
isbn = {9783642222115},
issn = {0302-9743},
title = {{Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}},
doi = {10.1007/978-3-642-22212-2_13},
year = {2011},
}
@proceedings{667,
editor = {Meyer auf der Heide, Friedhelm and Rajaraman, Rajmohan },
title = {{23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}},
doi = {10.1145/1989493},
year = {2011},
}
@inproceedings{17421,
author = {Klaas, Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias},
booktitle = {Proceedings of the 2011 Winter Simulation Conference (WSC)},
isbn = {9781457721090},
title = {{Simulation aided, knowledge based routing for AGVs in a distribution warehouse}},
doi = {10.1109/wsc.2011.6147883},
year = {2011},
}
@article{16447,
author = {Degener, Bastian and Fekete, Sándor P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
issn = {1574-0137},
journal = {Computer Science Review},
pages = {57--68},
title = {{A survey on relay placement with runtime and approximation guarantees}},
doi = {10.1016/j.cosrev.2010.09.005},
year = {2011},
}
@inbook{16409,
abstract = {Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.
},
author = {Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel},
booktitle = {Automata, Languages and Programming},
isbn = {9783642220111},
issn = {0302-9743},
title = {{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}},
doi = {10.1007/978-3-642-22012-8_52},
year = {2011},
}
@inproceedings{18568,
author = {Vöcking, Berthold and Hoefer, Martin and Skopalik, Alexander and Penn, Michal and Polukarov, Maria},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,},
pages = {234----239},
title = {{Considerate Equilibrium}},
year = {2011},
}
@inproceedings{19845,
abstract = {In dieser Arbeit stellen wir ein flexibles System zur Entwicklung und Evaluation von 3-D-Renderingalgorithmen vor, das die Visualisierung komplexer virtueller Szenen auf einem breiten Spektrum an Geräten erlaubt. Die Aufbereitung und Echtzeitdarstellung solcher virtueller Szenen, wie sie beispielsweise aus detaillierten CAD-Daten erzeugt werden, stellt in vielerlei Hinsicht eine algorithmische und technische Herausforderung dar. Die 3-D-Szenendaten können nach dem Dateiimport aus einem Austauschformat in eine Vielzahl unterschiedlicher Datenstrukturen überführt werden. Es muss ein geeignetes Renderingverfahren ausgewählt und eingestellt werden, welches sowohl die Eigenschaften der Szene (Zahl der Polygone, Grad der Verdeckung etc.) als auch die Fähigkeiten der Hardware berücksichtigt. Auf der einen Seite stellt die Darstellung auf mobilen Endgeräten wie Smartphones besonders hohe Anforderungen aufgrund der Speicherbeschränkung und der geringen Leistungsfähigkeit der Grafikhardware. Auf der anderen Seite stehen bei Großprojektionssystemen, wie beispielsweise dem HD-Visualisierungscenter des Heinz Nixdorf Instituts, die hohe Bildqualität bei stereoskopischer Darstellung und die Unterstützung von Trackingsystemen im Vordergrund.
Der Fokus des von uns entwickelten Systems PADrend liegt in der Bereitstellung einer flexiblen und leicht erweiterbaren Grundlage für die Entwicklung und Evaluation von 3-D-Renderingalgorithmen und räumlichen Datenstrukturen im Bereich der Forschung und der universitären Ausbildung. Durch den modularen Aufbau und die große Bandbreite an unterstützten Systemen wird gewährleistet, dass eine Vielzahl unterschiedlicher Entwicklungen und Anwendungen auf PADrend aufsetzen können. In diesem Artikel geben wir einen Überblick über den Aufbau und die Fähigkeiten des Systems. Des Weiteren geben wir ein Beispiel für ein Anwendungsszenario, in dem PADrend eingesetzt wird: die Visualisierung von architektonischen Modellen auf einem Multiprojektionssystem.},
author = {Jähn, Claudius and Petring, Ralf and Eikel, Benjamin},
booktitle = {Augmented & Virtual Reality in der Produktentstehung},
pages = {159----170},
publisher = {Heinz Nixdorf Institut, Universität Paderborn},
title = {{PADrend: Platform for Algorithm Development and Rendering}},
volume = {295},
year = {2011},
}
@article{16455,
author = {Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
issn = {1877-0509},
journal = {Procedia Computer Science},
pages = {153--155},
title = {{Building Simple Formations in Large Societies of Tiny Mobile Robots}},
doi = {10.1016/j.procs.2011.09.049},
year = {2011},
}
@misc{663,
author = {Swierkot, Kamil},
publisher = {Universität Paderborn},
title = {{Complexity Classes for Local Computation}},
year = {2011},
}
@article{17009,
author = {Hsu, D. Frank and Magga, Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and Meyer auf der Heide, Friedhelm},
issn = {0219-2659},
journal = {Journal of Interconnection Networks},
pages = {vii--viii},
title = {{EDITORIAL}},
doi = {10.1142/s0219265911002885},
year = {2011},
}
@inbook{16412,
author = {Gehweiler, Joachim and Meyer auf der Heide, Friedhelm},
booktitle = {Algorithms Unplugged},
isbn = {9783642153273},
pages = {367--374},
title = {{Bin Packing - How Do I Get My Stuff into the Boxes}},
doi = {10.1007/978-3-642-15328-0_38},
year = {2011},
}
@inbook{16456,
author = {Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {Organic Computing — A Paradigm Shift for Complex Systems},
isbn = {9783034801294},
title = {{Energy-Awareness in Self-organising Robotic Exploration Teams}},
doi = {10.1007/978-3-0348-0130-0_35},
year = {2011},
}
@inproceedings{657,
abstract = {We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \my the relative measurement error.},
author = {Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter},
booktitle = {Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)},
pages = {13--27},
title = {{Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}},
doi = {10.1007/978-3-642-28209-6_3},
year = {2011},
}
@inproceedings{664,
abstract = {Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying "parallel computer": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors.},
author = {Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)},
pages = {31----40},
title = {{An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}},
doi = {10.1007/978-3-642-31500-8_4},
year = {2011},
}
@phdthesis{18976,
abstract = {Web computing is a variant of parallel computing where the idle times of PCs
donated by worldwide distributed users are employed to execute parallel
programs. In this thesis we consider a web computing variant with two
important properties: First, we support the execution of coupled, massively
parallel algorithms (rather than distributed data processing). And second,
we organize the system in peer-to-peer fashion.
We present the Paderborn University BSP-based Web Computing (PUB-Web) library,
which supports the execution of parallel programs in the bulk-synchronous style
(BSP) in such a web computing setting. In this thesis, we focus on important
technical and algorithmic aspects, in particular: In order to schedule
processes with respect to the currently available computing power, which
continually changes in an unpredictable fashion, we need intelligent load
balancing algorithms and -- as a basic precondition -- the technical ability
to migrate threads at runtime.
To achieve the latter in a way suitable for production use, compatible with
recent Java versions, available for all important platforms, and easy-to-use
for developers, we develop the PadMig thread migration and checkpointing
library.
In order to tackle the distributed load balancing problem, we present an
algorithm based on Distributed Heterogeneous Hash-Tables. In order to judge
the quality of the schedules produced, we perform extensive experiments to
compare several variants of the DHHT-based load balancer with the well-
established Work Stealing algorithm, using realistic input data obtained by
profiling the utilization of several hundred PCs for a period of several
months.
Beside the available computing power, we finally also consider the network
bandwidth as a secondary criterion for load balancing. For this purpose, we
cluster the PUB-Web network according to bandwidth, employing a novel,
fault-tolerant, adaptive, and scaling distributed clustering algorithm called
DiDiC. In order to judge the quality of the clusterings produces by DiDiC,
we experimentally compare it to the well-established MCL algorithm using a
simulator.},
author = {Gehweiler, Joachim},
isbn = {978-3-942647-17-5},
title = {{Peer-to-Peer Based Parallel Web Computing}},
year = {2011},
}
@inproceedings{16451,
author = {Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity},
pages = {138--149},
title = {{Energy-efficient strategies for building short chains of mobile robots locally}},
doi = {10.1016/j.tcs.2012.10.056},
year = {2011},
}
@phdthesis{17454,
author = {Süß, Tim},
title = {{Parallel Real-Time Rendering using Heterogeneous PC Clusters}},
year = {2011},
}
@inproceedings{18193,
author = {Renken, Hendrik and Laroque, Christoph and Fischer, Matthias},
booktitle = {Proceedings of The 25th European Simulation and Modelling Conference - ESM2011},
title = {{An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}},
year = {2011},
}
@inproceedings{19026,
author = {Briest, Patrick and Raupach, Christoph},
booktitle = {Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11},
isbn = {9781450307437},
title = {{The car sharing problem}},
doi = {10.1145/1989493.1989518},
year = {2011},
}
@phdthesis{19040,
author = {Effert, Sascha},
title = {{Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}},
year = {2011},
}
@article{19677,
author = {Briest, Patrick and Krysta, Piotr and Hoefer, Martin},
journal = {Algorithmica},
pages = {733–753},
title = {{Stackelberg Network Pricing Games}},
doi = {10.1007/s00453-010-9480-3},
volume = {62},
year = {2011},
}
@inproceedings{17450,
author = {Süß, Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm and Koch, Clemens},
booktitle = {Augmented & Virtual Reality in der Produktentstehung},
pages = {185----197},
publisher = {Verlagsschriftenreihe des Heinz Nixdorf Instituts},
title = {{Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze}},
volume = {295},
year = {2011},
}
@inproceedings{16453,
author = {Degener, Bastian and Kempkes, Barbara and Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer, Roger},
booktitle = {Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11},
isbn = {9781450307437},
title = {{A tight runtime bound for synchronous gathering of autonomous robots with limited visibility}},
doi = {10.1145/1989493.1989515},
year = {2011},
}
@inproceedings{17420,
abstract = {Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an objects shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects.
},
author = {Süß, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias},
booktitle = {Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada},
editor = {Brooks, Stephen and Irani, Pourang},
pages = {79----86},
publisher = {Canadian Human-Computer Communications Society},
title = {{Approximative occlusion culling using the hull tree}},
year = {2011},
}
@inproceedings{16410,
abstract = {Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.},
author = {Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel},
booktitle = {37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)},
isbn = {9783642183805},
issn = {0302-9743},
number = {6543},
pages = {178--189},
publisher = {Springer},
title = {{Collisionless Gathering of Robots with an Extent}},
doi = {10.1007/978-3-642-18381-2_15},
year = {2011},
}
@unpublished{18194,
abstract = {We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time.},
author = {Süß, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
title = {{Parallel Out-of-Core Occlusion Culling}},
year = {2011},
}
@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},
}
@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},
}
@techreport{17464,
author = {Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios},
title = {{Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}},
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},
}
@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},
}
@article{19011,
author = {Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane},
issn = {0178-4617},
journal = {Algorithmica},
number = {3},
pages = {562--584},
title = {{Kinetic Facility Location}},
doi = {10.1007/s00453-008-9250-7},
volume = {57},
year = {2010},
}
@phdthesis{18974,
author = {Mehler, Jan},
isbn = {978-3-942647-06-9},
title = {{Power-Aware Online File Allocation in Dynamic Networks}},
year = {2010},
}
@phdthesis{19042,
author = {Degener, Bastian},
isbn = {978-3-939350-97-2 },
title = {{Local, distributed approximation algorithms for geometric assignment problems}},
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 = {Süß, 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},
}
@inproceedings{17422,
abstract = {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 scenes 3D-data used for the simulation models visualization. We demonstrate the technique with a multi-floor building example.},
author = {Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm},
booktitle = {Proceedings of the 2010 Winter Simulation Conference},
isbn = {9781424498666},
title = {{Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}},
doi = {10.1109/wsc.2010.5678906},
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{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},
}
@unpublished{17586,
abstract = {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.},
author = {Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
title = {{Building short chains of mobile robots locally with a bounded stepwidth}},
year = {2010},
}
@inproceedings{19013,
author = {Gehweiler, Joachim and Meyerhenke, Henning},
booktitle = {Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)},
isbn = {9781424465330},
title = {{A distributed diffusive heuristic for clustering a virtual P2P supercomputer}},
doi = {10.1109/ipdpsw.2010.5470922},
year = {2010},
}
@techreport{19018,
author = {Thies, Michael and Gehweiler, Joachim},
title = {{Thread Migration and Checkpointing in Java}},
year = {2010},
}
@inproceedings{19796,
abstract = {We introduce the Read-Write-Coding-System (RWC) a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.},
author = {Mense, Mario and Schindelhauer, Christian},
booktitle = {Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems},
isbn = {9783642051173},
issn = {0302-9743},
pages = {624----639},
title = {{Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}},
doi = {10.1007/978-3-642-05118-0_43},
volume = {5873},
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},
}
@techreport{17462,
author = {Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter},
publisher = {Heinz Nixdorf Institut},
title = {{A Large-Scale Distributed Environment for Peer-to-Peer Services}},
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},
}
@inproceedings{19711,
author = {Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara},
booktitle = {International Parallel & Distributed Processing Symposium (IPDPS)},
title = {{A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }},
doi = {10.1109/IPDPS.2010.5470349},
year = {2010},
}
@inproceedings{19824,
abstract = {We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis.},
author = {Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian},
booktitle = {Proceedings of the 16th International Conference on Parallel and Distributed Systems},
isbn = {9781424497270},
title = {{A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}},
doi = {10.1109/icpads.2010.42},
year = {2010},
}
@inproceedings{19829,
author = {Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian},
booktitle = {Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10},
isbn = {9781605586397},
pages = {1299--1304},
title = {{Coverage-hole trap model in target tracking using distributed relay-robot network}},
doi = {10.1145/1774088.1774365},
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 Süß, 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},
}
@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},
}
@phdthesis{19041,
author = {Mahlmann, Peter},
isbn = {978-3-942647-02-1},
title = {{Peer-to-peer networks based on random graphs}},
year = {2010},
}
@inproceedings{19678,
author = {Briest, Patrick and Röglin, Heiko},
booktitle = {Workshop on Approximation and Online Algorithms (WAOA)},
publisher = {Springer},
title = {{The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}},
doi = {10.1007/978-3-642-18318-8_5},
volume = {6534},
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 = {Süß, 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{19933,
author = {Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael},
booktitle = {8th IEEE International Conference on Industrial Informatics (INDIN'2010)},
isbn = {9781424472987},
title = {{Distributed and dynamic resource management for self-optimizing mechatronic systems}},
doi = {10.1109/indin.2010.5549647},
year = {2010},
}
@inproceedings{16430,
author = {Mehler, Jan and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09},
isbn = {9781605586069},
title = {{Power-aware online file allocation in mobile ad hoc networks}},
doi = {10.1145/1583991.1584072},
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 = {Süß, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm},
booktitle = {Augmented & Virtual Reality in der Produktentstehung},
pages = {111----126},
publisher = {Heinz Nixdorf Institut, Universität Paderborn},
title = {{Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}},
volume = {252},
year = {2009},
}
@phdthesis{19617,
author = {Kortenjan, Michael},
isbn = {978-3-939350-77-4},
title = {{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}},
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},
}
@proceedings{16431,
editor = {Meyer auf der Heide, Friedhelm and Bender, Michael A.},
isbn = {9781605586069},
title = {{Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09}},
doi = {10.1145/1583991},
year = {2009},
}
@article{16429,
author = {Kutyłowski, Jarosław and Meyer auf der Heide, Friedhelm},
issn = {0304-3975},
journal = {Theoretical Computer Science},
pages = {3391--3405},
title = {{Optimal strategies for maintaining a chain of relays between an explorer and a base camp}},
doi = {10.1016/j.tcs.2008.04.010},
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},
}
@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},
}
@article{16398,
author = {Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm},
issn = {1570-8667},
journal = {Journal of Discrete Algorithms},
pages = {545--569},
title = {{Optimal algorithms for page migration in dynamic networks}},
doi = {10.1016/j.jda.2008.07.006},
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},
}
@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},
}
@phdthesis{19614,
author = {Mense, Mario},
isbn = {978-3-939350-79-8},
title = {{On Fault-Tolerant Data Placement in Storage Networks}},
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{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