@misc{19531, author = {{Eke, Norbert Otto}}, booktitle = {{IASLonline}}, title = {{{„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003)}}}, year = {{2005}}, } @inbook{1961, author = {{Krimphove, Dieter}}, booktitle = {{REUPUS Recifer Eurofutures Publication Series}}, editor = {{Kukliński, Antoni and Pawłowski, Krzysztof }}, pages = {{337 – 349}}, publisher = {{Wyżsaza Szkoła Biznesu}}, title = {{{The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach}}}, volume = {{II, Europe – the Strategic Choices}}, year = {{2005}}, } @phdthesis{19611, author = {{Volbert, Klaus}}, isbn = {{3-935433-77-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Geometric Spanners for Topology Control in Wireless Networks}}}, volume = {{168}}, year = {{2005}}, } @inbook{1962, author = {{Krimphove, Dieter}}, booktitle = {{Rechtsfragen im Rating}}, editor = {{Achleitner, Ann-Kristin and Everling, Oliver}}, pages = {{65 – 88}}, publisher = {{Gabler-Verlag}}, title = {{{Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht}}}, year = {{2005}}, } @article{1963, author = {{Krimphove, Dieter}}, journal = {{Rechtstheorie}}, number = {{Jg. 36, Heft 2}}, pages = {{289 – 300}}, publisher = {{Dunker und Humblot}}, title = {{{Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen}}}, year = {{2005}}, } @inproceedings{19827, abstract = {{We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely. We use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled.}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05}}, isbn = {{1581139861}}, title = {{{Peer-to-peer networks based on random transformations of connected regular undirected graphs}}}, doi = {{10.1145/1073970.1073992}}, year = {{2005}}, } @inproceedings{19834, abstract = {{We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes.
The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.
For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.}}, author = {{Rührup, Stefan and Schindelhauer, Christian}}, booktitle = {{19th IEEE International Parallel and Distributed Processing Symposium}}, isbn = {{0769523129}}, pages = {{248}}, title = {{{Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}}}, doi = {{10.1109/ipdps.2005.147}}, year = {{2005}}, } @inproceedings{19835, abstract = {{The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.}}, author = {{Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}}, booktitle = {{Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}}, isbn = {{9783540291329}}, issn = {{0302-9743}}, pages = {{244--257}}, title = {{{Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}}}, doi = {{10.1007/11561354_21}}, volume = {{3738}}, year = {{2005}}, } @inbook{19836, author = {{Schindelhauer, Christian and Voß, Kerstin}}, booktitle = {{Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}}, isbn = {{9783540291329}}, issn = {{0302-9743}}, pages = {{271--284}}, title = {{{Probability Distributions for Channel Utilisation}}}, doi = {{10.1007/11561354_23}}, year = {{2005}}, } @inproceedings{19837, author = {{Schindelhauer, Christian and Weikum, Gerhard and Hales, David and Triantafillou, Peter}}, booktitle = {{European Conference on Complex Systems (ECCS 2005)}}, title = {{{Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}}}, year = {{2005}}, } @inproceedings{19871, abstract = {{Data has become the most valuable asset for many companies; loosing important data can cause companies to fail quite immediately. The protection of data inside storage systems is mostly achieved by using a RAID scheme that adds redundant data to user data, enabling recovery from single or multiple disk failures. This protection against data loss in case of a disk failure can be achieved either by dedicated hardware or a software RAID solution.

One major advantage of software RAID is that it comes for free as a built-in functionality in many operating systems like Linux or Microsoft Windows. The drawback of the built-in functionality is that it is not suited to run in multiple server environments; synchronization and recovery processes can be corrupted if more than a single server is allowed to access a software RAID volume.

In this paper, we present an enhancement for the Linux md-driver that enables a consistent usage of RAID in multiple server environments. Based on the V:DRIVE virtualization environment, RAID volumes can be consistently synchronized and recovered even in distributed environments. Besides the architectural concepts, we present measurements that indicate the viability of this enhanced, distributed version of md.}}, author = {{Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}}, booktitle = {{In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}}, pages = {{81 -- 88}}, title = {{{Distributed MD}}}, year = {{2005}}, } @inproceedings{19872, abstract = {{Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in ”closed loop” approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tool’s architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tool’s architecture.}}, author = {{Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}}, booktitle = {{In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}}, pages = {{1--8}}, title = {{{An integrated Architecture for Business Intelligence support from Application down to Storage}}}, year = {{2005}}, } @inproceedings{19888, author = {{Klein, Jan and Zachmann, Gabriel}}, booktitle = {{ACM SIGGRAPH 2005 Posters on - SIGGRAPH '05}}, title = {{{The expected running time of hierarchical collision detection}}}, doi = {{10.1145/1186954.1187087}}, year = {{2005}}, } @inproceedings{19890, author = {{Klein, Jan and Zachmann, Gabriel}}, booktitle = {{Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005)}}, pages = {{163--170}}, title = {{{Interpolation Search for Point Cloud Intersection}}}, doi = {{10.1145/1186223.1186329}}, year = {{2005}}, } @inbook{1990, abstract = {{Grid Computing promises an efficient sharing of world-wide distributed resources, ranging from hardware, software, expert knowledge to special I/O devices. However, although the main Grid mechanisms are already developed or are currently addressed by tremendous research effort, the Grid environment still suffers from a low acceptance in different user communities. Beside difficulties regarding an intuitive and comfortable resource access, various problems related to the reliability and the Quality-of-Service while using the Grid exist. Users should be able to rely, that their jobs will have certain priority at the remote Grid site and that they will be finished upon the agreed time regardless of any provider problems. Therefore, QoS issues have to be considered in the Grid middleware but also in the local resource management systems at the Grid sites. However, most of the currently used resource management systems are not suitable for SLAs, as they do not support resource reservation and do not offer mechanisms for job checkpointing/migration respectively. The latter are mandatory for Grid providers as rescue anchor in case of system failures or system overload. This paper focuses on SLA-aware job migration and presents a work, which is being performed in the EU supported project HPC4U.}}, author = {{Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel}}, booktitle = {{Grid Computing: New Frontiers of High Performance Computing}}, editor = {{Grandinetti, Lucio}}, pages = {{185--201}}, title = {{{SLA-aware Job Migration in Grid Environments}}}, doi = {{10.1016/S0927-5452(05)80011-5}}, volume = {{14}}, year = {{2005}}, } @inproceedings{19912, author = {{Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}}, booktitle = {{Proceedings of the 4th International Conference on Networking}}, isbn = {{9783540253389}}, issn = {{0302-9743}}, pages = {{800--810}}, title = {{{Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}}}, doi = {{10.1007/978-3-540-31957-3_90}}, volume = {{3421}}, year = {{2005}}, } @inproceedings{1992, abstract = {{The next generation grid applications demand grid middleware for a flexible negotiation mechanism supporting various ways of quality-of-service (QoS) guarantees. In this context, a QoS guarantee covers simultaneous allocations of various kinds of different resources, such as processor runtime, storage capacity, or network bandwidth, which are specified in the form of service level agreements (SLA). Currently, a gap exists between the capabilities of grid middleware and the underlying resource management systems concerning their support for QoS and SLA negotiation. In this paper we present an approach which closes this gap. Introducing the architecture of the virtual resource manager, we highlight its main QoS management features like run-time responsibility, co-allocation, and fault tolerance.}}, author = {{Burchard, Lars-Olof and Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Linnert, Barry}}, booktitle = {{Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS)}}, pages = {{132a--132a}}, title = {{{A Quality-of-Service Architecture for Future Grid Computing Applications.}}}, doi = {{10.1109/IPDPS.2005.62}}, year = {{2005}}, } @inproceedings{2411, abstract = {{ This paper motivates the use of hardware virtualization on coarse-grained reconfigurable architectures. We introduce Zippy, a coarse-grained multi-context hybrid CPU with architectural support for efficient hardware virtualization. The architectural details and the corresponding tool flow are outlined. As a case study, we compare the non-virtualized and the virtualized execution of an ADPCM decoder. }}, author = {{Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}}, keywords = {{Zippy}}, pages = {{213--218}}, publisher = {{IEEE Computer Society}}, title = {{{Zippy – A coarse-grained reconfigurable array with support for hardware virtualization}}}, doi = {{10.1109/ASAP.2005.69}}, year = {{2005}}, } @article{2412, abstract = {{ Reconfigurable architectures that tightly integrate a standard CPU core with a field-programmable hardware structure have recently been receiving impact of these design decisions on the overall system performance is a challenging task. In this paper, we first present a framework for the cycle-accurate performance evaluation of hybrid reconfigurable processors on the system level. Then, we discuss a reconfigurable processor for data-streaming applications, which attaches a coarse-grained reconfigurable unit to the coprocessor interface of a standard embedded CPU core. By means of a case study we evaluate the system-level impact of certain design features for the reconfigurable unit, such as multiple contexts, register replication, and hardware context scheduling. The results illustrate that a system-level evaluation framework is of paramount importance for studying the architectural trade-offs and optimizing design parameters for reconfigurable processors.}}, author = {{Enzler, Rolf and Plessl, Christian and Platzner, Marco}}, journal = {{Microprocessors and Microsystems}}, keywords = {{FPGA, reconfigurable computing, co-simulation, Zippy}}, number = {{2-3}}, pages = {{63--73}}, publisher = {{Elsevier}}, title = {{{System-level performance evaluation of reconfigurable processors}}}, doi = {{10.1016/j.micpro.2004.06.004}}, volume = {{29}}, year = {{2005}}, } @inproceedings{2413, author = {{Lietsch, Stefan and Kao, Odej}}, booktitle = {{Proc. Intelligence in Communication Systems (INTELLCOMM)}}, pages = {{261--271}}, publisher = {{Springer}}, title = {{{CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol}}}, doi = {{10.1007/0-387-32015-6_24}}, volume = {{190}}, year = {{2005}}, }