@inproceedings{37056,
  abstract     = {{In this paper we present an approach to increase the fault tolerance in FlexRay networks by introducing backup nodes to replace defect ECUs (Electronic Control Units). In order to reduce the memory requirements of such backup nodes, we distribute redundant tasks over different nodes and propose the distributed coordinated migration of tasks of the defect ECU to the backup node at runtime. This approach enhances our former work in, where we extended the FlexRay bus schedule by redundant slots to consider changes in the communication/slot assignment and investigated and evaluated different solutions to migrate the redundant tasks to the backup node using the static and/or dynamic segment of the communication cycle for transmissions. We present the approach of distributed coordination for migration and communication instead of additional dedicated coordinator nodes to further increase the fault tolerance. With this approach we improve the safety of FlexRay networks by avoiding a possible single point of failure due to a dedicated coordinator node also minimizing the necessary time needed for a reconfiguration after an ECU failure. Furthermore, we reduce the overhead within the communication and the demand for additional hardware components.}},
  author       = {{Klobedanz, Kay and Defo, Gilles B. and Müller, Wolfgang and Kerstan, Timo}},
  booktitle    = {{Proceedings of SIES 2010}},
  keywords     = {{Fault tolerant systems, Protocols, Redundancy, Runtime, Payloads, Schedules}},
  title        = {{{Distributed Coordination of Task Migration for Fault-Tolerant FlexRay Networks}}},
  doi          = {{10.1109/SIES.2010.5551384}},
  year         = {{2010}},
}

@inproceedings{37053,
  abstract     = {{Seamless HW/SW codesign flows support early verification of hardware and Hardware-dependent Software (HdS) like drivers, operating systems, and firmware. For early estimation and verification, the application of SystemC in combination with Instruction Set Simulators and Software Emulators like QEMU is widely accepted. In this article, we present an advanced design flow for HW, (RT)OS and HdS refinement and verification with focus on the transition from abstract RTOS verification to full system RTOS/HdS emulation. In the context of assertion-based verification, we introduce a set of generic real-time properties which can be reused and verified at different abstraction levels and discuss their application. The properties are presented by the means of IEEE standard PSL assertions which are applied for mixed SystemC/HdS models.}},
  author       = {{Müller, Wolfgang and da S. Oliveira, Marcio F. and Zabel, Henning and Becker, Markus}},
  booktitle    = {{Proceedings of HLDVT2010}},
  keywords     = {{Hardware, Microprogramming, Application software, Timing, Protocols, Virtual prototyping, Real time systems, Sampling methods, Operating systems, Emulation}},
  location     = {{Anaheim, FL, USA}},
  publisher    = {{IEEE}},
  title        = {{{Verification of Real-Time Properties for Hardware-Dependant Software}}},
  year         = {{2010}},
}

@inproceedings{37060,
  author       = {{Oliveira, Marcio F. S. and do Nascimento, Francisco Assis M. and Müller, Wolfgang}},
  booktitle    = {{Proceedings of MoMPES 2010}},
  title        = {{{Design Space Abstraction and Metamodeling for Embedded Systems Design Space Exploration}}},
  year         = {{2010}},
}

@article{8179,
  abstract     = {{Given the density matrix rho of a bipartite quantum state, the quantum separability problem asks whether rho is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if rho is located within an inverse exponential (with respect to dimension) distance from the border of the set of separable quantum states. In this paper, we extend this NP-hardness to an inverse polynomial distance from the separable set. The result follows from a simple combination of works by Gurvits, Ioannou, and Liu. We apply our result to show (1) an immediate lower bound on the maximum distance between a bound entangled state and the separable set (assuming P != NP), and (2) NP-hardness for the problem of determining whether a completely positive trace-preserving linear map is entanglement-breaking.}},
  author       = {{Gharibian, Sevag}},
  journal      = {{Quantum Information & Computation}},
  number       = {{3{\&}4}},
  pages        = {{343--360}},
  title        = {{{Strong NP-hardness of the quantum separability problem}}},
  volume       = {{10}},
  year         = {{2010}},
}

@inproceedings{2223,
  author       = {{Lübbers, Enno and Platzner, Marco and Plessl, Christian and Keller, Ariane and Plattner, Bernhard}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  isbn         = {{1-60132-140-6}},
  pages        = {{225--231}},
  publisher    = {{CSREA Press}},
  title        = {{{Towards Adaptive Networking for Embedded Devices based on Reconfigurable Hardware}}},
  year         = {{2010}},
}

@inproceedings{2216,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)}},
  pages        = {{67--72}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Pruning the Design Space for Just-In-Time Processor Customization}}},
  doi          = {{10.1109/ReConFig.2010.19}},
  year         = {{2010}},
}

@inproceedings{2224,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  isbn         = {{1-60132-140-6}},
  pages        = {{144--150}},
  publisher    = {{CSREA Press}},
  title        = {{{An Open Source Circuit Library with Benchmarking Facilities}}},
  year         = {{2010}},
}

@inproceedings{2220,
  author       = {{Andrews, David and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}},
  isbn         = {{1-60132-140-6}},
  pages        = {{165}},
  publisher    = {{CSREA Press}},
  title        = {{{Configurable Processor Architectures: History and Trends}}},
  year         = {{2010}},
}

