@inbook{33813, abstract = {{Today, mobile and embedded real-time systems have to cope with the migration and allocation of multiple software tasks running on top of a real-time operating system (RTOS) residing on one or several system processors. Each RTOS has to be configured towards the individual needs of the application and environment. For this, different scheduling strategies and task priorities have to be evaluated in order to keep execution and response times for a given task set. Abstract RTOS simulation is applied to analyze different parameters in early design phases. This chapter presents a SystemC RTOS library for abstract yet accurate RTOS sim- ulation, supporting modeling of preemption in the presence of prioritized and nested interrupts. After introducing basic principles of abstract RTOS simula- tion, we present our SystemC library in detail. Thereafter, we discuss related approaches and close with applications in electronic automotive systems design and some evaluations.}}, author = {{Zabel, Henning and Müller, Wolfgang and Gerstlauer, Andreas}}, booktitle = {{Hardware Dependent Software - Principles and Practice}}, editor = {{Ecker, Wolfgang and Müller, Wolfgang and Dömer, Rainer}}, isbn = {{978-1-4020-9435-4}}, keywords = {{RTOS Modelling, RTOS Simulation, SystemC, Task Scheduling, Interrupt Analysis}}, pages = {{233--260}}, publisher = {{Springer Verlag}}, title = {{{Accurate RTOS Modelling and Analysis with SystemC}}}, doi = {{10.1007/978-1-4020-9436-1_9}}, year = {{2009}}, } @inbook{33814, abstract = {{Rapidly rising system complexity has created a growing productivity gap in the design of electronic systems. One critical component is Hardware-dependent Software (HdS), the importance of which is often underestimated. In this chap- ter, we introduce HdS and illustrate its role in the overall system design context. We also provide a brief overview and define a basic HdS terminology and con- clude with a brief outlook over the following chapters in this book.}}, author = {{Ecker, Wolfgang and Müller, Wolfgang and Dömer, Rainer}}, booktitle = {{Hardware Dependent Software - Principles and Practice}}, editor = {{Ecker, Wolfgang and Müller, Wolfgang and Dömer, Rainer}}, isbn = {{978-1-4020-9435-4}}, keywords = {{Hardware-dependent Software, Systems Complexity, Productivity Gap}}, pages = {{1--14}}, publisher = {{Springer Verlag}}, title = {{{Hardware-dependent Software - Introduction and Overview}}}, doi = {{10.1007/978-1-4020-9436-1_1}}, year = {{2009}}, } @inproceedings{46414, abstract = {{Over the last decades, evolutionary algorithms (EA) have proven their applicability to hard and complex industrial optimization problems in many cases. However, especially in cases with high computational demands for fitness evaluations (FE), the number of required FE is often seen as a drawback of these techniques. This is partly due to lacking robust and reliable methods to determine convergence, which would stop the algorithm before useless evaluations are carried out. To overcome this drawback, we define a method for online convergence detection (OCD) based on statistical tests, which invokes a number of performance indicators and which can be applied on a stand-alone basis (no predefined Pareto fronts, ideal and reference points). Our experiments show the general applicability of OCD by analyzing its performance for different algorithmic setups and on different classes of test functions. Furthermore, we show that the number of FE can be reduced considerably – compared to common suggestions from literature – without significantly deteriorating approximation accuracy.}}, author = {{Wagner, Tobias and Trautmann, Heike and Naujoks, Boris}}, booktitle = {{Evolutionary Multi-Criterion Optimization}}, editor = {{Ehrgott, Matthias and Fonseca, Carlos M. and Gandibleux, Xavier and Hao, Jin-Kao and Sevaux, Marc}}, isbn = {{978-3-642-01020-0}}, pages = {{198–215}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{OCD: Online Convergence Detection for Evolutionary Multi-Objective Algorithms Based on Statistical Testing}}}, doi = {{https://doi.org/10.1007/978-3-642-01020-0_19}}, year = {{2009}}, } @inproceedings{46415, abstract = {{Noisy environments are a challenging task for multiobjective evolutionary algorithms. The algorithms may be trapped in local optima or even become a random search in the decision and objective space. In the course of the paper the classical definition of Pareto-dominance is enhanced subject to noisy objective functions in order to make the evolutionary search process more robust and to generate a reliable Pareto front. At each point in the decision space the objective functions are evaluated a fixed number of times and the convex hull of the objective function vectors is computed. Expectation is associated with the median of the objective function values while uncertainty is reflected by the average distance of the median in each dimension to the points defining the convex hull. By combining these two indicators a new concept of Pareto-dominance is set up. An implementation in NSGA-II and application to test problems show a gain in robustness and search quality.}}, author = {{Trautmann, Heike and Mehnen, Jorn and Naujoks, Boris}}, booktitle = {{2009 IEEE Congress on Evolutionary Computation}}, issn = {{1941-0026}}, pages = {{3119--3126}}, title = {{{Pareto-dominance in noisy environments}}}, doi = {{10.1109/CEC.2009.4983338}}, year = {{2009}}, } @inproceedings{46413, abstract = {{Industry applications of multiobjective optimization problems mostly are characterized by the demand for high quality solutions on the one hand. On the other hand an optimization result is desired which at any rate meets the time constraints for the evolutionary multiobjective algorithms (EMOA). The handling of this trade-off is a frequently discussed issue in multiobjective evolutionary optimization.}}, author = {{Naujoks, Boris and Trautmann, Heike}}, booktitle = {{2009 IEEE Congress on Evolutionary Computation}}, issn = {{1941-0026}}, pages = {{332--339}}, title = {{{Online convergence detection for multiobjective aerodynamic applications}}}, doi = {{10.1109/CEC.2009.4982966}}, year = {{2009}}, } @article{46416, author = {{Trautmann, Heike and Mehnen, J}}, journal = {{International Journal of Computational Intelligence Research}}, number = {{2}}, pages = {{72–78}}, title = {{{Statistical Methods for Improving Multi-objective Evolutionary Optimisation}}}, volume = {{5}}, year = {{2009}}, } @article{46417, abstract = {{ In this article a method for including a priori preferences of decision makers into multicriteria optimization problems is presented. A set of Pareto-optimal solutions is determined via desirability functions of the objectives which reveal experts’ preferences regarding different objective regions. An application to noisy objective functions is not straightforward but very relevant for practical applications. Two approaches are introduced in order to handle the respective uncertainties by means of the proposed preference-based Pareto optimization. By applying the methods to the original and uncertain Binh problem and a noisy single cut turning cost optimization problem, these approaches prove to be very effective in focusing on different parts of the Pareto front of the ori-ginal problem in both certain and noisy environments. }}, author = {{Trautmann, Heike and Mehnen, Jörn}}, journal = {{Engineering Optimization}}, number = {{1}}, pages = {{23--38}}, publisher = {{Taylor & Francis}}, title = {{{Preference-based Pareto optimization in certain and noisy environments}}}, doi = {{10.1080/03052150802347926}}, volume = {{41}}, year = {{2009}}, } @article{46418, abstract = {{In this paper, two approaches for estimating the generation in which a multi-objective evolutionary algorithm (MOEA) shows statistically significant signs of convergence are introduced. A set-based perspective is taken where convergence is measured by performance indicators. The proposed techniques fulfill the requirements of proper statistical assessment on the one hand and efficient optimisation for real-world problems on the other hand. The first approach accounts for the stochastic nature of the MOEA by repeating the optimisation runs for increasing generation numbers and analysing the performance indicators using statistical tools. This technique results in a very robust offline procedure. Moreover, an online convergence detection method is introduced as well. This method automatically stops the MOEA when either the variance of the performance indicators falls below a specified threshold or a stagnation of their overall trend is detected. Both methods are analysed and compared for two MOEA and on different classes of benchmark functions. It is shown that the methods successfully operate on all stated problems needing less function evaluations while preserving good approximation quality at the same time.}}, author = {{Trautmann, Heike and Wagner, T. and Naujoks, B. and Preuss, M. and Mehnen, J.}}, issn = {{1063-6560}}, journal = {{Evolutionary Computation}}, number = {{4}}, pages = {{493--509}}, title = {{{Statistical Methods for Convergence Detection of Multi-Objective Evolutionary Algorithms}}}, doi = {{10.1162/evco.2009.17.4.17403}}, volume = {{17}}, year = {{2009}}, } @article{2999, author = {{Blömer, Johannes and Naewe, Stefanie}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{Geometry of numbers, Lattices, Shortest vectors}}, number = {{18}}, pages = {{1648 -- 1665}}, title = {{{Sampling methods for shortest vectors, closest vectors and successive minima}}}, doi = {{10.1016/j.tcs.2008.12.045}}, volume = {{410}}, year = {{2009}}, } @inproceedings{37067, abstract = {{IP-XACT is a well accepted standard for the exchange of IP components at Electronic System and Register Transfer Level. Still, the creation and manipulation of these descriptions at the XML level can be time-consuming and error-prone. In this paper, we show that the UML can be consistently applied as an efficient and comprehensible frontend for IP-XACT-based IP description and integration. For this, we present an IP-XACT UML profile that enables UML-based descriptions covering the same information as a corresponding IP-XACT description. This enables the automated generation of IP-XACT component and design descriptions from respective UML models. In particular, it also allows the integration of existing IPs with UML. To illustrate our approach, we present an application example based on the IBM PowerPC Evaluation Kit.}}, author = {{Schattkowsky, Tim and Xie, Tao and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE'09}}, isbn = {{978-1-4244-3781-8}}, keywords = {{Unified modeling language, XML, Power system modeling, Application software, Master-slave, Power system management, Acceleration, Scattering, Software engineering, Software standards}}, publisher = {{IEEE}}, title = {{{A UML Frontend for IP-XACT-based IP Management}}}, doi = {{10.1109/DATE.2009.5090664}}, year = {{2009}}, } @inproceedings{37066, abstract = {{Today, mobile and embedded real-time systems have to cope with the migration and allocation of multiple software tasks running on top of a real-time operating system (RTOS) residing on one or multiple system processors. Abstract RTOS simulations and timing analysis applies for fast and early estimation to configure it towards the individual needs of the application and environment. In this context, a high accuracy of the simulation compared to an instruction set simulation (ISS) is of key importance. In this paper, we investigate the accuracy of abstract RTOS simulation and compare it to ISS and the behavior of the physical system. We show that we can reach an increased accuracy of the simulation when we inject noise into the time model. Our results indicate that it is sufficient to inject uniformly distributed random time values to the RTOS real-time clock.}}, author = {{Zabel, Henning and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE'09}}, isbn = {{978-1-4244-3781-8}}, keywords = {{Timing, Analytical models, Clocks, Performance analysis, Scheduling, Operating systems, Delay, Real time systems, Application software, Context modeling}}, title = {{{Increased Accuracy through Noise Injection in Abstract RTOS Simulation}}}, doi = {{10.1109/DATE.2009.5090925}}, year = {{2009}}, } @inproceedings{37063, abstract = {{Safety-critical automotive systems must fulfill hard real-time constraints to guarantee their reliability and safety requirements. In the context of network-based electronics systems, high-level timing requirements have to be carefully mastered and traced throughout the whole development process. In this paper, we outline the management of scheduling-specific timing information by the application of a steer-by-wire design example. We apply the principles of the AUTOSAR-compliant Timing Augmented Description Language (TADL) following the methodology introduced by the TIMMO project[2]. Focus of the example will be the identification of end-to-end timing constraints and their refinement by means of stimuli-response event chains.}}, author = {{Klobedanz, Kay and Kuznik, Christoph and Elfeky, Ahmed and Müller, Wolfgang}}, booktitle = {{Proceedings of IESS09}}, isbn = {{978-3-642-04283-6}}, keywords = {{Abstraction Level Controller Area Network High Abstraction Level Event Chain Automotive System}}, publisher = {{Springer Verlag}}, title = {{{Development of Automotive Communication Based Real-Time Systems - A Steer-by-Wire Case Study}}}, doi = {{10.1007/978-3-642-04284-3_20}}, year = {{2009}}, } @inproceedings{37064, author = {{Becker, Markus and Zabel, Henning and Müller, Wolfgang}}, location = {{Berlin}}, title = {{{Integration abstrakter RTOS-Simulation in den Entwurf eingebetteter automobiler E/E-Systeme}}}, year = {{2009}}, } @inproceedings{37061, author = {{Krupp, Alexander and Müller, Wolfgang}}, booktitle = {{Proceedings of IESS09}}, title = {{{Systematic Model-in-the-Loop Test of Embedded Control Systems}}}, year = {{2009}}, } @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}}, }