Frank Slomka

Learn More
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized multiframe task system scheduled by earliest deadline first is presented. The new algorithm has a polynomial complexity to solve the Co-NP hard problem of schedulability analysis.(More)
This paper presents new fast exact feasibility tests for uniprocessor real-time systems using preemptive EDF scheduling.Task sets which are accepted by previously described sufficient tests will be evaluated in nearly the same time as with the old tests by the new algorithms. Many task sets are not accepted by the earlier tests despite them beeing(More)
Automotive embedded real-time systems such as Engine Management utilise cyclic tasks that are activated periodically based on angular rotation rather than time. As well as having variable inter-arrival times, these tasks also have deadlines and worst-case execution times that are dependent on angular velocity i.e. engine speed or rpm. Such tasks exhibit(More)
Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. However, in practice, some CAN device drivers implement FIFO rather than priority-based(More)
Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. However, in practice, some CAN device drivers implement FIFO rather than priority-based(More)
In this chapter, we propose an approach for the synthesis of heterogenous embedded systems, including allocation and binding problems. For solving these in general NP-complete problems, Evolutionary Algorithms have been proven to provide good solutions for search spaces of moderate size. For realistic embedded system applications, however, two more(More)
With the development of complex systems based on SDL, performance issues often play a major role. However, this is neither reflected by the SDL methodology nor by the specification techniques suggested by the methodology, namely SDL and MSC. To remedy this problem, we propose Performance Message Sequence Charts (PMSC). PMSC represents an extension of MSC-96(More)
In this paper we present an approach to calculate the maximum density of events in a distributed hard real-time system having tree-shaped dependencies. Thereby we will show that the density of events can be relaxed when taking scheduling dependencies into account. This relaxation has a direct impact on successive tasks and leads to tighter bounds for(More)