Global State Recording n n n definitions global

Global State Recording n n n definitions global state recording u FIFO F Chandy-Lamport’s algorithm F collecting global state F incremental snapshot u non-FIFO F Lai-Yang two color algorithm F Mittern’s vector clocks algorithm consistent global snapshots u causality and zigzag paths u rollback dependency graph

Local State n n local state LSi of a site (process) Si is an assignment of values to variables of Si sending send(mij) and receiving rec(mij) of message mij from Si to Sj may influence LSi we denote u time(send(mij) or rec(mij)) the sequence number of the state in the compuation after which send/receive occurs (note the difference with Singhal) u time(LSi) the state at which Si was recorded to aid the reasoning we consider the messages sent/received by a process as belonging to local state we define that is • the message is in transit if it was sent but not received • the message is inconsistent if it was received but never sent

Global State n global state is a collection of local states of all processes and set of messages in the channels u notice Singhal does not use messages in his def. – ours is more precise global state is consistent if it does not have any inconsistent messages, that is: global state is transitless if there are no messages in transition, that is: note that a consistent state is not necessarily transitless and v. v. what are the global states on the picture above?

Chandy-Lamport’s Global State Recording Algorithm n n n works on arbitrary topology system with FIFO channels and arbitrary algorithm whose snapshot is taken (basic algorithm) does not interfere with the operation of basic algorithm (does not delay, reorder or drop basic messages) one process initiates recording by sending control messages (markers) multiple processes can also initiate • can C-L record an inconsistent state?

Global State Recorded by Chandy-Lamport’s Algorithm n • • does C-L record a (global) state that occurs in the computations? u not necessarily. u however, C-L records a state in a computation that is equivalent to the original computation. u moreover this equivalent computation shares with the original computation F a prefix up to start of snapshot F a suffix after the snapshot u the recorded state is between these two states can C-L record a state where some P have messages in every channel? if yes which one? can several independent snapshots run in parallel?

Collecting Global State n n n based on spanning tree constructed on the fly sender of the first marker to arrive at a process is its parent each marker carries the sender’s parent u by receiving marker process learns if it has children if process is a leaf, after finishing state recording, it sends its state to its parent each process waits for its children’s states, appends its own and forwards all info to its parent

Non-FIFO: Lai-Yang Algorithm n non-FIFO channel: is a set (rather than a queue) of messages, any message in the set can be received u messages can overtake one another u fair message receipt is assumed – eventually a sent message is received two colors for processes and basic messages – white and red, no explicit markers u all processes start as white, when process sends a basic message it attaches its color u when process receives a differently colored message, it itself changes color u while white (red), process records all messages sent/received, after changing colors, the process sends message history to the initiator; based on sent/received histories, initiator calculates messages in transit if only the number of messages in transit needed – may maintain counters in stead of histories

State Recording Using Causal Message Delivery n n n initiator broadcast token to all processes each process records state and sends it to the initiator u processes do not send markers or coordinate local state recording due to causal ordering of messages u n if for Pi: rec(tokeni) send(mij) then send(tokenj) send(mij) therefore rec(tokenj) rec(mij) hence state recording at Pj happens before mij receipt channel state recording (Archaya-Badrinath) u u u append sequence numbers to all messages, at each process record highest sent/received SN together with local state send sent/received records for initiator to determine messages in transition

Consistent Global Snapshot n n n processes periodically asynchronously record local states (local checkpoints) u a global snapshot is a collection of local checkpoints needed in distributed failure recovery, distributed event monitoring, debugging, etc. global snapshot is consistent if no two checkpoints are causally related even though checkpoints themselves are not causally related, they may not be a part of a global snapshot u ex: C 11 and C 32 are concurrent, yet there is no global snapshot that contains both of them the objective in global snapshot recording is to select (out of available) the set of concurrent checkpoints. u note that unlike global state recording, the alg. does not have control over the snapshot taking time

Zigzag Path n n checkpoint interval – part of computation between two successive checkpoints at the same process zigzag path exists between checkpoints Cxi and Cyj if there exists a sequence of messages m 1, …mn such that u m 1 sent by Px after Cxi u mk received by Pz, mk+1 is sent by Pz in the same checkpoint interval u mn received by Py before Cyj causal path - same as zigzag path but the messages are causally related zigzag cycle is a zigzag path to the process itself causal path zigzag path

Zigzag Path n n checkpoint interval – part of computation between two successive checkpoints at the same process zigzag path exists between checkpoints Cxi and Cyj if there exists a sequence of messages m 1, …mn such that u m 1 sent by Px after Cxi u mk received by Pz then mk+1 is sent by Pz in the same checkpoint interval u mn received by Py before Cyj causal path - same as zigzag path but the messages are causally related zigzag cycle is a zigzag path to the process itself zigzag cycle zigzag path

Sufficient Condition for Consistent Snapshot n n a consistent snapshot can be formed to include a set S of checkpoints if and only if no zigzag path exists between any two checkpoints in S [Netzer and Xu] u snapshot line – a line drawn through a set of checkpoints u due to the existence of a zigzag path, a snapshot line always crosses a message making two checkpoints causally related and resultant snapshot inconsistent constructing consistent snapshot requires choosing checkpoints without zigzag path

Runtime Consistent Snapshot Construction Using R-Graph n n n definition of rollbackdependency graph (R-graph) [Wang] basic message carries its checkpoint interval number example computation there is a zigzag path between two checkpoints if there is a path in R-graph corresponding R-graph