design optimization of time and cost constrained fault
play

Design Optimization of Time- and Cost-Constrained Fault-Tolerant - PowerPoint PPT Presentation

Nov 13, 2022 •186 likes •408 views

Design Optimization of Time- and Cost-Constrained Fault-Tolerant Distributed Embedded Systems Viaceslav Izosimov, Paul Pop, Petru Eles, Zebo Peng Embedded Systems Lab (ESLAB) Linkping University, Sweden 1/21 1 of 14 Motivation Faults

  1. Design Optimization of Time- and Cost-Constrained Fault-Tolerant Distributed Embedded Systems Viaceslav Izosimov, Paul Pop, Petru Eles, Zebo Peng Embedded Systems Lab (ESLAB) Linköping University, Sweden 1/21 1 of 14

  2. Motivation � Faults � Hard real-time applications � Predictable � Timing constraints � Transient � Cost constraints � Intermittent � Hardware solutions vs. � Software solutions � Software solutions � Re-execution/rollback recovery � Re-execution/rollback recovery � MARS, TTA, X-by-Wire � Checkpointing/rollback recovery � Checkpointing/rollback recovery � Permanent faults � Replication, primary-backup… � Replication, primary-backup… � Costly for transient faults � Online preemptive vs. � Off-line non-preemptive � Flexible � Predictable 2/21 2 of 14

  3. Outline � Motivation � System architecture and fault-model � Fault-tolerance techniques � Problem formulation � Motivational examples � Tabu-search optimization strategy � Experimental results � Contributions and Message 3/21 3 of 14

  4. Fault-Tolerant Time-Triggered Systems Transient faults Processes: Processes: Re-execution and replication Static cyclic scheduling ... Messages: Messages: Fault-tolerant protocol Static schedule table Time Triggered Protocol ( TTP ) S 1 S 3 S 2 S 4 S 1 S 3 S 2 S 4 Bus access scheme: � Slot time-division multiple-access (TDMA) Schedule table located in each TTP � TDMA Round controller: message descriptor list (MEDL) Cycle of two rounds 4/21 4 of 14

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

  6. Problem Formulation � Given � Fault model � Number of transient faults in the system period � System architecture � Application � WCETs, message sizes, periods, deadlines � Determine Fault-model : transient faults � Schedulable and fault-tolerant design implementation ... � Fault-tolerance policy assignment � Mapping of processes and messages � Schedule tables for processes and messages Application : set of process graphs Architecture : time-triggered system 6/21 6 of 14

  7. Static Scheduling [Kandasamy et al. 03] Contingency Transparent Recovery schedules re-execution slack P 2 P 2 P 2 P 3 P 3 P 4 P 4 N 1 : S 1 N 1 : S 2 m 1 m 1 P 1 P 1 P 1 N 2 : S 12 N 2 : S 11 m 2 m 2 P 5 P 5 N 3 : S 14 N 3 : S 14 2 N 1 N 2 N 3 N 1 N 2 N 3 Root schedules S 1 S 1 S 11 S 11 S 14 P 2 P 3 P 4 P 5 P 5 P 1 S 2 S 2 S 6 S 9 S 12 S 12 S 15 S 18 m 2 Contingency P 5 P 2 P 3 P 4 P 3 P 4 P 4 P 1 m 1 schedules P 1 P 2 S 3 S 4 S 5 S 7 S 8 S 10 S 13 P 3 P 4 7/21 7 of 14

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

  9. Fault-Tolerant Policy Assignment Deadline N 1 N 1 P 1 P 1 P 2 P 2 P 4 P 4 No fault-tolerance: application crashes N 2 N 2 P 3 P 3 TTP TTP S 1 S 2 S 1 S 2 m 2 m 2 N 1 P 1 P 2 P 4 N 2 P 3 Missed TTP S 1 S 2 m 2 1 N 1 N 2 m 2 P 3 P 1 40 50 N 1 N 2 P 1 P 2 60 80 m 3 P 3 60 80 P 2 P 4 m 1 P 4 40 50 9/21 9 of 14

  10. Fault-Tolerant Policy Assignment Deadline N 1 N 1 P 1 P 1 P 2 P 2 P 4 P 4 No fault-tolerance: application crashes N 2 N 2 P 3 P 3 TTP TTP S 1 S 2 S 1 S 2 m 2 m 2 N 1 N 1 P 1 P 1 P 2 P 2 P 4 P 3 P 4 Missed N 2 P 1 P 2 P 3 P 4 N 2 P 3 Missed TTP TTP S 1 S 2 S 1 S 2 m 1 m 1 m 2 m 2 m 2 m 3 m 3 1 N 1 N 2 m 2 P 3 P 1 40 50 N 1 N 2 P 1 P 2 60 80 m 3 P 3 60 80 P 2 P 4 m 1 P 4 40 50 10/21 10 of 14

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

  12. Mapping and Fault-Tolerance Best mapping without N 1 P 1 P 2 P 4 considering fault-tolerance N 2 P 3 TTP S 1 S 2 m 4 m 2 Deadline N 1 P 1 P 2 P 4 N 2 P 3 Missed TTP S 1 S 2 m 2 m 4 P 1 m 1 m 2 N 1 N 2 1 P 1 40 X N 1 N 2 P 2 P 3 P 2 60 70 P 3 60 70 m 3 m 4 P 4 40 X P 4 12/21 12 of 14

  13. Mapping and Fault-Tolerance Best mapping without N 1 P 1 P 2 P 4 considering fault-tolerance N 2 P 3 Simultaneous TTP S 1 S 2 m 4 m 2 mapping and fault-tolerance Deadline Deadline N 1 N 1 P 1 P 1 P 2 P 2 P 3 P 4 P 4 Met N 2 N 2 P 3 Missed TTP TTP S 1 S 2 S 1 S 2 m 2 m 2 m 4 m 4 P 1 m 1 m 2 N 1 N 2 1 P 1 40 X N 1 N 2 P 2 P 3 P 2 60 70 P 3 60 70 m 3 m 4 P 4 40 X P 4 13/21 13 of 14

  14. Optimization Strategy Design optimization: � Fault-tolerance policy assignment � Tabu-search Mapping of processes and messages � List scheduling Root schedules � Three tabu-search optimization algorithms: � 1. Mapping and Fault-Tolerance Policy assignment ( MRX ) Re-execution, replication or both � 2. Mapping and only Re-Execution ( MX ) 3. Mapping and only Replication ( MR ) 14/21 14 of 14

  15. MRX Tabu-Search Example N 1 P 1 P 2 P 4 Current P 1 P 1 P 2 P 2 P 3 P 3 P 4 P 4 Tabu Tabu 1 1 2 2 0 0 0 0 solution N 2 P 3 Wait Wait 1 1 0 0 1 1 1 1 TTP S 1 S 2 S 2 m 2 Design transformations N 1 P 2 P 4 Tabu move & P 1 P 1 P 2 P 2 P 3 P 3 P 4 P 4 worse than Tabu Tabu 1 1 2 2 0 0 0 0 N 2 P 1 P 3 best-so-far Wait Wait 1 1 0 0 1 1 1 1 TTP S 1 S 2 S 1 m 1 N 1 N 2 1 m 2 P 3 P 1 40 50 N 1 N 2 P 2 60 75 P 1 m 3 P 3 60 75 P 2 P 4 m 1 P 4 40 50 15/21 15 of 14

  16. MRX Tabu-Search Example N 1 P 1 P 2 P 4 Current P 1 P 1 P 2 P 2 P 3 P 3 P 4 P 4 Tabu Tabu 1 1 2 2 0 0 0 0 solution N 2 P 3 Wait Wait 1 1 0 0 1 1 1 1 TTP S 1 S 2 S 2 m 2 Design transformations N 1 N 1 P 1 P 2 P 4 P 2 P 4 Tabu move & Tabu move & P 1 P 1 P 1 P 1 P 2 P 2 P 2 P 2 P 3 P 3 P 3 P 3 P 4 P 4 P 4 P 4 better than worse than Tabu Tabu Tabu Tabu 1 1 2 2 1 2 2 1 0 0 0 0 0 0 0 0 N 2 N 2 P 1 P 1 P 3 P 3 best-so-far best-so-far Wait Wait Wait Wait 0 1 1 0 0 0 0 0 2 2 1 1 1 1 1 1 TTP TTP S 1 S 2 S 1 S 2 S 1 m 2 m 1 m 1 N 1 N 2 1 m 2 P 3 P 1 40 50 N 1 N 2 P 2 60 75 P 1 m 3 P 3 60 75 P 2 P 4 m 1 P 4 40 50 16/21 16 of 14

  17. MRX Tabu-Search Example N 1 P 1 P 2 P 4 Current P 1 P 1 P 2 P 2 P 3 P 3 P 4 P 4 Tabu Tabu 1 1 2 2 0 0 0 0 solution N 2 P 3 Wait Wait 1 1 0 0 1 1 1 1 TTP S 1 S 2 S 2 m 2 Design transformations N 1 N 1 N 1 P 1 P 1 P 2 P 2 P 3 P 4 P 2 P 4 P 4 Non-tabu & Tabu move & Tabu move & P 1 P 1 P 1 P 1 P 1 P 1 P 2 P 2 P 2 P 2 P 2 P 2 P 3 P 3 P 3 P 3 P 3 P 3 P 4 P 4 P 4 P 4 P 4 P 4 worse than worse than better than Tabu Tabu Tabu Tabu Tabu Tabu 1 1 2 1 1 2 2 2 1 1 2 2 0 0 0 0 0 0 0 0 0 0 0 0 N 2 N 2 N 2 P 1 P 1 P 3 P 3 best-so-far best-so-far best-so-far Wait Wait Wait Wait Wait Wait 1 1 1 0 0 1 0 0 0 0 0 0 1 1 1 1 2 2 1 1 1 1 1 1 TTP TTP TTP S 1 S 2 S 1 S 2 S 1 S 2 S 2 S 1 m 2 m 1 m 2 m 1 N 1 N 2 1 m 2 P 3 P 1 40 50 N 1 N 2 P 2 60 75 P 1 m 3 P 3 60 75 P 2 P 4 m 1 P 4 40 50 17/21 17 of 14

  18. MRX Tabu-Search Example N 1 P 1 P 2 P 4 Current P 1 P 1 P 2 P 2 P 3 P 3 P 4 P 4 Tabu Tabu 1 1 2 2 0 0 0 0 solution N 2 P 3 Wait Wait 1 1 0 0 1 1 1 1 TTP S 1 S 2 S 2 m 2 Design transformations N 1 N 1 N 1 N 1 P 1 P 1 P 1 P 2 P 2 P 2 P 4 P 3 P 4 P 2 P 3 P 4 P 4 Non-tabu & Tabu move & Tabu move & Non-tabu & P 1 P 1 P 1 P 1 P 1 P 1 P 1 P 1 P 2 P 2 P 2 P 2 P 2 P 2 P 2 P 2 P 3 P 3 P 3 P 3 P 3 P 3 P 3 P 3 P 4 P 4 P 4 P 4 P 4 P 4 P 4 P 4 worse than worse than worse than better than Tabu Tabu Tabu Tabu Tabu Tabu Tabu Tabu 1 1 2 2 1 1 1 1 2 2 1 2 2 1 2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 N 2 N 2 N 2 N 2 P 1 P 1 P 3 P 3 P 3 best-so-far best-so-far best-so-far best-so-far Wait Wait Wait Wait Wait Wait Wait Wait 1 1 0 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 2 1 1 2 1 1 1 1 1 1 1 1 1 1 TTP TTP TTP TTP S 1 S 2 S 1 S 2 S 1 S 2 S 1 S 2 S 2 S 2 S 1 m 2 m 1 m 2 m 1 m 2 N 1 N 2 1 m 2 P 3 P 1 40 50 N 1 N 2 P 2 60 75 P 1 m 3 P 3 60 75 P 2 P 4 m 1 P 4 40 50 18/21 18 of 14

