| 1. |
- Eles, Petru Ion, 1954-, et al.
(författare)
-
Synthesis of Fault-Tolerant Embedded Systems
- 2008
-
Ingår i: Design, Automation and Test in Europe, 2008.. - Munich, Germany : IEEE. - 9783981080131 ; , s. 960-965, s. 1117-1122
-
Konferensbidrag (refereegranskat)abstract
- This work addresses the issue of design optimization for fault-tolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpointing with rollback recovery and active replication. Fault tolerant schedules are generated based on a conditional process graph representation. The formulated system synthesis approaches decide the assignment of fault-tolerance policies to processes, the optimal placement of checkpoints and the mapping of processes to processors, such that multiple transient faults are tolerated, transparency requirements are considered, and the timing constraints of the application are satisfied.
|
|
| 2. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Design Optimization of Time- and Cost-Constrained Fault-Tolerant Distributed Embedded Systems
- 2005
-
Ingår i: Design Automation and Test in Europe Conference DATE 2005,2005. - Munich, Germany : IEEE Computer Society Press. - 0769522882 ; , s. 864-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach to the design optimization of fault-tolerant embedded systems for safety-critical applications. Processes are statically scheduled and communications are performed using the time-triggered protocol. We use process re-execution and replication for tolerating transient faults. Our design optimization approach decides the mapping of processes to processors and the assignment of fault-tolerant policies to processes such that transient faults are tolerated and the timing constraints of the application are satisfied. We present several heuristics which are able to find fault-tolerant implementations given a limited amount of resources. The developed algorithms are evaluated using extensive experiments, including a real-life example.
|
|
| 3. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems
- 2006
-
Ingår i: 9th Euromicro Conference on Digital System Design,2006. - Dubrovnik : IEEE Computer Society Press. - 0769526098 ; , s. 313-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled. Process re-execution is used for recovering from multiple transient faults. We call process recovery transparent if it does not affect operation of other processes. Transparent recovery has the advantage of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules. However, it will introduce additional delays that can lead to violations of the timing constraints of the application. We propose an algorithm for the mapping of fault-tolerant applications with transparency. The algorithm decides a mapping of processes on computation nodes such that the application is schedulable and the transparency properties imposed by the designer are satisfied. The mapping algorithm is driven by a heuristic that is able to estimate the worst-case schedule length and indicate whether a certain mapping alternative is schedulable.
|
|
| 4. |
- Izosimov, Viacheslav, 1980-
(författare)
-
Scheduling and Optimization of Fault-Tolerant Distributed Embedded Systems
- 2009
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Safety-critical applications have to function correctly and deliver high level of quality-ofservice even in the presence of faults. This thesis deals with techniques for tolerating effects of transient and intermittent faults. Re-execution, software replication, and rollback recovery with checkpointing are used to provide the required level of fault tolerance at the software level. Hardening is used to increase the reliability of hardware components. These techniques are considered in the context of distributed real-time systems with static and quasi-static scheduling.Many safety-critical applications have also strict time and cost constrains, which means that not only faults have to be tolerated but also the constraints should be satisfied. Hence, efficient system design approaches with careful consideration of fault tolerance are required. This thesis proposes several design optimization strategies and scheduling techniques that take fault tolerance into account. The design optimization tasks addressed include, among others, process mapping, fault tolerance policy assignment, checkpoint distribution, and trading-off between hardware hardening and software re-execution. Particular optimization approaches are also proposed to consider debugability requirements of fault-tolerant applications. Finally, quality-of-service aspects have been addressed in the thesis for fault-tolerant embedded systems with soft and hard timing constraints.The proposed scheduling and design optimization strategies have been thoroughly evaluated with extensive experiments. The experimental results show that considering fault tolerance during system-level design optimization is essential when designing cost-effective and high-quality fault-tolerant embedded systems.
|
|
| 5. |
- Izosimov, Viacheslav, 1980-
(författare)
-
Scheduling and Optimization of Fault-Tolerant Embedded Systems
- 2006
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Safety-critical applications have to function correctly even in presence of faults. This thesis deals with techniques for tolerating effects of transient and intermittent faults. Reexecution, software replication, and rollback recovery with checkpointing are used to provide the required level of fault tolerance. These techniques are considered in the context of distributed real-time systems with non-preemptive static cyclic scheduling.Safety-critical applications have strict time and cost constrains, which means that not only faults have to be tolerated but also the constraints should be satisfied. Hence, efficient system design approaches with consideration of fault tolerance are required.The thesis proposes several design optimization strategies and scheduling techniques that take fault tolerance into account. The design optimization tasks addressed include, among others, process mapping, fault tolerance policy assignment, and checkpoint distribution.Dedicated scheduling techniques and mapping optimization strategies are also proposed to handle customized transparency requirements associated with processes and messages. By providing fault containment, transparency can, potentially, improve testability and debugability of fault-tolerant applications.The efficiency of the proposed scheduling techniques and design optimization strategies is evaluated with extensive experiments conducted on a number of synthetic applications and a real-life example. The experimental results show that considering fault tolerance during system-level design optimization is essential when designing cost-effective fault-tolerant embedded systems.
|
|
| 6. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints
- 2008
-
Ingår i: Design, Automation, and Test in Europe DATE 2008,2008. - Munich, Germany : IEEE Computer Society Press. - 9783981080131 - 9783981080148 ; , s. 915-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarantee the deadlines for the hard processes even in the case of faults, while maximizing the overall utility. We use time/utility functions to capture the utility of soft processes. A single static schedule computed off-line is not fault tolerant and is pessimistic in terms of utility, while a purely online approach, which computes a new schedule every time a process fails or completes, incurs an unacceptable overhead. Thus, we use a quasi-static scheduling strategy, where a set of schedules is synthesized off-line and, at run time, the scheduler will select the right schedule based on the occurrence of faults and the actual execution times of processes. The proposed schedule synthesis heuristics have been evaluated using extensive experiments.
|
|
| 7. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Synthesis of Fault-Tolerant Embedded Systems with Checkpointing and Replication
- 2006
-
Ingår i: 3rd IEEE Intl. Workshop on Electronic Design, Test Applications DELTA,2006. - Kuala Lumpur, Malaysia : IEEE Computer Society Press. - 0769525008 ; , s. 440-
-
Konferensbidrag (refereegranskat)abstract
- We present an approach to the synthesis of fault-tolerant hard real-time systems for safety-critical applications. We use checkpointing with rollback recovery and active replication for tolerating transient faults. Processes are statically scheduled and communications are performed using the time-triggered protocol. Our synthesis approach decides the assignment of fault-tolerance policies to processes, the optimal placement of checkpoints and the mapping of processes to processors such that transient faults are tolerated and the timing constraints of the application are satisfied. We present several synthesis algorithms which are able to find fault-tolerant implementations given a limited amount of resources. The developed algorithms are evaluated using extensive experiments, including a real-life example.
|
|
| 8. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems
- 2006
-
Ingår i: Design Automation and Test in Europe Conference DATE 2006,2006. - Munich, Germany : IEEE Computer Society Press. ; , s. 706-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach to the scheduling of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. If process recovery is performed such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes.
|
|
| 9. |
- Izosimov, Viacheslav, 1980-, et al.
(författare)
-
Synthesis of Flexible Fault-Tolerant Schedules with Preemption for Mixed Soft and Hard Real-Time Systems
- 2008
-
Ingår i: 11th EUROMICRO CONFERENCE on DIGITAL SYSTEM DESIGN DSD 2008,2008. - Parma, Italy : IEEE Computer Society Press. - 9780769532776 ; , s. 71-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach for scheduling with preemption for fault-tolerant embedded systems composed of soft and hard real-time processes. We are interested to maximize the overall utility for average, most likely to happen, scenarios and to guarantee the deadlines for the hard processes in the worst case scenarios. In many applications, the worst-case execution times of processes can be much longer than their average execution times. Thus, designs for the worst-case can be overly pessimistic, i.e., result in low overall utility. We propose preemption of process executions as a method to generate flexible schedules that maximize the overall utility for the average case while guarantee timing constraints in the worst case. Our scheduling algorithms determine off-line when to preempt and when to resurrect processes. The experimental results show the superiority of our new scheduling approach compared to approaches without preemption.
|
|
| 10. |
- Kleberger, Pierre, 1978, et al.
(författare)
-
Security Concerns in Communication with the Connected Car using DoIP
- 2011
-
Ingår i: 15. Internationaler Kongress Elektronik im Kraftfahrzeug; Elektrik, Elektronik, Elektromobilität. Baden-Baden, 12. and 13. Oktober 2011. VDI, Fahrzeug- und Verkehrstechnik.. - : Verein Deutscher Ingenieure. - 9783180921327 ; Verein Deutscher Ingenieure: VDI-Berichte:2132, s. 245-254
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- n this paper, we investigate the threats and challenges when using untrusted network links for communication with the connected car. A prototype system using the Diagnostics over IP (DoIP) protocol has been implemented within our project. We highlight the DoIP security challenges that we have identified. We further discuss how the environment appears to attackers, which vulnerabilities can be exploited and what the possible consequences can be. Possible countermeasures and security mechanisms are discussed to address these threats and vulnerabilities.
|
|
| 11. |
- Pop, Paul, 1974-, et al.
(författare)
-
Design Optimization of Multi-Cluster Embedded Systems for Real-Time Applications
- 2004
-
Ingår i: Design, Automation and Test in Europe DATE 2004,2004. - Paris, France : IEEE Computer Society Press. - 0769520855 ; , s. 1028-
-
Konferensbidrag (refereegranskat)abstract
- We present an approach to design optimization of multi-cluster embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In this paper, we address design problems which are characteristic to multi-clusters: partitioning of the system functionality into time-triggered and event-triggered domains, process mapping, and the optimization of parameters corresponding to the communication protocol. We present several heuristics for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example.
|
|
| 12. |
- Pop, Paul, 1974-, et al.
(författare)
-
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
- 2004
-
Ingår i: 16th Euromicro Conference on Real-Time Systems,2004. - Catania, Sicily : IEEE Computer Society Press. - 0769521762 ; , s. 91-
-
Konferensbidrag (refereegranskat)abstract
- We present an approach to partitioning and mapping for multi-cluster embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. We have proposed a schedulability analysis for such systems, including a worst-case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Based on this analysis, we address design problems which are characteristic to multi-clusters: partitioning of the system functionality into time-triggered and event-triggered domains, and process mapping. We present a branch and bound algorithm for solving these problems. Our heuristic is able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example.
|
|
| 13. |
- Pop, Paul, 1974-, et al.
(författare)
-
Scheduling and Voltage Scaling for Energy/Reliability Trade-offs in Fault-Tolerant Time-Triggered Embedded Systems
- 2007
-
Ingår i: 5th Intl. Conf. on Hardware/Software Codesign and System Synthesis CODES+ISSS,2007. - Salzburg, Austria : IEEE Computer Society Press. - 9781595938244 ; , s. 233-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an approach to the scheduling and voltage scaling of low-power fault-tolerant hard real-time applications mapped on distributed heterogeneous embedded systems. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. Addressing simultaneously energy and reliability is especially challenging because lowering the voltage to reduce the energy consumption has been shown to exponentially increase the number of transient faults. In addition, time-redundancy based fault-tolerance techniques such as re-execution and dynamic voltage scaling-based low-power techniques are competing for the slack in the schedules. Our approach decides the voltage levels and start times of processes and the transmission times of messages, such that the transient faults are tolerated, the timing constraints of the application are satisfied and the energy is minimized. We present a constraint logic programming- based approach which is able to find reliable and schedulable implementations within limited energy and hardware resources. The developed algorithms have been evaluated using extensive experiments.
|
|
| 14. |
- Poulsen, Kåre, et al.
(författare)
-
A Constraint Logic Programming Framework for the Synthesis of Fault-Tolerant Schedules for Distributed Embedded Systems
- 2007
-
Ingår i: 12th IEEE Conf. on Emerging Technologies and Factory Automation Work-In-Progress Section,2007. - Patras, Greece : IEEE Computer Society Press. ; , s. 756-
-
Konferensbidrag (refereegranskat)abstract
- We present a constraint logic programming (CLP) approach for synthesis of fault-tolerant hard real-time applications on distributed heterogeneous architectures. We address time-triggered systems, where processes and messages are statically scheduled based on schedule tables. We use process re-execution for recovering from multiple transient faults. We propose three scheduling approaches, which each present a trade-off between schedule simplicity and performance, (i) full transparency, (ii) slack sharing and (iii) conditional, and provide various degrees of transparency. We have developed a CLP framework that produces the fault-tolerant schedules, guaranteeing schedulability in the presence of transient faults. We show how the framework can be used to tackle design optimization problems.The proposed approach has been evaluated using extensive experiments.
|
|
| 15. |
- Poulsen, Kåre, et al.
(författare)
-
Energy-Aware Synthesis of Fault-Tolerant Schedules for Real-Time Distributed Embedded Systems
- 2007
-
Ingår i: 19th Euromicro Conference on Real-Time Systems ECRTS, Work-In-Progress Section,2007. - Pisa, Italy : IEEE Computer Society Press. ; , s. 21-
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a design optimisation tool for distributed embedded real-time systems that 1) decides mapping, fault-tolerance policy and generates a fault-tolerant schedule, 2) is targeted for hard real-time, 3) has hard reliability goal, 4) generates static schedule for processes and messages, 5) provides fault-tolerance for k transient/soft faults, 6) optimises for minimal energy consumption, while considering impact of lowering voltages on the probability of faults, 7) uses constraint logic programming (CLP) based implementation.
|
|
