Ralf Stemmer

Mr. Ralf Stemmer

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 September 2022 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
DGDominik Grundt
Dominik Grundt
AKAnna Köhne
Anna Köhne
ISIshan Saxena
Ishan Saxena
RSRalf Stemmer
Ralf Stemmer
BWBernd Westphal
Bernd Westphal
EMEike Möhlmann
Eike Möhlmann

20 March 2025 in Science of Computer Programming
Verified
Journal Article
Open access
RSRalf Stemmer
Ralf Stemmer
ISIshan Saxena
Ishan Saxena
LPLukas Panneke
Lukas Panneke
DGDominik Grundt
Dominik Grundt
AAAnna Austel
Anna Austel
BWBernd Westphal
Bernd Westphal

20 July 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RSRalf Stemmer
Ralf Stemmer
HVHai Dang VU
Hai Dang VU
SNSebastien Le Nours
Sebastien Le Nours
KGKim Grüttner
Kim Grüttner
SPSebastien Pillement
Sebastien Pillement
WNWolfgang Nebel
Wolfgang Nebel
Fast yet accurate performance and timing prediction of complex parallel data flow applications on multi-processor systems remains a very difficult discipline. The reason for it comes from the complexity of the data flow applications w.r.t. data dependent execution paths and the hardware platform with shared resources, like buses and memories. This combination may lead to complex timing interferences that are difficult to express in pure analytical or classical simulation-based approaches. In this work, we propose the combination of timing measurement and statistical simulation models for probabilistic timing and performance prediction of Synchronous Data Flow (SDF) applications on MPSoCs with shared memories. We exploit the separation of computation and communication in our SDF model of computation to set-up simulation-based performance prediction models following different abstraction approaches. We especially propose a message-level communication model driven by a data-dependent probabilistic execution phase timing model. We compare our work against measurement on two case-studies from the computer vision domain: a Sobel filter and a JPEG decoder. We show that the accuracy and execution time of our modeling and evaluation framework outperforms existing approaches and is suitable for a fast yet accurate design space exploration.

8 April 2025
Verified
Conference Paper
Closed access
PUPatrick Uven
Patrick Uven
RSRalf Stemmer
Ralf Stemmer
GNGregor Nitsche
Gregor Nitsche
Software-Defined Vehicle (SDV) architectures are expected to reliably run more than 100 million lines of code and to receive 50 to 200 software updates per year, requiring their operating systems and middlewares to safely provide resources for thousands of different services and to allow for regular changes in the runtime environment. To specify and validate the proper resource allocation of such complicated and dynamically changing software architectures, we present an architecture template to model software layers based on modules with formalized interfaces and resource requirements between them. Like building blocks, these modules can be used to model automotive hardware software stacks with their consumed and provided resources to ensure integrability and to support runtime monitoring.

17 January 2023
Verified
Conference Paper
Open access
QDQuentin Dariol
Quentin Dariol
SNSebastien Le Nours
Sebastien Le Nours
DHDomenik Helms
Domenik Helms
RSRalf Stemmer
Ralf Stemmer
SPSebastien Pillement
Sebastien Pillement
KGKim Grüttner
Kim Grüttner
When deploying Artificial Neural Networks (ANNs) onto multi-core embedded platforms, an intensive evaluation flow is necessary to find implementations that optimize resource usage, timing and power. ANNs require indeed significant amounts of computational and memory resources to execute, while embedded execution platforms offer limited resources with strict power budget. Concurrent accesses from processors to shared resources on multi-core platforms can lead to bottlenecks with impact on performance and power. Existing approaches show limitations to deliver fast yet accurate evaluation ahead of ANN deployment on the targeted hardware. In this paper, we present a modeling flow for timing and power prediction in early design stage of fully-connected ANNs on multi-core platforms. Our flow offers fast yet accurate predictions with consideration of shared communication resources and scalability in regards of the number of cores used. The flow is evaluated on real measurements for 42 mappings of 3 fully-connected ANNs executed on a clock-gated multi-core platform featuring two different communication modes: polling or interrupt-based. Our modeling flow predicts timing with accuracy and power with accuracy on the tested mappings for an average simulation time of 0.23 s for 100 iterations. We then illustrate the application of our approach for efficient design space exploration of ANN implementations.