http://hdl.handle.net/10900/81790 2026-05-12T23:47:17Z 2026-05-12T23:47:17Z Käsgen, Philipp Weinhardt, Markus http://hdl.handle.net/10900/84299 2019-10-30T07:35:25Z 2018-03-13T00:00:00Z

Using Template Metaprogramming for Hardware Description Käsgen, Philipp; Weinhardt, Markus When designing digital systems, the Design Space is explored well in advance to rule out as many infeasible design options as possible, as a complete enumeration would be infeasible. Still, in the end, the designer is mostly left with several similar design options, i.e. actual choice of adder, Floating Point Unit etc. In such cases, a direct comparison cannot be avoided - at least in simulation. Even though the designer might have some module descriptions to be examined at hand, it might take a while to put them to work because of differing ports and control signals. But why should a system designer make the effort to adapt many modules to his design if he is only interested in a few aspects for a quick survey: overall power consumption, area occupation, timing, and correctness of results? This is the reason why we need a hardware description solely based on parameters. Such a description requires Metaprogramming Techniques because said parameters need to be translated to hardware behaviours. Hence, in this work we propose a parameter based hardware design paradigm based on SystemC and C++: Hardware Metadescription.

2018-03-13T00:00:00Z Feld, Timo Werkmann, Uwe Slomka, Frank http://hdl.handle.net/10900/84298 2019-10-30T07:35:23Z 2018-03-13T00:00:00Z

Real-Time Analysis of Distributed Systems including Tasks with Variable Rate-dependent Behavior Feld, Timo; Werkmann, Uwe; Slomka, Frank In automotive production car engines there are tasks, where the frequency of activation and execution times vary with the angular velocity of the engine. The variable rate-dependent behavior (VRB) task model has been proposed as a means of modeling this behavior. In the literature a variety of real-time analysis have been developed for tasks with this dependency of an angular velocity. However, these analysis focus on mono-processor systems. In this paper we propose the first analysis for distributed systems including VRB-tasks.

2018-03-13T00:00:00Z Hock, Florian Pollex, Victor Shen, Chijun Bund, Tobias Slomka, Frank http://hdl.handle.net/10900/84297 2019-10-30T07:36:52Z 2018-03-13T00:00:00Z

Upper Bound for Delay Densities Hock, Florian; Pollex, Victor; Shen, Chijun; Bund, Tobias; Slomka, Frank In networked control systems, sensors and actuators are connected via networks to the controller platform. Contrary to direct links, delays vary in a more or less wide range in network links. Hence, delays are one of the key issues in the design process of a networked control system. Therefore, obtaining safe upper bounds is essential to guarantee the desired behavior of the system. On the other hand, the bounds should be as tight as possible. Large overestimations result in over-dimensioned platforms and networks. A common approach is to assume the occurrence of the worst case response time (WCRT) for all transmissions. This simplifies the design process as the WCRT can be derived directly from the platform model. Though, it contains inherently large overestimations. A more accurate approach is featured by delay densities. By not treating each event individually, delay densities give a description of the timing behavior within intervals. Additionally, the method is not limited to strictly periodic events. In this paper, we propose a method for deriving an upper bound from a platform description in Real-Time-Calculus.

2018-03-13T00:00:00Z Sittel, Patrick Schönwälder, Thomas Kumm, Martin Zipf, Peter http://hdl.handle.net/10900/84296 2019-10-30T07:31:14Z 2018-03-13T00:00:00Z

ScaLP: A Light-Weighted (MI)LP-Library Sittel, Patrick; Schönwälder, Thomas; Kumm, Martin; Zipf, Peter Many design flows involve the process of automatically solving complex problems using linear relations. Especially, modern circuits and systems are often implemented using linear programming (LP). In the last years, code integration and portability have become critical topics, because it is not obvious to the designer which of the numerous LP-solvers is the most ideal regarding runtime performance, problem modeling and licensing. Additionally, current state-of-the-art integration tools require many dependencies, long compile times, are complicated to handle or provide interfaces that are susceptible for design errors. To provide a solution for these disadvantages, we present the light-weighted open-source (MI)LP-library ScaLP - a library that uses a unified interface to generically model LP-problems and enable runtime dynamic exchange of solvers.

2018-03-13T00:00:00Z