Recommend

FE design optimization under uncertainty as a Constrained optimization problem under uncertainty

FE design optimization under uncertainty as a Constrained optimization problem under uncertainty

FE design optimization under uncertainty as a Constrained optimization problem under uncertainty Gert de Cooman, Etienne Kerre, Erik Quaeghebeur & Keivan Shariatmadar FUM & SYSTeMS Research Groups Toy problem: two-component massless

479 views • 22 slides
Mixed-Integer PDE-Constrained Optimization Frontiers in PDE-constrained Optimization Pelin Cay,

Mixed-Integer PDE-Constrained Optimization Frontiers in PDE-constrained Optimization Pelin Cay,

Mixed-Integer PDE-Constrained Optimization Frontiers in PDE-constrained Optimization Pelin Cay, Bart van Bloemen Waanders, Drew Kouri, Anna Thuenen and Sven Leyffer Lehigh University, Universit at Magdeburg, Argonne National Laboratory, and

874 views • 45 slides
A Nonlinear Trust Region Framework for PDE-Constrained Optimization Using

A Nonlinear Trust Region Framework for PDE-Constrained Optimization Using

Motivation PDE-Constrained Optimization ROM-Constrained Optimization Numerical Experiments Conclusion References A Nonlinear Trust Region Framework for PDE-Constrained Optimization Using Progressively-Constructed Reduced-Order Models

