Presentation is loading. Please wait.

Presentation is loading. Please wait.

Exercise 1: Write out the values of logical clocks p1p1 p1p1 p1p1.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Exercise 1: Write out the values of logical clocks p1p1 p1p1 p1p1."— Presentation transcript:

1 Exercise 1: Write out the values of logical clocks p1p1 p1p1 p1p1

2 Exercise 2: Write out the values of vector clocks p1p1 p2p2 p3p3 VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] = VC[1] = VC[2] = VC[3] =

3 Exercise 3: Is this Cut Consistent? If not, show the pairwise inconsistent events p1p1 p2p2 p3p3 VC[1] = 0 VC[2] = 0 VC[3] = 1 VC[1] = 1 VC[2] = 0 VC[3] = 0 VC[1] = 0 VC[2] = 1 VC[3] = 0 VC[1] = 2 VC[2] = 1 VC[3] = 0 VC[1] = 1 VC[2] = 0 VC[3] = 2 VC[1] = 1 VC[2] = 0 VC[3] = 3 VC[1] = 3 VC[2] = 1 VC[3] = 3 VC[1] = 1 VC[2] = 0 VC[3] = 4 VC[1] = 1 VC[2] = 2 VC[3] = 4 VC[1] = 4 VC[2] = 1 VC[3] = 3 VC[1] = 4 VC[2] = 3 VC[3] = 4 VC[1] = 1 VC[2] = 0 VC[3] = 5 VC[1] = 5 VC[2] = 1 VC[3] = 3 VC[1] = 5 VC[2] = 1 VC[3] = 6 VC[1] = 6 VC[2] = 1 VC[3] = 3

4 Exercise 4: Is this Cut Consistent? If not, show the pairwise inconsistent events p1p1 p2p2 p3p3 VC[1] = 0 VC[2] = 0 VC[3] = 1 VC[1] = 1 VC[2] = 0 VC[3] = 0 VC[1] = 0 VC[2] = 1 VC[3] = 0 VC[1] = 2 VC[2] = 1 VC[3] = 0 VC[1] = 1 VC[2] = 0 VC[3] = 2 VC[1] = 1 VC[2] = 0 VC[3] = 3 VC[1] = 3 VC[2] = 1 VC[3] = 3 VC[1] = 1 VC[2] = 0 VC[3] = 4 VC[1] = 1 VC[2] = 2 VC[3] = 4 VC[1] = 4 VC[2] = 1 VC[3] = 3 VC[1] = 4 VC[2] = 3 VC[3] = 4 VC[1] = 1 VC[2] = 0 VC[3] = 5 VC[1] = 5 VC[2] = 1 VC[3] = 3 VC[1] = 5 VC[2] = 1 VC[3] = 6 VC[1] = 6 VC[2] = 1 VC[3] = 3

Download ppt "Exercise 1: Write out the values of logical clocks p1p1 p1p1 p1p1."

Similar presentations

From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Slides for Chapter 14: Time and.

From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Slides for Chapter 14: Time and.
Last Class: Clock Synchronization

Last Class: Clock Synchronization
Streaming SIMD Extension (SSE)

Streaming SIMD Extension (SSE)
Virtual Time “Virtual Time and Global States of Distributed Systems” Friedmann Mattern, 1989 The Model: An asynchronous distributed system = a set of processes.

Virtual Time “Virtual Time and Global States of Distributed Systems” Friedmann Mattern, 1989 The Model: An asynchronous distributed system = a set of processes.
SES Algorithm SES: Schiper-Eggli-Sandoz Algorithm. No need for broadcast messages. Each process maintains a vector V_P of size N - 1, N the number of processes.

SES Algorithm SES: Schiper-Eggli-Sandoz Algorithm. No need for broadcast messages. Each process maintains a vector V_P of size N - 1, N the number of processes.
T h e G a s L a w s. T H E G A S L A W S z B o y l e ‘ s L a w z D a l t o n ‘ s L a w z C h a r l e s ‘ L a w z T h e C o m b i n e d G a s L a w z B.

T h e G a s L a w s. T H E G A S L A W S z B o y l e ‘ s L a w z D a l t o n ‘ s L a w z C h a r l e s ‘ L a w z T h e C o m b i n e d G a s L a w z B.
1 Causality. 2 The “happens before” relation happens before (causes)

1 Causality. 2 The “happens before” relation happens before (causes)
PART 12 Fuzzy Decision Making 1. Individual decision making 2. Multiperson decision making 3. Multicriteria decision making 4. Multistage decision making.

PART 12 Fuzzy Decision Making 1. Individual decision making 2. Multiperson decision making 3. Multicriteria decision making 4. Multistage decision making.
Distributed Systems Spring 2009

Distributed Systems Spring 2009
CMPT 431 Dr. Alexandra Fedorova Lecture VIII: Time And Global Clocks.

CMPT 431 Dr. Alexandra Fedorova Lecture VIII: Time And Global Clocks.
CPSC 668Set 12: Causality1 CPSC 668 Distributed Algorithms and Systems Fall 2009 Prof. Jennifer Welch.

CPSC 668Set 12: Causality1 CPSC 668 Distributed Algorithms and Systems Fall 2009 Prof. Jennifer Welch.
Exercise3.1 6. Exercise3.1 8 Exercise3.1 9 Exercise3.1 10.

Exercise Exercise3.1 8 Exercise3.1 9 Exercise
Exercise 1.1 4. Exercise 1.1 8 Exercise 1.2 6 Exercise 1.2 7.

Exercise Exercise Exercise Exercise
Exercise4.1 10. Exercise4.1 15 Exercise4.1 19 Exercise4.1 23.

Exercise Exercise Exercise Exercise
Exercise6.1 5. Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.

Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.
Logical Time and Logical Clocks

Logical Time and Logical Clocks
Ordering and Consistent Cuts Presented by Chi H. Ho.

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.

Computer Science Lecture 10, page 1 CS677: Distributed OS Last Class: Clock Synchronization Physical clocks Clock synchronization algorithms –Cristian’s.
Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms CS 249 Project Fall 2005 Wing Wong.

Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms CS 249 Project Fall 2005 Wing Wong.
Global Predicate Detection and Event Ordering. Our Problem To compute predicates over the state of a distributed application.

Global Predicate Detection and Event Ordering. Our Problem To compute predicates over the state of a distributed application.

Similar presentations

Ads by Google