@inproceedings{37068, author = {{Doemer, R. and Gerstlauer, A. and Müller, Wolfgang}}, booktitle = {{Proceedings of ASP-DAC'09}}, title = {{{Hardware-dependent Software for Multi- and Many-Core Embedded Systems}}}, year = {{2009}}, } @article{8180, abstract = {{Given a bipartite quantum state rho with subsystems A and B of arbitrary dimensions, we study the entanglement detecting capabilities of locally noneffective, or cyclic, unitary operations [L. B. Fu, Europhys. Lett., vol. 75, pp. 1-7, 2006]. Local cyclic unitaries have the special property that they leave their target subsystem invariant. We investigate the distance between rho and the global state after local application of such unitaries as a possible indicator of entanglement. To this end, we derive and discuss closed formulae for the maximal such distance achievable for three cases of interest: (pseudo)pure quantum states, Werner states, and two-qubit states. What makes this criterion interesting, as we show here, is that it surprisingly displays behavior similar to recent anomalies observed for non-locality measures in higher dimensions, as well as demonstrates an equivalence to the CHSH inequality for certain classes of two-qubit states. Yet, despite these similarities, the criterion is not itself a non-locality measure. We also consider entanglement detection in bound entangled states.}}, author = {{Gharibian, Sevag and Kampermann, Hermann and Bru{\ss}, Dagmar}}, journal = {{Quantum Information & Computation}}, number = {{11}}, pages = {{1013--1029}}, title = {{{On global effects caused by locally noneffective unitary operations}}}, volume = {{9}}, year = {{2009}}, } @article{8181, abstract = {{We investigate signatures of non-classicality in quantum states, in particular, those involved in the DQC1 model of mixed-state quantum computation [Phys. Rev. Lett. 81, 5672 (1998)]. To do so, we consider two known non-classicality criteria. The first quantifies disturbance of a quantum state under locally noneffective unitary operations (LNU), which are local unitaries acting invariantly on a subsystem. The second quantifies measurement induced disturbance (MID) in the eigenbasis of the reduced density matrices. We study the role of both figures of non-classicality in the exponential speedup of the DQC1 model and compare them vis-a-vis the interpretation provided in terms of quantum discord. In particular, we prove that a non-zero quantum discord implies a non-zero shift under LNUs. We also use the MID measure to study the locking of classical correlations [Phys. Rev. Lett. 92, 067902 (2004)] using two mutually unbiased bases (MUB). We find the MID measure to exactly correspond to the number of locked bits of correlation. For three or more MUBs, it predicts the possibility of superior locking effects.}}, author = {{Datta, Animesh and Gharibian, Sevag}}, issn = {{1050-2947}}, journal = {{Physical Review A}}, number = {{4}}, publisher = {{American Physical Society (APS)}}, title = {{{Signatures of nonclassicality in mixed-state quantum computation}}}, doi = {{10.1103/physreva.79.042325}}, volume = {{79}}, year = {{2009}}, } @inproceedings{2350, abstract = {{Mapping applications that consist of a collection of cores to FPGA accelerators and optimizing their performance is a challenging task in high performance reconfigurable computing. We present IMORC, an architectural template and highly versatile on-chip interconnect. IMORC links provide asynchronous FIFOs and bitwidth conversion which allows for flexibly composing accelerators from cores running at full speed within their own clock domains, thus facilitating the re-use of cores and portability. Further, IMORC inserts performance counters for monitoring runtime data. In this paper, we first introduce the IMORC architectural template and the on-chip interconnect, and then demonstrate IMORC on the example of accelerating the k-th nearest neighbor thinning problem on an XD1000 reconfigurable computing system. Using IMORC's monitoring infrastructure, we gain insights into the data-dependent behavior of the application which, in turn, allow for optimizing the accelerator. }}, author = {{Schumacher, Tobias and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}}, isbn = {{978-1-4244-4450-2}}, keywords = {{IMORC, interconnect, performance}}, pages = {{275--278}}, publisher = {{IEEE Computer Society}}, title = {{{IMORC: Application Mapping, Monitoring and Optimization for High-Performance Reconfigurable Computing}}}, doi = {{10.1109/FCCM.2009.25}}, year = {{2009}}, } @inproceedings{2262, abstract = {{In this work we present EvoCache, a novel approach for implementing application-specific caches. The key innovation of EvoCache is to make the function that maps memory addresses from the CPU address space to cache indices programmable. We support arbitrary Boolean mapping functions that are implemented within a small reconfigurable logic fabric. For finding suitable cache mapping functions we rely on techniques from the evolvable hardware domain and utilize an evolutionary optimization procedure. We evaluate the use of EvoCache in an embedded processor for two specific applications (JPEG and BZIP2 compression) with respect to execution time, cache miss rate and energy consumption. We show that the evolvable hardware approach for optimizing the cache functions not only significantly improves the cache performance for the training data used during optimization, but that the evolved mapping functions generalize very well. Compared to a conventional cache architecture, EvoCache applied to test data achieves a reduction in execution time of up to 14.31% for JPEG (10.98% for BZIP2), and in energy consumption by 16.43% for JPEG (10.70% for BZIP2). We also discuss the integration of EvoCache into the operating system and show that the area and delay overheads introduced by EvoCache are acceptable. }}, author = {{Kaufmann, Paul and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. NASA/ESA Conference on Adaptive Hardware and Systems (AHS)}}, keywords = {{EvoCache, evolvable hardware, computer architecture}}, pages = {{11--18}}, publisher = {{IEEE Computer Society}}, title = {{{EvoCaches: Application-specific Adaptation of Cache Mapping}}}, year = {{2009}}, } @inproceedings{2352, author = {{Beutel, Jan and Gruber, Stephan and Hasler, Andi and Lim, Roman and Meier, Andreas and Plessl, Christian and Talzi, Igor and Thiele, Lothar and Tschudin, Christian and Woehrle, Matthias and Yuecel, Mustafa}}, booktitle = {{Proc. Int. Conf. on Information Processing in Sensor Networks (IPSN)}}, isbn = {{978-1-4244-5108-1}}, keywords = {{WSN, PermaSense}}, pages = {{265--276}}, publisher = {{IEEE Computer Society}}, title = {{{PermaDAQ: A Scientific Instrument for Precision Sensing and Data Recovery in Environmental Extremes}}}, year = {{2009}}, } @inproceedings{2238, author = {{Schumacher, Tobias and Süß, Tim and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)}}, isbn = {{978-0-7695-3917-1}}, keywords = {{IMORC, graphics}}, pages = {{119--124}}, publisher = {{IEEE Computer Society}}, title = {{{Communication Performance Characterization for Reconfigurable Accelerator Design on the XD1000}}}, doi = {{10.1109/ReConFig.2009.32}}, year = {{2009}}, } @inproceedings{2261, author = {{Schumacher, Tobias and Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}}, isbn = {{978-1-4244-3892-1}}, issn = {{1946-1488}}, keywords = {{IMORC, NOC, KNN, accelerator}}, pages = {{338--344}}, publisher = {{IEEE}}, title = {{{An Accelerator for k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure}}}, year = {{2009}}, } @inproceedings{2263, abstract = {{In this paper, we introduce the Woolcano reconfigurable processor architecture. The architecture is based on the Xilinx Virtex-4 FX FPGA and leverages the Auxiliary Processing Unit (APU) as well as the partial reconfiguration capabilities to provide dynamically reconfigurable custom instructions. We also present a hardware tool flow that automatically translates software functions into custom instructions and a software tool flow that creates binaries using these instructions. While previous research on processors with reconfigurable functional units has been performed predominantly with simulation, the Woolcano architecture allows for exploring dynamic instruction set extension with commercially available hardware. Finally, we present a case study demonstrating a custom floating-point instruction generated with our approach, which achieves a 40x speedup over software-emulated floating-point operations and a 21% speedup over the Xilinx hardware floating-point unit. }}, author = {{Grad, Mariusz and Plessl, Christian}}, booktitle = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}, isbn = {{1-60132-101-5}}, pages = {{319--322}}, publisher = {{CSREA Press}}, title = {{{Woolcano: An Architecture and Tool Flow for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX}}}, year = {{2009}}, } @inproceedings{60468, author = {{Campen, Marcel}}, booktitle = {{Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress 27. und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology in Bonn}}, editor = {{Porada, Ludger}}, pages = {{219–222}}, publisher = {{GI}}, title = {{{A Framework for Geometry Processing based on Hybrid Surface Representations}}}, volume = {{S-8}}, year = {{2009}}, } @article{60467, author = {{Campen, Marcel}}, issn = {{0170-6012}}, journal = {{Informatik-Spektrum}}, number = {{1}}, pages = {{66--69}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Ein Framework für Geometrieverarbeitung basierend auf hybriden Oberflächendarstellungen}}}, doi = {{10.1007/s00287-009-0371-4}}, volume = {{33}}, year = {{2009}}, } @techreport{2513, author = {{Biermann, Thorsten and Dannewitz, Christian and Karl, Holger}}, title = {{{Extended Results on an Adaptive Resource/Performance Trade-Off for Resolving Complex Queries in P2P Networks}}}, year = {{2008}}, } @phdthesis{19615, author = {{Schomaker, Gunnar}}, isbn = {{978-3-939350-78-1}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Distributed Resource Allocation and Management in Heterogeneous Networks}}}, volume = {{259}}, year = {{2008}}, } @inproceedings{19686, author = {{Briest, Patrick}}, booktitle = {{Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}}, isbn = {{9783540705741}}, issn = {{0302-9743}}, title = {{{Uniform Budgets and the Envy-Free Pricing Problem}}}, doi = {{10.1007/978-3-540-70575-8_66}}, year = {{2008}}, } @inproceedings{19687, author = {{Briest, Patrick and Krysta, Piotr and Babaioff, Moshe}}, booktitle = {{Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)}}, title = {{{On the Approximability of Combinatorial Exchange Problems}}}, doi = {{https://doi.org/10.1007/978-3-540-79309-0_9}}, year = {{2008}}, } @techreport{19688, abstract = {{We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case.}}, author = {{Briest, Patrick and Goldberg, Paul W. and Roeglin, Heiko}}, title = {{{Approximate Equilibria in Games with Few Players}}}, year = {{2008}}, } @inproceedings{19812, abstract = {{Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, resource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algorithms such that the overlay network can be a connected random graph or use a random graph as backbone. Random graphs are expander graphs have logarithmic diameter, high node connectivity, excellent communication properties, and are expander graphs with high probability. In summary: they are an excellent choice to improve the stability and robustness of a dynamic network.}}, author = {{Schindelhauer, Christian and Mahlmann, Peter}}, booktitle = {{The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop}}, number = {{222}}, pages = {{1--22}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Random Graphs for Peer-to-Peer Overlays}}}, year = {{2008}}, } @inproceedings{19813, abstract = {{Autonomous robotic systems have been gaining the attention of research community in mobile ad hoc network since the past few years. While motion cost and communications cost constitute the primary energy consumers, each of them is investigated independently. By taking into account the power consumption of both entities, the overall energy efficiency of a system can be further improved. In this paper, the energy optimization problem of radio communication and motion is examined. We consider a hybrid wireless network that consists of a single autonomous mobile node and multiple relay nodes. The mobile node interacts with the relays within its vicinity by continuously communicating high-bandwidth data, e.g. triggered by a multimedia application like video surveillance. The goal is to find the best path such that the energy consumption for both mobility and communications is minimized. We introduce the Radio-Energy-Aware (REA) path computation strategy by utilizing node mobility. Given the starting point, the target point and the position of the relays, our simulation results show that the proposed strategy improves the energy efficiency of mobile node compared to the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. }}, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, booktitle = {{MWCN'08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}}, isbn = {{9780387848389}}, issn = {{1571-5736}}, publisher = {{Springer}}, title = {{{Detours Save Energy in Mobile Wireless Networks}}}, doi = {{10.1007/978-0-387-84839-6_6}}, year = {{2008}}, } @inproceedings{19832, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, booktitle = {{ARS'08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)}}, isbn = {{9783642006432}}, title = {{{Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots}}}, doi = {{10.1007/978-3-642-00644-9_4}}, year = {{2008}}, } @misc{19950, author = {{Pietrzyk, Peter}}, title = {{{Lokale Strategien zur Optimierung von Kommunikationsketten}}}, year = {{2008}}, }