458 views • 34 slides
AM 205: lecture 20 Today: PDE optimization, constrained optimization example New topic:

AM 205: lecture 20 Today: PDE optimization, constrained optimization example New topic:

AM 205: lecture 20 Today: PDE optimization, constrained optimization example New topic: eigenvalue problems PDE Constrained Optimization We will now consider optimization based on a function that depends on the solution of a PDE Let us

604 views • 26 slides
PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models Matthew J.

PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models Matthew J.

PDE-Constrained Optimization ROM-Constrained Optimization Numerical Experiments Conclusion PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models Matthew J. Zahr and Charbel Farhat Institute for Computational and

412 views • 23 slides
MATHEMATICS 1 CONTENTS Unconstrained optimization Constrained optimization Lagrange method

MATHEMATICS 1 CONTENTS Unconstrained optimization Constrained optimization Lagrange method

Constrained optimization BUSINESS MATHEMATICS 1 CONTENTS Unconstrained optimization Constrained optimization Lagrange method Old exam question Further study 2 UNCONSTRAINED OPTIMIZATION Recall extreme values in two dimensions

599 views • 25 slides
MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization V: Linear

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization V: Linear

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization V: Linear Programming and the Simplex Method Marco A. Montes de Oca Mathematical Sciences, University of Delaware, USA 1 / 61 Methods for Constrained

