@inproceedings{19790, abstract = {{The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.}}, author = {{Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}}, booktitle = {{Proceedings of SSGRR 2003}}, title = {{{Storage Management as Means to cope with Exponential Information Growth}}}, year = {{2003}}, } @inproceedings{19806, abstract = {{We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost. We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision. Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.}}, author = {{Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus and Grünewald, M.}}, booktitle = {{Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}}, isbn = {{0769519261}}, title = {{{Performance of distributed algorithms for topology control in wireless networks}}}, doi = {{10.1109/ipdps.2003.1213107}}, year = {{2003}}, } @misc{19828, author = {{Mahlmann, Peter}}, title = {{{Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web}}}, year = {{2003}}, } @inproceedings{19833, abstract = {{Communication facilities are important in Robotics if several robots have to work together. In this paper, we describe problems and solutions encountered while designing an infrared-based communication device for the mini robot Khepera. In contrast to traditional omnidirectional systems, it features directed, power-variable transmission in eight directions at unit[23.4]kbps up to a range of unit[1m]. It can differentiate incoming data signals from interference from adjacent sectors and can estimate their direction-of-arrival. We model the transmission over the infrared channel and show how interference influences the reception of the data signals. We also describe methods how to reduce these effects. We have tested the performance of the resulted signal processing in a worst case scenario by simulations and in experiments with a prototype implementation. The resulted module is especially suited for experimental evaluation of ad hoc network protocols and for position estimation.}}, author = {{Volbert, Klaus and Grünewald, Matthias and Schindelhauer, Christian and Rückert, Ulrich}}, booktitle = {{Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment}}, pages = {{113--122}}, title = {{{Directed power-variable infrared communication for the mini robot Khepera}}}, year = {{2003}}, } @inproceedings{19874, abstract = {{We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality for speed. Our algorithm yields an estimation of the quality, so that applications can specify the desired quality. In a timecritical system, applications can specify the maximum time budget instead, and quantitatively assess the quality of the results returned by the collision detection afterwards.}}, author = {{Klein, Jan and Zachmann, Gabriel}}, booktitle = {{Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)}}, pages = {{37--45}}, title = {{{ADB-Trees: Controlling the Error of Time-Critical Collision Detection}}}, year = {{2003}}, } @inproceedings{19900, author = {{Klein, Jan and Zachmann, Gabriel}}, booktitle = {{ Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)}}, pages = {{22--31}}, title = {{{Time-Critical Collision Detection Using an Average-Case Approach}}}, doi = {{10.1145/1008653.1008660}}, year = {{2003}}, } @inproceedings{19952, abstract = {{Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.}}, author = {{Fomin, Fedor V. and Thilikos, Dimitrios M.}}, booktitle = {{Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}}, issn = {{0097-5397}}, title = {{{Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up}}}, doi = {{10.1137/s0097539702419649}}, year = {{2003}}, } @inproceedings{2418, abstract = {{ This paper presents TKDM, a PC-based high-performance reconfigurable computing environment. The TKDM hardware consists of an FPGA module that uses the DIMM (dual inline memory module) bus for high-bandwidth and low-latency communication with the host CPU. The system's firmware is integrated with the Linux host operating system and offers functions for data communication and FPGA reconfiguration. The intended use of TKDM is that of a dynamically reconfigurable co-processor for data streaming applications. The system's firmware can be customized for specific application domains to facilitate simple and easy-to-use programming interfaces. }}, author = {{Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Field Programmable Technology (ICFPT)}}, keywords = {{coprocessor, DIMM, memory bus, FPGA, high performance computing}}, pages = {{252--259}}, publisher = {{IEEE Computer Society}}, title = {{{TKDM – A Reconfigurable Co-processor in a PC's Memory Slot}}}, doi = {{10.1109/FPT.2003.1275755}}, year = {{2003}}, } @article{2419, abstract = {{Wearable computers are embedded into the mobile environment of their users. A design challenge for wearable systems is to combine the high performance required for tasks such as video decoding with the low energy consumption required to maximise battery runtimes and the flexibility demanded by the dynamics of the environment and the applications. In this paper, we demonstrate that reconfigurable hardware technology is able to answer this challenge. We present the concept and the prototype implementation of an autonomous wearable unit with reconfigurable modules (WURM). We discuss experiments that show the uses of reconfigurable hardware in WURM: ASICs-on-demand and adaptive interfaces. Finally, we present an experiment with an operating system layer for WURM.}}, author = {{Plessl, Christian and Enzler, Rolf and Walder, Herbert and Beutel, Jan and Platzner, Marco and Thiele, Lothar and Tröster, Gerhard}}, journal = {{Personal and Ubiquitous Computing}}, number = {{5}}, pages = {{299--308}}, publisher = {{Springer}}, title = {{{The Case for Reconfigurable Hardware in Wearable Computing}}}, doi = {{10.1007/s00779-003-0243-x}}, volume = {{7}}, year = {{2003}}, } @article{2420, abstract = {{ This paper presents the acceleration of minimum-cost covering problems by instance-specific hardware. First, we formulate the minimum-cost covering problem and discuss a branch \& bound algorithm to solve it. Then we describe instance-specific hardware architectures that implement branch \& bound in 3-valued logic and use reduction techniques similar to those found in software solvers. We further present prototypical accelerator implementations and a corresponding design tool flow. Our experiments reveal significant raw speedups up to five orders of magnitude for a set of smaller unate covering problems. Provided that hardware compilation times can be reduced, we conclude that instance-specific acceleration of hard minimum-cost covering problems will lead to substantial overall speedups. }}, author = {{Plessl, Christian and Platzner, Marco}}, issn = {{0920-8542}}, journal = {{Journal of Supercomputing}}, keywords = {{reconfigurable computing, instance-specific acceleration, minimum covering}}, number = {{2}}, pages = {{109--129}}, publisher = {{Kluwer Academic Publishers}}, title = {{{Instance-Specific Accelerators for Minimum Covering}}}, doi = {{10.1023/a:1024443416592}}, volume = {{26}}, year = {{2003}}, } @inproceedings{2421, abstract = {{In contrast to processors, current reconfigurable devices totally lack programming models that would allow for device independent compilation and forward compatibility. The key to overcome this limitation is hardware virtualization. In this paper, we resort to a macro-pipelined execution model to achieve hardware virtualization for data streaming applications. As a hardware implementation we present a hybrid multi-context architecture that attaches a coarse-grained reconfigurable array to a host CPU. A co-simulation framework enables cycle-accurate simulation of the complete architecture. As a case study we map an FIR filter to our virtualized hardware model and evaluate different designs. We discuss the impact of the number of contexts and the feature of context state on the speedup and the CPU load.}}, author = {{Enzler, Rolf and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}}, keywords = {{Zippy, multi-context, FPGA}}, pages = {{151--160}}, publisher = {{Springer}}, title = {{{Virtualizing Hardware with Multi-Context Reconfigurable Arrays}}}, doi = {{10.1007/b12007}}, volume = {{2778}}, year = {{2003}}, } @inproceedings{2422, abstract = {{Reconfigurable computing architectures aim to dynamically adapt their hardware to the application at hand. As research shows, the time it takes to reconfigure the hardware forms an overhead that can significantly impair the benefits of hardware customization. Multi-context devices are one promising approach to overcome the limitations posed by long reconfiguration times. In contrast to more traditional reconfigurable architectures, multi-context devices hold several configurations on-chip. On demand, the device can quickly switch to another context. In this paper we present a co-simulation environment to investigate design trade-offs for hybrid multi-context architectures. Our architectural model comprises a reconfigurable unit closely coupled to a CPU core. As a case study, we discuss the implementation of a FIR filter partitioned into several contexts. We outline the mapping process and present simulation results for single- and multi-context reconfigurable units coupled with both embedded and high-end CPUs.}}, author = {{Enzler, Rolf and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}, isbn = {{1-932415-05-X}}, keywords = {{Zippy, co-simulation}}, pages = {{174--180}}, publisher = {{CSREA Press}}, title = {{{Co-simulation of a Hybrid Multi-Context Architecture}}}, year = {{2003}}, } @inproceedings{24273, author = {{Terbahl, Martina and Krokowski, Jens}}, booktitle = {{Proceedings of 5. GI-Informatiktage 2003}}, title = {{{Verteiltes Rendern durch dynamische Bildaufteilung}}}, year = {{2003}}, } @inproceedings{26263, author = {{Ziegler, Martin}}, booktitle = {{Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA}}, pages = {{47--64}}, title = {{{Stability versus Speed in a Computable Algebraic Model}}}, year = {{2003}}, } @inproceedings{26277, author = {{Ziegler, Martin}}, booktitle = {{Computability and Complexity in Analysis}}, pages = {{389--406}}, title = {{{Computable Operators on Regular Sets}}}, volume = {{302-8/2003}}, year = {{2003}}, } @article{3236, author = {{Wehrheim, Heike}}, journal = {{Formal Methods in System Design}}, number = {{2}}, pages = {{143----170}}, title = {{{Behavioral Subtyping Relations for Active Objects}}}, doi = {{10.1023/A:1024764232069}}, year = {{2003}}, } @inproceedings{3237, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures}}, editor = {{S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne and P. de Roever, Willem}}, pages = {{330----343}}, title = {{{Preserving Properties Under Change}}}, doi = {{10.1007/978-3-540-30101-1_16}}, year = {{2003}}, } @inproceedings{3238, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings}}, editor = {{Najm, Elie and Nestmann, Uwe and Stevens, Perdita}}, pages = {{79----93}}, title = {{{Inheritance of Temporal Logic Properties}}}, doi = {{10.1007/978-3-540-39958-2_6}}, year = {{2003}}, } @inproceedings{3239, author = {{Rasch, Holger and Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings}}, editor = {{Najm, Elie and Nestmann, Uwe and Stevens, Perdita}}, pages = {{229----243}}, title = {{{Checking Consistency in {UML} Diagramms: Classes and State Machines}}}, doi = {{10.1007/978-3-540-39958-2_16}}, year = {{2003}}, } @inproceedings{3240, author = {{Derrick, John and Wehrheim, Heike}}, booktitle = {{{ZB} 2003: Formal Specification and Development in {Z} and B, Third International Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings}}, editor = {{Bert, Didier and P. Bowen, Jonathan and King, Steve and A. Wald{\'{e}}n, Marina}}, pages = {{127----147}}, title = {{{Using Coupled Simulations in Non-atomic Refinement}}}, doi = {{10.1007/3-540-44880-2_10}}, year = {{2003}}, }