@inproceedings{19727, author = {{Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}}, booktitle = {{Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}}, pages = {{2202--2208}}, title = {{{Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}}}, year = {{2002}}, } @inproceedings{19850, author = {{Wanka, Rolf}}, booktitle = {{Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}}, isbn = {{9783540003311}}, issn = {{0302-9743}}, pages = {{413--420}}, title = {{{Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}}}, doi = {{10.1007/3-540-36379-3_36}}, year = {{2002}}, } @inproceedings{19873, abstract = {{We present a new and easy to use framework for navigating through scenes of arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints and viewing directions are rendered and stored on an external volume. During navigation each image can be displayed within a very short time by loading it from the volume. For acceleration, our prefetching strategy loads possibly needed images for the next few frames if the viewer takes a break. The measurements show that we achieve interactive frame rates, whereby the difference between the minimal and maximal display time is very small. Our system works well with scenes modelled by polygons, but also digital photos can easily be used for describing a 3D scene.}}, author = {{Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}}, booktitle = {{Proc. of 4. GI-Informatiktage}}, pages = {{224--229}}, title = {{{Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression}}}, year = {{2002}}, } @inproceedings{2423, abstract = {{Wearable computers are embedded into the mobile environment of the human body. A design challenge for wearable systems is to combine the high performance required for tasks such as video decoding with low energy consumption required to maximize 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 two experiments that show the uses of reconfigurable hardware in WURM: ASICs-on-demand and adaptive interfaces. Finally, we develop and evaluate task placement techniques used in the operating system layer of WURM.}}, author = {{Plessl, Christian and Enzler, Rolf and Walder, Herbert and Beutel, Jan and Platzner, Marco and Thiele, Lothar}}, booktitle = {{Proc. Int. Symp. on Wearable Computers (ISWC)}}, isbn = {{0-7695-1816-8}}, keywords = {{wearable computing}}, pages = {{215--222}}, publisher = {{IEEE Computer Society}}, title = {{{Reconfigurable Hardware in Wearable Computing Nodes}}}, doi = {{10.1109/ISWC.2002.1167250}}, year = {{2002}}, } @inproceedings{2424, abstract = {{ Recent generations of high-density and high-speed FPGAs provide a sufficient capacity for implementing complete configurable systems on a chip (CSoCs). Hybrid CPUs that combine standard CPU cores with reconfigurable coprocessors are an important subclass of CSoCs. With partially reconfigurable FPGAs, coprocessors can be loaded on demand while the CPU remains running. However, the lack of high-level design tools for partial reconfiguration makes practical implementations a challenging task. In this paper, we introduce a design flow to implement hybrid processors on Xilinx Virtex. The design flow is based on two techniques, virtual sockets and feed-through components, and can efficiently generate partial configurations from industry-quality cores. We discuss the design flow and present a fully operational audio streaming prototype to demonstrate its feasibility. }}, author = {{Dyer, Matthias and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}}, keywords = {{partial reconfiguration}}, pages = {{292--301}}, publisher = {{Springer}}, title = {{{Partially Reconfigurable Cores for Xilinx Virtex}}}, doi = {{10.1007/3-540-46117-5}}, volume = {{2438}}, year = {{2002}}, } @inproceedings{2425, abstract = {{ We present instance-specific custom computing machines for the set covering problem. Four accelerator architectures are developed that implement branch \& bound in 3-valued logic and many of the deduction techniques found in software solvers. We use set covering benchmarks from two-level logic minimization and Steiner triple systems to derive and discuss experimental results. The resulting raw speedups are in the order of four magnitudes on average. Finally, we propose a hybrid solver architecture that combines the raw speed of instance-specific reconfigurable hardware with flexible bounding schemes implemented in software. }}, author = {{Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}}, pages = {{163--172}}, publisher = {{IEEE Computer Society}}, title = {{{Custom Computing Machines for the Set Covering Problem}}}, doi = {{10.1109/FPGA.2002.1106671}}, year = {{2002}}, } @article{24336, abstract = {{We define here a distributed abstract state machine (DASM) [7] of the network or routing layer of mobile ad hoc networks [13]. Such networks re- quire routing strategies substantially different from those used in static commu- nication networks, since storing and updating large routing tables at mobile hosts would congest the network with administration packets very fast. In [1], the hypercubic location service is presented, which considers a very strong definition of fault-tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Our goal in modeling the protocols for the distrib- uted location service and the position based routing is twofold. First, we support the definition and validation of wireless communication protocols and imple- mentations based thereon. Second, we feel that the abstract computation model naturally reflects the layering principle of communication architectures in com- bination with an uncompromisingly local view of the application domain. Thus we can identify fundamental semantic concepts, such as concurrency, reactivity and asynchronism, directly with the related concepts as imposed by the given application context. }}, author = {{ Benczúr, András and Glässer, Uwe and Lukovszki, Tamás}}, journal = {{Proc. of 10th International Workshop on Abstract State Machines, LNCS}}, title = {{{Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks}}}, year = {{2002}}, } @inproceedings{24338, author = {{Grünewald, Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus}}, booktitle = {{Proceedings of the 8th International Euro-Par Conference}}, issn = {{0302-9743}}, title = {{{Distributed Maintenance of Resource Efficient Wireless Network Topologies}}}, doi = {{10.1007/3-540-45706-2_134}}, year = {{2002}}, } @inproceedings{26412, author = {{Volbert, Klaus}}, booktitle = {{Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing}}, title = {{{A simulation environment for ad hoc networks using sector subdivision}}}, doi = {{10.1109/empdp.2002.994324}}, year = {{2002}}, } @article{3241, author = {{Wehrheim, Heike}}, journal = {{Nord. J. Comput.}}, number = {{4}}, pages = {{405----435}}, title = {{{Relating State-based and Behaviour-oriented Subtyping}}}, year = {{2002}}, } @inproceedings{3242, author = {{Olderog, Ernst-Rüdiger and Wehrheim, Heike}}, booktitle = {{Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures}}, editor = {{S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne and P. de Roever, Willem}}, pages = {{361----379}}, title = {{{Specification and Inheritance in {CSP-OZ}}}}, doi = {{10.1007/978-3-540-39656-7_15}}, year = {{2002}}, } @inproceedings{3243, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands}}, editor = {{Jacobs, Bart and Rensink, Arend}}, pages = {{79----93}}, title = {{{Checking Behavioural Subtypes via Refinement}}}, year = {{2002}}, } @article{3034, author = {{Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}}, issn = {{0018-9448}}, journal = {{IEEE Transactions on Information Theory}}, number = {{6}}, pages = {{1737--1744}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Priority encoding transmission}}}, doi = {{10.1109/18.556670}}, volume = {{42}}, year = {{2002}}, } @inproceedings{3040, author = {{Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}}, booktitle = {{Proceedings 35th Annual Symposium on Foundations of Computer Science}}, isbn = {{0818665807}}, publisher = {{IEEE Comput. Soc. Press}}, title = {{{Priority encoding transmission}}}, doi = {{10.1109/sfcs.1994.365731}}, year = {{2002}}, } @article{2134, author = {{Feige, Uriel and Scheideler, Christian}}, journal = {{Combinatorica}}, number = {{3}}, pages = {{361----399}}, title = {{{Improved Bounds for Acyclic Job Shop Scheduling}}}, doi = {{10.1007/s004930200018}}, year = {{2002}}, } @inproceedings{2135, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{SODA}}, pages = {{184----193}}, publisher = {{ACM/SIAM}}, title = {{{Improved bounds for the unsplittable flow problem}}}, year = {{2002}}, } @inproceedings{2136, author = {{Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{53----62}}, title = {{{Compact, adaptive placement schemes for non-uniform requirements}}}, year = {{2002}}, } @inproceedings{2137, author = {{Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}}, booktitle = {{SPAA}}, pages = {{265----274}}, title = {{{Algorithms for fault-tolerant routing in circuit switched networks}}}, year = {{2002}}, } @inproceedings{2138, author = {{Scheideler, Christian}}, booktitle = {{STACS}}, pages = {{27----49}}, publisher = {{Springer}}, title = {{{Models and Techniques for Communication in Dynamic Networks}}}, volume = {{2285}}, year = {{2002}}, } @article{18853, author = {{Sohler, Christian and Czumaj, Artur}}, journal = {{Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)}}, pages = {{83--92}}, title = {{{Abstract Combinatorial Programs and Efficient Property Testers}}}, year = {{2002}}, }