Scribd Logo
Upload

Welcome to Scribd!

  • 232 views

    Slides For Chapter 14: Time and Global States: Distributed Systems: Concepts and Design

    Uploaded by

    Muhammad Farooq

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Slides For Chapter 14: Time and Global States: Distributed Systems: Concepts and Design

    Uploaded by

    Muhammad Farooq
    232 views18 pages

    Original Title

    Chapter 14 slides.ppt

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    232 views18 pages

    Slides For Chapter 14: Time and Global States: Distributed Systems: Concepts and Design

    Uploaded by

    Muhammad Farooq

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 18

    Slides for Chapter 14:

    Time and Global States

    From Coulouris, Dollimore, Kindberg and


    Blair
    Distributed Systems:
    Concepts and Design
    Edition 5, Addison-Wesley 2012
    Figure 14.1
    Skew between computer clocks in a distributed system

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.2
    Clock synchronization using a time server

    mr

    mt
    p Time server,S

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.3
    An example synchronization subnet in an NTP implementation

    2 2

    3 3 3

    Note: Arrows denote synchronization control, numbers denote


    strata.

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.4
    Messages exchanged between a pair of NTP peers

    Server B Ti-2 Ti-1


    Time

    m m'

    Time
    Server A Ti- 3 Ti

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.5
    Events occurring at three processes

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.6
    Lamport timestamps for the events shown in Figure 14.5

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.7
    Vector timestamps for the events shown in Figure 14.5

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.8
    Detecting global properties

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.9
    Cuts

    0 1 2 3
    e1 e1 e1 e1
    p1

    m1 m2

    Physical
    p2
    0 1 2 time
    e2 e2 e2

    Inconsistent cut
    Consistent cut

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.10
    Chandy and Lamports snapshot algorithm

    Marker receiving rule for process pi


    On pis 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).

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.11
    Two processes and their initial states

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.12
    The execution of the processes in Figure 14.11

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.13
    Reachability between states in the snapshot algorithm

    actual execution e0,e1,...

    Sinit recording recording Sfinal


    begins '
    ends

    Ssnap
    pre-snap: e'0,e 1' ,...e' R-1 post-snap: e R' ,e R+1
    ' ,...

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.14
    Vector timestamps and variable values for the execution of Figure 14.9

    (1,0) (2,0) (3,0) (4,3)


    x1= 1 x1= 100 x1= 105 x1= 90
    p1

    m1 m2

    Physical
    p2
    time
    x2= 100 x2= 95 x2= 90
    (2,1) (2,2) (2,3)
    Cut C 2
    Cut C1

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.15
    The lattice of global states for the execution of Figure 14.14

    Level 0 S00

    1 S10

    2 S20 Sij = global state after i events at process 1


    and j events at process 2
    3 S30 S21

    4 S31 S22

    5 S32 S23

    6 S33

    7 S43

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.16
    Algorithms to evaluate possibly and definitely

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012
    Figure 14.17
    Evaluating definitely

    Instructors Guide for Coulouris, Dollimore, Kindberg and Blair, Distributed Systems: Concepts and Design Edn. 5
    Pearson Education 2012

    You might also like