Jenhui Chen Office number:

Slides:



Advertisements
Similar presentations
Distributed Snapshots: Determining Global States of Distributed Systems - K. Mani Chandy and Leslie Lamport.
Advertisements

Global States.
From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Slides for Chapter 14: Time and.
Uncoordinated Checkpointing The Global State Recording Algorithm Cristian Solano.
Time and Global States Part 3 ECEN5053 Software Engineering of Distributed Systems University of Colorado, Boulder.
CS542 Topics in Distributed Systems Diganta Goswami.
Slides for Chapter 11: Time and Global State
Distributed Computing 5. Snapshot Shmuel Zaks ©
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Logical Clocks and Global State.
From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Exercises for Chapter 14: TIME.
CS 582 / CMPE 481 Distributed Systems
Causality & Global States. P1 P2 P Physical Time 4 6 Include(obj1 ) obj1.method() P2 has obj1 Causality violation occurs when order.
Ordering and Consistent Cuts Presented By Biswanath Panda.
CMPT 431 Dr. Alexandra Fedorova Lecture VIII: Time And Global Clocks.
Distributed Systems Fall 2009 Logical time, global states, and debugging.
Slides for Chapter 10: Time and Global State
Time and Global States Chapter 11. Why time? Time is an Important and interesting issue in distributes systems. One we can measure accurately. Can use.
Ordering and Consistent Cuts
20101 Synchronization in distributed systems A collection of independent computers that appears to its users as a single coherent system.
Ordering and Consistent Cuts Presented by Chi H. Ho.
Computer Science Lecture 10, page 1 CS677: Distributed OS Last Class: Clock Synchronization Physical clocks Clock synchronization algorithms –Cristian’s.
Global Predicate Detection and Event Ordering. Our Problem To compute predicates over the state of a distributed application.
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Logical Clocks and Global State.
Chapter 5.
CIS 720 Distributed algorithms. “Paint on the forehead” problem Each of you can see other’s forehead but not your own. I announce “some of you have paint.
1 Distributed Systems CS 425 / CSE 424 / ECE 428 Global Snapshots Reading: Sections 11.5 (4 th ed), 14.5 (5 th ed)  2010, I. Gupta, K. Nahrtstedt, S.
1 Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms Author: Ozalp Babaoglu and Keith Marzullo Distributed Systems: 526.
Lecture 6-1 Computer Science 425 Distributed Systems CS 425 / ECE 428 Fall 2013 Indranil Gupta (Indy) September 12, 2013 Lecture 6 Global Snapshots Reading:
Chapter 10: Time and Global States
Slides for Chapter 9: Time and Global State From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 4, © Pearson Education.
Distributed Systems Fall 2010 Logical time, global states, and debugging.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Global States Steve Ko Computer Sciences and Engineering University at Buffalo.
Time This powerpoint presentation has been adapted from: 1) sApr20.ppt.
Ordering of Events in Distributed Systems UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department CS 739 Distributed Systems Andrea C. Arpaci-Dusseau.
CSE 486/586 CSE 486/586 Distributed Systems Global States Steve Ko Computer Sciences and Engineering University at Buffalo.
Lecture 4-1 Computer Science 425 Distributed Systems (Fall2009) Lecture 4 Chandy-Lamport Snapshot Algorithm and Multicast Communication Reading: Section.
1 Chapter 11 Global Properties (Distributed Termination)
Hwajung Lee. -- How many messages are in transit on the internet? --What is the global state of a distributed system of N processes? How do we compute.
Distributed Systems Lecture 6 Global states and snapshots 1.
Ordering of Events in Distributed Systems UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department CS 739 Distributed Systems Andrea C. Arpaci-Dusseau.
Global state and snapshot
Consistent cut A cut is a set of events.
Global state and snapshot
Lecture 3: State, Detection
Vector Clocks and Distributed Snapshots
CSE 486/586 Distributed Systems Global States
Theoretical Foundations
Distributed Snapshot.
EECS 498 Introduction to Distributed Systems Fall 2017
Distributed Snapshot.
湖南大学-信息科学与工程学院-计算机与科学系
Slides for Chapter 14: Time and Global States
Logical Clocks and Casual Ordering
Outline Theoretical Foundations - continued Lab 1
Time And Global Clocks CMPT 431.
Distributed Snapshot Distributed Systems.
Chapter 5 (through section 5.4)
Exercises for Chapter 11: TIME AND GLOBAL STATES
Slides for Chapter 11: Time and Global State
Slides for Chapter 14: Time and Global States
Outline Theoretical Foundations - continued
ITEC452 Distributed Computing Lecture 8 Distributed Snapshot
Distributed Snapshot.
Chap 5 Distributed Coordination
CSE 486/586 Distributed Systems Global States
CIS825 Lecture 5 1.
Consistent cut If this is not true, then the cut is inconsistent
Slides for Chapter 14: Time and Global States
Chandy-Lamport Example
Distributed Snapshot.
Presentation transcript:

Jenhui Chen Office number: 5990 http://www.csie.cgu.edu.tw/jhchen Time and Global State Jenhui Chen Office number: 5990 http://www.csie.cgu.edu.tw/jhchen

Introduction Time is a quantity we often want to measure accurately. Algorithms that depend upon clock synchronization have been developed for several problems in distribution. Dr. Jenhui Chen

Skew between computer clocks in a distributed system Dr. Jenhui Chen

Clock synchronization using a time server p Time server,S Dr. Jenhui Chen

An example synchronization subnet in an NTP implementation 1 2 3 Note: Arrows denote synchronization control, numbers denote strata. Dr. Jenhui Chen

Figure 10.4 Messages exchanged between a pair of NTP peers -2 - 3 Server B Server A Time m m' Dr. Jenhui Chen

Figure 10.5 Events occurring at three processes Dr. Jenhui Chen

Figure 10.6 Lamport timestamps for the events shown in Figure 10.5 Dr. Jenhui Chen

Figure 10.7 Vector timestamps for the events shown in Figure 10.5 Dr. Jenhui Chen

Figure 10.8 Detecting global properties Dr. Jenhui Chen

Figure 10.9 Cuts Dr. Jenhui Chen

Figure 10.10 Chandy and Lamport’s ‘snapshot’ algorithm Marker receiving rule for process pi On pi’s receipt of a marker message over channel c: if (pi has not yet recorded its state) it records its process state now; records the state of c as the empty set; turns on recording of messages arriving over other incoming channels; else pi records the state of c as the set of messages it has received over c since it saved its state. end if Marker sending rule for process pi After pi has recorded its state, for each outgoing channel c: pi sends one marker message over c (before it sends any other message over c). Dr. Jenhui Chen

Figure 10.11 Two processes and their initial states Dr. Jenhui Chen

Figure 10.12 The execution of the processes in Figure 10.11 Dr. Jenhui Chen

Figure 10.13 Reachability between states in the snapshot algorithm Dr. Jenhui Chen

Figure 10.14 Vector timestamps and variable values for the execution of Figure 10.9 Dr. Jenhui Chen

Figure 10.15 The lattice of global states for the execution of Figure 10.14 Dr. Jenhui Chen

Figure 10.16 Algorithms to evaluate possibly f and definitely f Dr. Jenhui Chen

Figure 10.17 Evaluating definitely f Dr. Jenhui Chen