2.43k views • 61 slides
Optimization Optimization Goal: Find the minimizer ! that minimizes the objective (cost)

Optimization Optimization Goal: Find the minimizer ! that minimizes the objective (cost)

Optimization Optimization Goal: Find the minimizer ! that minimizes the objective (cost) function # ! : & Unconstrained Optimization # ! = min ! # ! Constrained Optimization # ! = min ! # ! s.t. , ! = - Equality

882 views • 38 slides
Newton Type Constrained Optimization in a Nutshell Moritz Diehl Optimization in Engineering

Newton Type Constrained Optimization in a Nutshell Moritz Diehl Optimization in Engineering

Newton Type Constrained Optimization in a Nutshell Moritz Diehl Optimization in Engineering Center (OPTEC) K.U. Leuven Overview Equality Constrained Optimization Optimality Conditions and Multipliers Newtons Method = SQP

382 views • 14 slides
MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VIII:

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VIII:

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VIII: Algorithms Marco A. Montes de Oca Mathematical Sciences, University of Delaware, USA 1 / 24 Algorithms for Nonlinear Constrained Optimization One basic

1.04k views • 24 slides
Presentation constrained optimization Wenda Chen Speech Data and Constrained Optimization

Presentation constrained optimization Wenda Chen Speech Data and Constrained Optimization

Presentation constrained optimization Wenda Chen Speech Data and Constrained Optimization Models Part 1: Speech Signal data (continuous): Adaptive filtering and LMS ICA with Negentropy criteria for source separation Part 2:

482 views • 15 slides
Some Remarks on Constrained Optimization Jos e Mario Mart nez www.ime.unicamp.br/

Some Remarks on Constrained Optimization Jos e Mario Mart nez www.ime.unicamp.br/

