ECE 753: FAULT-TOLERANT COMPUTING

Slides:



Advertisements
Similar presentations
Rollback-Retry Techniques & Checnkpointing Protocols.
Advertisements

Distributed Snapshots: Determining Global States of Distributed Systems - K. Mani Chandy and Leslie Lamport.
Global States and Checkpoints
Christian Delbe1 Christian Delbé OASIS Team INRIA -- CNRS - I3S -- Univ. of Nice Sophia-Antipolis November Automatic Fault Tolerance in ProActive.
Uncoordinated Checkpointing The Global State Recording Algorithm.
Parallel and Distributed Simulation Time Warp: Basic Algorithm.
7. Fault Tolerance Through Dynamic (or Standby) Redundancy The lowest-cost fault-tolerance technique in multiprocessors. Steps performed: When a fault.
MPICH-V: Fault Tolerant MPI Rachit Chawla. Outline  Introduction  Objectives  Architecture  Performance  Conclusion.
Copyright 2004 Koren & Krishna ECE655/Ckpt Part.11.1 Fall 2006 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Fault Tolerant Computing.
CS-550 (M.Soneru): Recovery [SaS] 1 Recovery. CS-550 (M.Soneru): Recovery [SaS] 2 Recovery Computer system recovery: –Restore the system to a normal operational.
1 Message Logging Pessimistic & Optimistic CS717 Lecture 10/16/01-10/18/01 Kamen Yotov
7. Fault Tolerance Through Dynamic or Standby Redundancy 7.5 Forward Recovery Systems Upon the detection of a failure, the system discards the current.
EEC 688/788 Secure and Dependable Computing Lecture 14 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Page 1 Copyright © Alexander Allister Shvartsman CSE 6510 (461) Fall 2010 Selected Notes on Fault-Tolerance (12) Alexander A. Shvartsman Computer.
A Survey of Rollback-Recovery Protocols in Message-Passing Systems M. Elnozahy, L. Alvisi, Y. Wang, D. Johnson Carnegie Mellon University Presented by:
1 Rollback-Recovery Protocols II Mahmoud ElGammal.
Checkpointing and Recovery. Purpose Consider a long running application –Regularly checkpoint the application Expensive task –In case of failure, restore.
ECE 753: FAULT-TOLERANT COMPUTING Kewal K.Saluja Department of Electrical and Computer Engineering HIGH Level Fault-Tolerance: Checkpointing and recovery.
A Survey of Rollback-Recovery Protocols in Message-Passing Systems.
EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Fault Tolerant Systems
A Fault Tolerant Protocol for Massively Parallel Machines Sayantan Chakravorty Laxmikant Kale University of Illinois, Urbana-Champaign.
12. Recovery Study Meeting M1 Yuuki Horita 2004/5/14.
CS5204 – Operating Systems 1 Checkpointing-Recovery.
CprE 545: Fault Tolerant Systems (G. Manimaran), Iowa State University1 CprE 545: Fault Tolerant Systems Rollback Recovery Protocols.
Coordinated Checkpointing Presented by Sarah Arnold 1.
Chapter 2 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University Building Dependable Distributed Systems.
ECE 753: FAULT-TOLERANT COMPUTING Kewal K.Saluja Department of Electrical and Computer Engineering System Diagnosis.
EEC 688/788 Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Middleware for Fault Tolerant Applications Lihua Xu and Sheng Liu Jun, 05, 2003.
Rollback-Recovery Protocols I Message Passing Systems Nabil S. Al Ramli.
Fault Tolerance and Checkpointing - Sathish Vadhiyar.
A Survey of Fault Tolerance in Distributed Systems By Szeying Tan Fall 2002 CS 633.
ECE 753: FAULT-TOLERANT COMPUTING Kewal K.Saluja Department of Electrical and Computer Engineering Byzantine faults and Agreement Problem (Sensor Networks)
1 Fault Tolerance and Recovery Mostly taken from
Operating System Reliability Andy Wang COP 5611 Advanced Operating Systems.
PDES Introduction The Time Warp Mechanism
8.6. Recovery By Hemanth Kumar Reddy.
Computer Architecture and Assembly Language
Prepared by Ertuğrul Kuzan
Parallel and Distributed Simulation Techniques
EEC 688/788 Secure and Dependable Computing
Operating System Reliability
Operating System Reliability
Chapter 8 Fault Tolerance Part I Introduction.
Outline Distributed Mutual Exclusion Distributed Deadlock Detection
EECS 498 Introduction to Distributed Systems Fall 2017
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Operating System Reliability
Operating System Reliability
EEC 688/788 Secure and Dependable Computing
Distributed Systems CS
Distributed Systems CS
Middleware for Fault Tolerant Applications
EEC 688/788 Secure and Dependable Computing
Fault Tolerant Distributed Computing system.
Parallel and Distributed Simulation
EEC 688/788 Secure and Dependable Computing
Operating System Reliability
ECE 753: FAULT-TOLERANT COMPUTING
EEC 688/788 Secure and Dependable Computing
A Beginners Guide to Transactions
Computer Architecture and Assembly Language
ITEC452 Distributed Computing Lecture 8 Distributed Snapshot
EEC 688/788 Secure and Dependable Computing
EEC 688/788 Secure and Dependable Computing
Last Class: Fault Tolerance
Operating System Reliability
University of Wisconsin-Madison Presented by: Nick Kirchem
Operating System Reliability
Presentation transcript:

