#### Filter Results:

- Full text PDF available (73)

#### Publication Year

1997

2015

- This year (0)
- Last 5 years (26)
- Last 10 years (61)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Karsten Albers, Frank Slomka
- ECRTS
- 2004

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)

- Karsten Albers, Frank Slomka
- Design, Automation and Test in Europe
- 2005

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)

- Robert I. Davis, Timo Feld, Victor Pollex, Frank Slomka
- 2014 IEEE 19th Real-Time and Embedded Technology…
- 2014

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)

- Robert I. Davis, Steffen Kollmann, Victor Pollex, Frank Slomka
- ECRTS
- 2011

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)

- Robert I. Davis, Steffen Kollmann, Victor Pollex, Frank Slomka
- Real-Time Systems
- 2012

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)

- Frank Slomka, Matthias Dörfel, Ralf Münzenberger, Richard Hofmann
- IEEE Design & Test of Computers
- 2000

- Nils Faltin, Lennard Lambert, Andreas Mitschele-Thiel, Frank Slomka
- SDL Forum
- 1997

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)

- Karsten Albers, Frank Bodmann, Frank Slomka
- ECRTS
- 2008

Analyzing future distributed real-time systems, automotive and avionic systems, is requiring compositional hard real-time analysis techniques. Well known established techniques as SymTA/S and the real-time calculus are candidates solving the mentioned problem. However both techniques use quite simple event models. SymTA/S is based on discrete events the… (More)

- Steffen Kollmann, Kevin Albers, Frank Slomka
- 2008 International Symposium on Performance…
- 2008

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)