Click here to load reader

logical clocks in distributed systems

Embed Size (px)

DESCRIPTION

scalar clock,vector clock

Citation preview

Slide 1

Dr. Bibhudatta SahooCommunication & Computing GroupDepartment of CSE, NIT RourkelaEmail: [email protected], 9937324437, 2462358Moodle server : http://moodle.nitrkl.ac.in

Logical time[scalar time, vector time, and matrix time]Overview: Causality (or the causal precedence relation)2Causality (or the causal precedence relation) among events in a distributed system is a powerful concept in reasoning, analyzing, and drawing inferences about a computation.Causality is tracked using physical time.In distributed systems, it is not possible to have global physical time; it is possible to realize only an approximation of it. As asynchronous distributed computations make progress in spurts, it turns out that the logical time, which advances in jumps, is sufficient to capture the fundamental monotonicity property associated with causality in distributed systems. Types of Logical ClocksSystems of logical clocks differ in their representation of logical time and also in the protocol to update the logical clocks.3 kinds of logical clocksScalarVector Matrix3Logical clock4In a system of logical clocks, every process has a logical clock that is advanced using a set of rules. Every event is assigned a timestamp and the causality relation between events can be generally inferred from their timestamps.The timestamps assigned to events obey the fundamental monotonicity property; that is, if an event a causally affects an event b, then the timestamp of a is smaller than the timestamp of b.A framework for a system of logical clocks5A system of logical clocks consists of a time domain T and a logical clock C. Elements of T form a partially ordered set over a relation