@proceedings{2222,
  editor       = {{Plaks, Toomas P. and Andrews, David and DeMara, Ronald and Lam, Herman and Lee, Jooheung and Plessl, Christian and Stitt, Greg}},
  isbn         = {{1-60132-140-6}},
  publisher    = {{CSREA Press}},
  title        = {{{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}},
  year         = {{2010}},
}

@inproceedings{2226,
  author       = {{Beisel, Tobias and Niekamp, Manuel and Plessl, Christian}},
  booktitle    = {{Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}},
  isbn         = {{978-1-4244-6965-9}},
  pages        = {{65--72}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators}}},
  doi          = {{10.1109/ASAP.2010.5540798}},
  year         = {{2010}},
}

@inproceedings{2206,
  author       = {{Keller, Ariane and Plattner, Bernhard and Lübbers, Enno and Platzner, Marco and Plessl, Christian}},
  booktitle    = {{Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)}},
  isbn         = {{978-1-4244-8864-3}},
  pages        = {{372--376}},
  publisher    = {{IEEE}},
  title        = {{{Reconfigurable Nodes for Future Networks}}},
  doi          = {{10.1109/GLOCOMW.2010.5700341}},
  year         = {{2010}},
}

@inproceedings{2227,
  author       = {{Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}},
  booktitle    = {{Proc. Int. Conf. Networked Sensing Systems (INSS)}},
  isbn         = {{978-1-4244-7911-5}},
  pages        = {{245--248}},
  publisher    = {{IEEE}},
  title        = {{{Rupeas: Ruby Powered Event Analysis DSL}}},
  doi          = {{10.1109/INSS.2010.5572211}},
  year         = {{2010}},
}

@inproceedings{2228,
  author       = {{Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}},
  booktitle    = {{Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)}},
  editor       = {{Hammami, Omar and Larrabee, Sandra}},
  title        = {{{Performance Estimation for the Exploration of CPU-Accelerator Architectures}}},
  year         = {{2010}},
}

@article{60463,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self‐intersections. Depending on the modification strategy, this effectively results in operators for Boolean combinations or for the construction of outer hulls that are suited for mesh repair tasks and accurate mesh‐based front tracking of deformable materials that split and merge. By combining an adaptive octree with nested binary space partitions (BSP), we can guarantee exactness (= correctness) and robustness (= completeness) of the algorithm while still achieving higher performance and less memory consumption than previous approaches. The efficiency and scalability in terms of runtime and memory is obtained by an operation localization scheme. We restrict the essential computations to those cells in the adaptive octree where intersections actually occur. Within those critical cells, we convert the input geometry into a plane‐based BSP‐representation which allows us to perform all computations exactly even with fixed precision arithmetics. We carefully analyze the precision requirements of the involved geometric data and predicates in order to guarantee correctness and show how minimal input mesh quantization can be used to safely rely on computations with standard floating point numbers. We properly evaluate our method with respect to precision, robustness, and efficiency.</jats:p>}},
  author       = {{Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{397--406}},
  publisher    = {{Wiley}},
  title        = {{{Exact and Robust (Self‐)Intersections for Polygonal Meshes}}},
  doi          = {{10.1111/j.1467-8659.2009.01609.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@article{60464,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and sweeping along a discrete rigid motion trajectory. Many previous methods focus on the construction of a polygonal superset (containing self‐intersections and spurious internal geometry) of the boundary of the volumes which are swept. Only few are able to determine a clean representation of the actual boundary, most of them in a discrete volumetric setting. We unify such superset constructions into a succinct common formulation and present a technique for the robust extraction of a polygonal mesh representing the outer boundary, i.e. it makes no general position assumptions and always yields a manifold, watertight mesh. It is exact for Minkowski sums and approximates swept volumes polygonally. By using plane‐based geometry in conjunction with hierarchical arrangement computations we avoid the necessity of arbitrary precision arithmetics and extensive special case handling. By restricting operations to regions containing pieces of the boundary, we significantly enhance the performance of the algorithm.</jats:p>}},
  author       = {{Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{1613--1622}},
  publisher    = {{Wiley}},
  title        = {{{Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes}}},
  doi          = {{10.1111/j.1467-8659.2010.01770.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@article{60462,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p> <jats:italic>In this paper, we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term “hybrid” applies to our method in two ways: First, our algorithm operates on a hybrid data structure which stores the original input polygons (surface data) in an adaptively refined octree (volume data). By this we combine the robustness of volumetric techniques with the accuracy of surface‐oriented techniques. Second, we generate a new triangulation only in a close vicinity around the intersections of the input meshes and thus preserve as much of the original mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean operation is confined to a very small region around the intersections of the input meshes, we can achieve very high adaptive refinement resolutions and hence very high precision. We demonstrate our method on a number of challenging examples.</jats:italic> </jats:p>}},
  author       = {{Pavić, Darko and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{1}},
  pages        = {{75--87}},
  publisher    = {{Wiley}},
  title        = {{{Hybrid Booleans}}},
  doi          = {{10.1111/j.1467-8659.2009.01545.x}},
  volume       = {{29}},
  year         = {{2010}},
}

@phdthesis{19605,
  author       = {{Lürwer-Brüggemeier, Katharina}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}}},
  volume       = {{261}},
  year         = {{2009}},
}

@phdthesis{19614,
  author       = {{Mense, Mario}},
  isbn         = {{978-3-939350-79-8}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{On Fault-Tolerant Data Placement in Storage Networks}}},
  volume       = {{260}},
  year         = {{2009}},
}

@phdthesis{19617,
  author       = {{Kortenjan, Michael}},
  isbn         = {{978-3-939350-77-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}}},
  volume       = {{258}},
  year         = {{2009}},
}

@phdthesis{19618,
  author       = {{Bonorden, Olaf}},
  isbn         = {{978-3-939350-76-7}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}}},
  volume       = {{257}},
  year         = {{2009}},
}