ECE 753: FAULT-TOLERANT COMPUTING 7/24/2019 ECE 753: FAULT-TOLERANT COMPUTING Kewal K.Saluja Department of Electrical and Computer Engineering HIGH Level Fault-Tolerance: Checkpointing and recovery (more slides) – Forward error recovery

ECE 753 Fault Tolerant Computing 7/24/2019 Overview Forward error recovery Summary ECE 753 Fault Tolerant Computing

Checkpointing: Dist. Sys. (contd.) 7/24/2019 Checkpointing: Dist. Sys. (contd.) Checkpoint based recovery – Comm. induced Place system wide constraints on message passing (communication pattern) and checkpointing to guarantee progression of recovery line For example if within every checkpoint interval all messages received precede all messages sent, then the system is domino effect free. Such a message passing system will appear to be as follows Global checkpoint state Global checkpoint state ECE 753 Fault Tolerant Computing

Checkpointing: Dist. Sys. (contd.) 7/24/2019 Checkpointing: Dist. Sys. (contd.) Checkpoint based recovery – Comm. induced Consistency of state can be guaranteed (no domino effect will take place) if we take a checkpoint before every non deterministic event (note this is a special case of what we saw before). The challenge here is to reduce the number of checkpoints Generalization of the previous statement (all “receives” to precede “sends”) have been studied in literature ECE 753 Fault Tolerant Computing

Checkpointing: Dist. Sys. (contd.) 7/24/2019 Checkpointing: Dist. Sys. (contd.) Log based recovery - Pessimistic logging (contd.) Example and logs Logs of P0 is {m0, m4, m7} P1 is {m1, m3, m6} P2 is {m2, m5} m2 m0 m1 m3 m4 m5 m6 m7 P0 P1 P2 A B C ECE 753 Fault Tolerant Computing

Forward error recovery 7/24/2019 Forward error recovery Consider the following scheme for checkpoint based rollback recovery Two processors P1 and P2 At checkpoints P1 and P2 compare results and save state (checkpoints) Error detected at such a comparison, causes the processors P1 and P2 to roll back Note: if there were three processors, they could potentially mask the faulty process/processor ECE 753 Fault Tolerant Computing

Forward error recovery (contd.) 7/24/2019 Forward error recovery (contd.) Roll forward – two processors and a spare error P1 P2 chk2 compare chk1 spare ECE 753 Fault Tolerant Computing

Forward error recovery (contd.) 7/24/2019 Forward error recovery (contd.) Additional issues If we had three processors to begin with why not use fault masking? Think of more than one job and the number of processors required – a single spare can be spare for many pairs of jobs What if a second fault occurs while processor P1 is continuing? Use spare for one more period ECE 753 Fault Tolerant Computing

ECE 753 Fault Tolerant Computing 7/24/2019 Summary Discussed checkpointing and logging issues at length ECE 753 Fault Tolerant Computing