Eike Thaden

dblp:56/3704 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-7984-4147ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Security and privacy · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 39% Electronic design automation · 30% Hardware reliability and fault tolerance · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › reliability modeling
fault tree analysis
0.312018
Semi-automatic safety analysis and optimization · DAC 2018
Electronic design automation › hardware verification and test
hardware verification
0.312018
Semi-automatic safety analysis and optimization · DAC 2018
Embedded and real-time systems › critical systems
safety-critical systems
0.312018
Semi-automatic safety analysis and optimization · DAC 2018
Embedded and real-time systems › automotive embedded systems
automotive e/e architectures
0.112018
Semi-automatic safety analysis and optimization · DAC 2018

Methods — techniques the papers use, named apart from their topics

fault tree analysis · 0.3failure mode and effects analysis · 0.3
YearPublicationVenuePosition
2018 Semi-automatic safety analysis and optimization
abstract
The complexity of safety-critical E/E-systems within the automotive domain are continuously increasing. At the same time, functional safety standards such as the ISO 26262 prescribe analysis methods like the Fault Tree Analysis (FTA) and Failure Mode and Effects Analysis (FMEA). Currently, these analysis methods are mainly performed manually and are often not consistent with an evolving system model.
Peter Munk, Andreas Abele, Eike Thaden, Arne Nordmann, Rakshith Amarnath, Markus Schweizer, Simon Burton 0001
DAC3
2018 A Model-Based Safety Analysis of Dependencies Across Abstraction Layers
Christoph Dropmann, Eike Thaden, Mario Trapp, Denis Uecker, Rakshith Amarnath, Leandro Avila da Silva, Peter Munk, Markus Schweizer, Matthias Jung 0001, Rasmus Adler
SAFECOMP2
2011 A Column Generation Approach to Scheduling of Periodic Tasks
Ernst Althaus, Rouven Naujoks, Eike Thaden
SEA3
2010 Exploiting Gaps in Fixed-Priority Preemptive Schedules for Task Insertion
abstract
This paper addresses the problem of assigning tasks to embedded control units. The units are considered to be connected via a bus, and tasks may already be deployed onto the units. To save costs, the objective is to insert as many new tasks onto the system as possible. In this setting, to support early design decisions, we present an approximative and fast pre-analysis of the system. We introduce spare-time analysis and the analysis of maximal allowed worst-case execution time to simplify the problem and to achieve a fast solving algorithm, which we implement as mixed-integer linear problem. We conduct experiments to investigate the scalability of the approach with the result that for input sizes of up to 160 tasks with up to 50% not-yet-deployed tasks a solution is found in many cases within reasonable time, our machine needs in the average case 150s. With a reference example, taken from literature, we compare our approach with a similar method and show that our approach is faster.
Eike Thaden, Henrik Lipskoch, Alexander Metzner, Ingo Stierand
RTCSA1