1) The document discusses holistic analysis and optimization of heterogeneous fault-tolerant embedded systems. It addresses issues like mapping, scheduling, and assigning fault tolerance policies for applications on such systems. 2) Tabu search algorithms are proposed to optimize mapping, scheduling and fault tolerance policy assignment to maximize schedulability under faults. 3) Experimental results on a vehicle cruise controller case study show the proposed approach can find a schedulable fault-tolerant solution with 65% overhead.

1. Holistic Analysis and Optimization of Heterogeneous Fault-Tolerant Embedded Systems Paul Pop Sept. 29, 2006

2. General purpose vs. special purpose Embedded system

3. Embedded Systems

4. Automotive Electronics

5. Automotive Electronics, cont. 90% of innovations are based on embedded systems 8.9 Market ($billions) 10.5 13.1 14.1 15.8 17.4 19.3 21.0 0 200 400 600 800 1000 1200 1400 1998 1999 2000 2001 2002 2003 2004 2005

6. Holistic Analysis and Optimization of Heterogeneous Fault-Tolerant Embedded Systems Paul Pop Sept. 29, 2006

7. Architecture

11. Holistic Analysis and Optimization of Heterogeneous Fault-Tolerant Embedded Systems Paul Pop Sept. 29, 2006

17. Holistic Analysis and Optimization of Heterogeneous Fault-Tolerant Embedded Systems Paul Pop Sept. 29, 2006

19. Fault-Tolerant Mapping and Scheduling Messages: Schedule tables Messages: Fault-tolerant protocol Processes: Schedule tables ... TDMA bus: TTP Transient faults Processes: Re-execution and replication

21. Fault-Tolerant Techniques P 1 P 1 P 1 Re-execution N 1 P 1 P 1 P 1 Replication N 1 N 2 N 3 P 1 P 1 N 1 N 2 P 1 Re-executed replicas 2

22. Re-execution vs. Replication A 1 Replication is better Re-execution is better N 1 N 2 P 1 P 3 P 2 m 1 1 P 1 P 2 P 3 N 1 N 2 40 50 40 60 50 70 N 1 N 2 TTP P 1 P 2 S 1 S 2 P 3 Met N 1 N 2 TTP P 1 P 2 P 3 S 1 S 2 Missed P 1 N 1 N 2 TTP P 1 P 2 P 2 P 3 P 3 S 1 S 2 m 1 m 1 m 2 m 2 Deadline Met P 1 P 3 P 2 m 1 m 2 A 2 P 1 S 1 N 1 N 2 TTP P 1 S 2 P 2 P 2 P 3 P 3 Deadline Missed m 1 m 1

23. Fault-Tolerant Policy Assignment P 1 N 1 N 2 TTP P 2 P 3 S 1 S 2 P 4 m 2 Missed P 1 P 2 P 3 N 1 N 2 40 50 60 60 80 80 P 4 40 50 1 N 1 N 2 P 1 P 4 P 2 P 3 m 1 m 2 m 3 P 1 N 1 N 2 TTP P 2 P 3 S 1 S 2 m 2 P 4 N 1 N 2 P 1 P 3 S 1 S 2 P 4 P 2 P 1 m 1 m 1 TTP m 2 m 2 P 2 m 3 m 3 P 3 P 4 Missed P 1 N 1 N 2 TTP P 2 P 3 S 1 S 2 m 2 P 4 No fault-tolerance: application crashes N 1 N 2 P 1 P 3 S 1 S 2 P 4 P 2 P 1 m 2 m 1 TTP Met Optimization of fault-tolerance policy assignment Deadline