HardwareSoftware Success Failure Input Output. N-Version Programming Fault-Tolerant Programming Version 1 Version 2 Version N … Voter M Identical Outputs.

Slides:



Advertisements
Similar presentations
Smooting voter : a novel voting algorithm for handling multiple errors in fault-tolerant control systems Microprocessors and Microsystems 2003 G.Latif-Shabgahi,S.Bennett,J.M.Bass.
Advertisements

11. Practical fault-tolerant system design Reliable System Design 2005 by: Amir M. Rahmani.
Master/Slave Architecture Pattern Source: Pattern-Oriented Software Architecture, Vol. 1, Buschmann, et al.
3. Hardware Redundancy Reliable System Design 2010 by: Amir M. Rahmani.
Making Services Fault Tolerant
1 Building Reliable Web Services: Methodology, Composition, Modeling and Experiment Pat. P. W. Chan Department of Computer Science and Engineering The.
Reliability SHARPE Reliability and SHARPE. Outline 1. What is Reliability? 2. How can you evaluate it? 3. What is SHARPE? 4. Usage of SHARPE.
Oct Combinational Modeling Slide 1 Fault-Tolerant Computing Motivation, Background, and Tools.
8. Fault Tolerance in Software 8.1 Introduction Is it true that a program that has once performed a given task as specified will continue to do so? Yes,
8. Fault Tolerance in Software
Reliability on Web Services Pat Chan 31 Oct 2006.
7. Fault Tolerance Through Dynamic or Standby Redundancy 7.5 Forward Recovery Systems Upon the detection of a failure, the system discards the current.
Developing Dependable Systems CIS 376 Bruce R. Maxim UM-Dearborn.
Constructing Reliable Software Components Across the ORB M. Robert Rwebangira Howard University Future Aerospace Science and Technology.
Example of Weighted Voting System Undersea target detection system.
Reliability Modeling for Design Diversity: A Review and Some Empirical Studies Teresa Cai Group Meeting April 11, 2006.
EEE499 Real Time Systems Software Reliability (Part II)
1 Making Services Fault Tolerant Pat Chan, Michael R. Lyu Department of Computer Science and Engineering The Chinese University of Hong Kong Miroslaw Malek.
1 Building Reliable Web Services: Methodology, Composition, Modeling and Experiment Pat. P. W. Chan Supervised by Michael R. Lyu Department of Computer.
Multiple Sender Distributed Video Streaming Nguyen, Zakhor IEEE Transactions on Multimedia April 2004.
ECE355 Fall 2004Software Reliability1 ECE-355 Tutorial Jie Lian.
Software faults & reliability Presented by: Presented by: Pooja Jain Pooja Jain.
Team Members Lora zalmover Roni Brodsky Academic Advisor Professional Advisors Dr. Natalya Vanetik Prof. Shlomi Dolev Dr. Guy Tel-Zur.
2. Fault Tolerance. 2 Fault - Error - Failure Fault = physical defect or flow occurring in some component (hardware or software) Error = incorrect behavior.
SBSE Course 4. Overview: Design Translate requirements into a representation of software Focuses on –Data structures –Architecture –Interfaces –Algorithmic.
Managing Multi-User Databases AIMS 3710 R. Nakatsu.
Towards a Contract-based Fault-tolerant Scheduling Framework for Distributed Real-time Systems Abhilash Thekkilakattil, Huseyin Aysan and Sasikumar Punnekkat.
Distributed Systems 1 CS- 492 Distributed system & Parallel Processing Sunday: 2/4/1435 (8 – 11 ) Lecture (1) Introduction to distributed system and models.
Introduction to Hadoop and HDFS
An efficient active replication scheme that tolerate failures in distributed embedded real-time systems Alain Girault, Hamoudi Kalla and Yves Sorel Pop.
Ch. 1.  High-profile failures ◦ Therac 25 ◦ Denver Intl Airport ◦ Also, Patriot Missle.
Fault-Tolerant Systems Design Part 1.
SENG521 (Fall SENG 521 Software Reliability & Testing Fault Tolerant Software Systems: Techniques (Part 4b) Department of Electrical.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 20 Slide 1 Critical systems development 3.
By Dinesh Bajracharya Nepal Components of Information system.
CprE 458/558: Real-Time Systems
A computer system is made up of several components. Those that can be seen and touched are referred to as the hardware. Those that can’t be seen or touched.
FTC (DS) - V - TT - 0 HUMBOLDT-UNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK DEPENDABLE SYSTEMS Vorlesung 5 FAULT RECOVERY AND TOLERANCE TECHNIQUES (SYSTEM.
Fault-Tolerant Systems Design Part 1.
Multi-state System Element Pr{G  x} Element with total failure Element with five different performance levels g*gj4gj4 g j3 gj2gj2 gj1gj1 g j0 =0 x 1.
Multi-state System (MSS) Basic Concepts MSS is able to perform its task with partial performance “all or nothing” type of failure criterion cannot be.
UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department
Computing system Lesson Objective: Understand what is meant by a ‘computer system’ Learning Outcome: Define the key words and give a brief explanation.
1.The following diagram illustrates the relationship among various hardware components. The arrows indicate the directions of data flow. Activity 1 Relationship.
CSE 8377 Software Fault Tolerance. CSE 8377 Motivation Software is becoming central to many life- critical systems Software is created by error-prone.
1 Developing Aerospace Applications with a Reliable Web Services Paradigm Pat. P. W. Chan and Michael R. Lyu Department of Computer Science and Engineering.
A Survey of Fault Tolerance in Distributed Systems By Szeying Tan Fall 2002 CS 633.
An Algorithm for Automatically Obtaining Distributed and Fault Tolerant Static Schedules Alain Girault - Hamoudi Kalla - Yves Sorel - Mihaela Sighireanu.
Database Security Threats. Database An essential corporate resource Data is a valuable resource Must be strictly controlled, managed and secured May have.
1 Chapter 5 Software Reliability Software Engineering: Design, Reliability, and Management, International Std. Edition by Martin L. Shooman.
© 2010 VMware Inc. All rights reserved Why Virtualize? Beng-Hong Lim, VMware, Inc.
18/05/2006 Fault Tolerant Computing Based on Diversity by Seda Demirağ
Week#3 Software Quality Engineering.
Fault-Tolerant Computing Systems #3 Fault-Tolerant Software
Distributed Databases
UML Activity Diagram Documents the Flow the of Program
Fault Tolerance In Operating System
Reliability and Maintainability
Unit I Flash Cards Start.
UML Activity Diagram Documents the Flow the of Program
CS 1111 Introduction to Programming Fall 2018
InCheck: An In-application Recovery Scheme for Soft Errors
Building block to sort two numbers
Data vs Information
*** Series PRS Version 1, ***
CSE 1020:Software Development
Uncovered failures in MSS
Reliable Web Services: Methodology, Experiment and Modeling International Conference on Web Services (ICWS 2007) Pat. P. W. Chan, Michael R. Lyu Department.
 Is a machine that is able to take information (input), do some work on (process), and to make new information (output) COMPUTER.
Internal components of a computer.
Presentation transcript:

HardwareSoftware Success Failure Input Output

N-Version Programming Fault-Tolerant Programming Version 1 Version 2 Version N … Voter M Identical Outputs Correct Result Failure Recovery Blocks Scheme Version 1 AT Correct Result + - Version 2 AT Correct Result + - … Version N AT Correct Result + - Failure

t1t1 t1t1 t2t2 t3t3 t4t4 t5t5 t2t2 t3t3 t4t4 t5t5 TT failure success voting N-Version Programming M=3 Parallel Execution of Versions Consecutive Execution of Versions

Fault-Tolerant System Structure … … … Software Running on Different Hardware Blocks Software Running on Single Hardware Block

t 1 +t 4 t 1 +t t 1 +t 2 +t 3 +t t3t t3t L=1L=2 L=3L=4L=5 Effect of Parallel Versions Execution

Characteristics of Version Execution Time Computational Resources Reliability Characteristics of System Expected Execution Time E(T) Reliability Pr{ T < T* } Conditional Expected Execution Time E(T) | T < T* Reliability/Performance Analysis Problem

Distribution of System Execution Time Q(k/n)=Pr{ k out of n first versions succeed } i 1 : {1…n-k+1} i 2 : { i 1 +1 …n-k+2} Pj=Pr{ system succeeds after execution of version j } = r j Q(M-1/j-1)

UGF Approach Single version i: j first versions: For j = M: PMPM P j-1 PjPj

UGF Approach For each component c: P cM, P cM+1,…, P cn T cM, T cM+1,…, T cn For the entire system:

t1+t3t1+t Effect of Versions Sequencing t2+t4+t5t2+t4+t5 t3+t4t3+t4 t1+t2+t5t1+t2+t5 3-out-of-5 system

versions McMc ncnc No of component t r t r t r t r t r Parameters of Software System

R(300(E(T)E(T)T max T min Sequence of versionsProblem formulation No |132|54321|213|132 Min E(T) |312|43521|321|123 Max R(300) |123|12345|123|123 increasing t |213|52134|132|231 Max E(T) 4 Optimal Version Sequences

T* Software Structure Optimization R(T*) MAX |C < C* R(T*) MAX | C < C*

R(250)(T)E(T)ET max T min CSequence of versionsC* |541|37162|324| |241|64231|234| |431|31562|43| |241|4562|43|41100 Optimal Fault-Tolerant System Structures