Some Remarks on Constrained Optimization Some Remarks on Constrained Optimization Jos e Mario Mart nez www.ime.unicamp.br/ martinez Department of Applied Mathematics, University of Campinas, Brazil 2011 Some Remarks on Constrained

530 views • 25 slides
Constrained optimization DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis

Constrained optimization DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis

Constrained optimization DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/OBDA_fall17/index.html Carlos Fernandez-Granda Compressed sensing Convex constrained problems Analyzing

1.58k views • 156 slides
Accelerating PDE-Constrained Optimization using Adaptive Reduced-Order Models: Application to

Accelerating PDE-Constrained Optimization using Adaptive Reduced-Order Models: Application to

Motivation ROM-Constrained Optimization Numerical Experiments Conclusion Accelerating PDE-Constrained Optimization using Adaptive Reduced-Order Models: Application to Topology Optimization Matthew J. Zahr Farhat Research Group Stanford

942 views • 72 slides
PDE-Constrained Optimization Using Hyper-Reduced Models Matthew J. Zahr and Charbel Farhat

PDE-Constrained Optimization Using Hyper-Reduced Models Matthew J. Zahr and Charbel Farhat

PDE-Constrained Optimization HROM-Constrained Optimization Numerical Experiment PDE-Constrained Optimization Using Hyper-Reduced Models Matthew J. Zahr and Charbel Farhat Institute for Computational and Mathematical Engineering Farhat

389 views • 26 slides
Ch02. Constrained Optimization Ping Yu Faculty of Business and Economics The University of Hong

Ch02. Constrained Optimization Ping Yu Faculty of Business and Economics The University of Hong

Ch02. Constrained Optimization Ping Yu Faculty of Business and Economics The University of Hong Kong Ping Yu (HKU) Constrained Optimization 1 / 38 Equality-Constrained Optimization 1 Lagrange Multipliers Caveats and Extensions

537 views • 39 slides
Computational Optimization Constrained Optimization m R b , m n n Easiest Problem

Computational Optimization Constrained Optimization m R b , m n n Easiest Problem

Computational Optimization Constrained Optimization m R b , m n n Easiest Problem R R Linear equality constraints f A b ( ) = f x Ax min . . s t Null Space Representation Let x* be a feasible point, Ax*=b.

354 views • 33 slides
Accelerating PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models

Accelerating PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models

Motivation PDE-Constrained Optimization Reduced-Order Models ROM-Constrained Optimization Numerical Experiments Conclusion References Accelerating PDE-Constrained Optimization using Progressively-Constructed Reduced-Order Models Matthew J.

1.5k views • 135 slides
MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VII: Duality

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VII: Duality

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization VII: Duality Marco A. Montes de Oca Mathematical Sciences, University of Delaware, USA 1 / 33 Economic Interpretation of a Dual Back to the diet problem: Food

1.29k views • 34 slides
MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization II Marco A.

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization II Marco A.

MATH529 Fundamentals of Optimization Fundamentals of Constrained Optimization II Marco A. Montes de Oca Mathematical Sciences, University of Delaware, USA 1 / 33 Multiple equality constraints: Example A motor company makes cars, trucks and

1.09k views • 33 slides
Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J.

Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J.

Introduction Optimization via Adaptive Model Reduction Large-Scale, Constrained Optimization Conclusion Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J. Zahr Advisor: Charbel Farhat

1.08k views • 90 slides
Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J.

Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J.

Introduction Optimization via Adaptive Model Reduction Large-Scale, Constrained Optimization Conclusion Accelerating PDE-Constrained Optimization Problems using Adaptive Reduced-Order Models Matthew J. Zahr Advisor: Charbel Farhat

1.24k views • 85 slides
Optimization Unconstrained optimization Constrained optimization Newton with equality

Optimization Unconstrained optimization Constrained optimization Newton with equality

Optimization Unconstrained optimization Constrained optimization Newton with equality One-dimensional constraints Multi-dimensional Active-set method Newtons method Descent methods Basic Newton Gradient Simplex method Gauss-

795 views • 55 slides
Algorithms for constrained local optimization Fabio Schoen 2008

Algorithms for constrained local optimization Fabio Schoen 2008

Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained local optimization p.

692 views • 45 slides

More recommend