@inproceedings{20960, abstract = {{Heutige Steuergeraete im Automobilbereich zeichnen sich durch eine hohe Funktionsvielfalt und eine hohe Vernetzung untereinander aus. Dies fuehrt zu immer komplexeren Systemen, wobei auch immer mehr sicherheitskritische Funktionen durch Software realisiert werden. Damit die Qualitaet der Software entsprechend hoch und zufriedenstellend ist, erfordert die Entwicklung ein systematisches und prozesskonformes Vorgehen. Der fuer die Softwarearchitektur entwickelte AUTOSAR Standard ist allerdings nicht fuer die fruehen Entwicklungsphasen wie die Anforderungsanalyse und das Systemarchitekturdesign gedacht, welche von Prozessbewertungsmodellen – wie Automotive SPICE – gefordert werden. Als Loesung fuer die Analyse bietet sich die Nutzung der Systems Modeling Language (SysML) mit Anpassungen bzw. Erweiterungen an die Beduerfnisse der Automobilindustrie, an. Damit aber keine Luecke im Entwicklungsprozess entsteht, wird bei der hier vorgestellten Methode ein wohldefinierter uebergang zur AUTOSAR Architektur, und zwar zur Applikations- und zur Basissoftware, definiert. }}, author = {{Meyer, Jan and Holtmann, Jörg}}, booktitle = {{Tagungsband des Dagstuhl-Workshop MBEES: Modellbasierte Entwicklung eingebetteter Systeme VII}}, pages = {{21--30}}, publisher = {{fortiss GmbH}}, title = {{{Eine durchgängige Entwicklungsmethode von der Systemarchitektur bis zur Softwarearchitektur mit AUTOSAR}}}, year = {{2011}}, } @inproceedings{20975, abstract = {{Software maintenance tasks require knowledge about the software’s design. Several tools help to identify implementations of software patterns, e.g. Design Patterns, in source code and thus help to reveal the underlying design. In case of the reverse engineering tool suite Reclipse, detection algorithms are generated from manually created, formal pattern specifications. Due to numerous variants that have to be considered, the pattern specification is error-prone. Because of this, the complex, step-wise generation process has to be traceable backwards to identify specification mistakes. To increase the traceability, we directly interpret the detection algorithm models (story diagrams) instead of executing code generated from these models. This way, a reverse engineer no longer has to relate generated code to the story diagrams to find mistakes in pattern specifications. }}, author = {{Fockel, Markus and Travkin, Dietrich and von Detten, Markus}}, booktitle = {{Proceedings of the 8th International Fujaba Days}}, title = {{{Interpreting Story Diagrams for the Static Detection of Software Patterns}}}, 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 object’s 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 = {{Suess, 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{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}}, } @inproceedings{17450, author = {{Suess, 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}}, } @phdthesis{17454, author = {{Suess, Tim}}, title = {{{Parallel Real-Time Rendering using Heterogeneous PC Clusters}}}, year = {{2011}}, } @inproceedings{1891, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}}, isbn = {{978-0-7695-4364-2}}, pages = {{507----516}}, publisher = {{IEEE Computer Society}}, title = {{{Competitive and Fair Medium Access Despite Reactive Jamming}}}, doi = {{10.1109/ICDCS.2011.8}}, year = {{2011}}, } @inproceedings{1892, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}}, isbn = {{978-1-4503-0868-7}}, pages = {{33----36}}, publisher = {{ACM}}, title = {{{Towards jamming-resistant and competitive medium access in the SINR model}}}, doi = {{10.1145/2030686.2030697}}, year = {{2011}}, } @inproceedings{1893, author = {{W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}}, isbn = {{978-1-4503-0722-2}}, pages = {{15}}, publisher = {{ACM}}, title = {{{Self-stabilizing leader election for single-hop wireless networks despite jamming}}}, doi = {{10.1145/2107502.2107522}}, year = {{2011}}, } @inproceedings{1895, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, booktitle = {{SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}}, isbn = {{978-1-4503-0743-7}}, pages = {{235----244}}, title = {{{Re-Chord: a self-stabilizing chord overlay network}}}, doi = {{10.1145/1989493.1989527}}, year = {{2011}}, } @phdthesis{18973, author = {{Frahling, Gereon}}, isbn = {{978-3-942647-09-0}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Algorithms for Dynamic Geometric Data Streams}}}, volume = {{290}}, year = {{2011}}, } @phdthesis{18974, author = {{Mehler, Jan}}, isbn = {{978-3-942647-06-9}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Power-Aware Online File Allocation in Dynamic Networks}}}, volume = {{287}}, 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}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Peer-to-Peer Based Parallel Web Computing}}}, volume = {{298}}, year = {{2011}}, } @inproceedings{1899, author = {{Kniesburges, Sebastian and Scheideler, Christian}}, booktitle = {{WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}}, isbn = {{978-3-642-19093-3}}, pages = {{170----181}}, publisher = {{Springer}}, title = {{{Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}}}, doi = {{10.1007/978-3-642-19094-0_18}}, volume = {{6552}}, year = {{2011}}, } @inbook{1900, author = {{Scheideler, Christian and Graffi, Kalman}}, booktitle = {{Computer Science, The Hardware, Software and Heart of It}}, isbn = {{978-1-4614-1167-3}}, pages = {{155----168}}, publisher = {{Springer}}, title = {{{Programming for Distributed Computing: From Physical to Logical Networks}}}, doi = {{10.1007/978-1-4614-1168-0_9}}, year = {{2011}}, } @inbook{1901, author = {{Scheideler, Christian}}, booktitle = {{Algorithms Unplugged}}, isbn = {{978-3-642-15327-3}}, pages = {{223----229}}, publisher = {{Springer}}, title = {{{Broadcasting - How Can I Quickly Disseminate Information?}}}, doi = {{10.1007/978-3-642-15328-0_22}}, year = {{2011}}, } @book{1902, author = {{Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}}, isbn = {{978-3-642-15327-3}}, title = {{{Algorithms Unplugged}}}, doi = {{10.1007/978-3-642-15328-0}}, 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}}, } @inproceedings{1924, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}}, pages = {{129----140}}, title = {{{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}}, doi = {{10.4230/LIPIcs.STACS.2011.129}}, year = {{2011}}, }