Transcription of Chapter 3: Logical Time
{{id}} {{{paragraph}}}
Chapter 3: Logical TimeAjay Kshemkalyani and Mukesh SinghalDistributed Computing: Principles, Algorithms, and SystemsCambridge University PressA. Kshemkalyani and M. Singhal (Distributed Computing) Logical TimeCUP 20081 / 67 Distributed Computing: Principles, Algorithms, and SystemsIntroductionThe concept of causality between events is fundamental to the design andanalysis of parallel and distributed computing and operating causality is tracked using physical distributed systems, it is not possible to have a global physical asynchronous distributed computations make progress inspurts, thelogical time is sufficient to capture the fundamental monotonicity propertyassociated with causality in distributed Kshemkalyani and M.
A tie-breaking mechanism is needed to order such events. A tie is broken as follows: Process identifiers are linearly ordered and tie among events with identical scalar timestamp is broken on the basis of their process identifiers. The lower the …
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}