Distributed Systems 3.3: Causality and happens-before

  Рет қаралды 41,544

Martin Kleppmann

Martin Kleppmann

Күн бұрын

Пікірлер: 37
@JosiahWarren
@JosiahWarren Жыл бұрын
this was a god sent gem . I just binge watched your playlist
@sociocritical
@sociocritical 4 жыл бұрын
These lectures are great. Thank you very much.
@_sudipidus_
@_sudipidus_ 3 ай бұрын
11:10 wow that's the ultimate definition of concurrency right there
@slowmotion2300
@slowmotion2300 3 ай бұрын
Thank you for this amazing free series, you are the best.
@mostinho7
@mostinho7 Жыл бұрын
3:00 why timestamps for event ordering might not always be reliable 5:00 happens before relationship between events A happens before B if 1. A happens before B on the same node 2. A is the event that a message was sent and B is event that message was received on a different node 3. Transitive property: There exists event C such that A happens before C and C happens before B then A happens before B 8:10 what it means for events to be concurrent (can’t define a happens before relation between them, no partial order)
@ihsannuruliman4005
@ihsannuruliman4005 11 ай бұрын
The book is great but this video series explained 2x more clearly and I can resonate easily... maybe it's just because of the content type. Visual is still better to me.
@junlonggao1872
@junlonggao1872 3 жыл бұрын
Still cannot believe we can study these for free
@jordy4630
@jordy4630 2 жыл бұрын
It's a shame information isn't accessible to everyone. Just imagine if everyone had access to all other lectures.
@guwenbin1
@guwenbin1 2 жыл бұрын
同意
@correabuscar
@correabuscar 2 жыл бұрын
11:11 that's great to know before reading Leslie Lamport's Time Clocks...
@mehdicharife2335
@mehdicharife2335 Жыл бұрын
So, if my understanding was correct, if an event happened after another by a period of time that is smaller than the time it takes for light to travel between the two locations wherein the two events happened, we can safely infer that the first event did not cause nor influenced the second?
@nikolay6700
@nikolay6700 4 жыл бұрын
Спасибо. Отличная лекция!
@Visualmotionpro
@Visualmotionpro 2 жыл бұрын
You are a hero! Thank you a lot for your awesome lectures!
@caseyyeow1649
@caseyyeow1649 2 жыл бұрын
Your lectures are very enlightening, tqvm.
@violahnnn
@violahnnn 2 жыл бұрын
These lectures are great😃
@andy_801
@andy_801 2 жыл бұрын
great series! clear n informative
@alirezarohami6138
@alirezarohami6138 2 жыл бұрын
Thank you, Matrin. You're just awesome. (But since you mentioned relativity... I was waiting for the rabbit, i.e. entanglement)
@tiwaritejaswo
@tiwaritejaswo Жыл бұрын
Too good
@ShubhamGuptaAmol
@ShubhamGuptaAmol 6 ай бұрын
If we assume that clocks for user A and B have been synchronized via NTP, how can there be any skew/time difference b/w them?
@fb-gu2er
@fb-gu2er 3 жыл бұрын
Great lectures. I'm reading the book, "Designing Data-Intensive Applications". How much of a relation is there between these lectures and the book?
@guitarist_covers
@guitarist_covers 3 жыл бұрын
The book goes more in-depth. I'd go through the videos first, and then check the book later.
@kleppmann
@kleppmann 3 жыл бұрын
There is a small amount of overlap. The book is mostly about databases, and only covers a bit on distributed systems. This course goes deeper on distributed systems (especially on algorithms), but doesn't really go into databases.
@MrAR7
@MrAR7 3 жыл бұрын
@@kleppmann which can be the reference book that matches close to the course?
@khaldrogo9451
@khaldrogo9451 2 жыл бұрын
@@MrAR7 He mentioned that in the very beginning. There are a few books to choose from.
@tangkhanhnguyen4543
@tangkhanhnguyen4543 2 жыл бұрын
Why do we use monotonic clock timestamps to compare 2 times cross difference nodes and we can ensure that t2 is greater than t1? Please correct me if I'm wrong. Thanks for the nice lecture
@jordy4630
@jordy4630 2 жыл бұрын
Monotonic is not a replacement for atomic clock. It is only useful in one node for measuring duration and solves the problem of clock synchronisation. Between different nodes you still have the problem. You don't know the clock skew that each node has or when was the last time that they did clock synchronisation (even knowing that doesn't help). Watch the clock synchronisation video.
@khaldrogo9451
@khaldrogo9451 2 жыл бұрын
1. What is this symbol called? 2. If a -> b, then we can't always say that 100% a (weird symbol) b right? or is that a wrong assumption to make. Essentially, is the weird symbol always 100% implying causality or is it it implying a maybe causality?
@slowmotion2300
@slowmotion2300 3 ай бұрын
Precedes symbol. The symbol doesn't necessarily tell us about the causality, it's used to represent order of events.
@AlejandroDruetta
@AlejandroDruetta 3 жыл бұрын
I have a doubt. At the end of the lecture, the logic conditional should not be: if a causes b, then does a happens before b?
@khaldrogo9451
@khaldrogo9451 2 жыл бұрын
It must be the case. If a causes b, then it must be that a happened before b. Think of it this way, if a message is received (b) by a node, it must be that the message was created (a) before it had to be received (b). Otherwise, there would be nothing to receive in case if it was never created.
@humanvegetable
@humanvegetable 3 ай бұрын
Oh no it isn't!
@aazimakhtar7884
@aazimakhtar7884 3 ай бұрын
The moon is made of cheese!
@bobblah78
@bobblah78 3 жыл бұрын
The moon is made of cheese!
@techhackz2897
@techhackz2897 2 жыл бұрын
no it is not!
@khaldrogo9451
@khaldrogo9451 2 жыл бұрын
@@techhackz2897 yes it is, and I have proof!
@techhackz2897
@techhackz2897 2 жыл бұрын
@@khaldrogo9451 prove it
Distributed Systems 4.1: Logical time
24:02
Martin Kleppmann
Рет қаралды 82 М.
Distributed Systems 4.2: Broadcast ordering
16:19
Martin Kleppmann
Рет қаралды 51 М.
Players push long pins through a cardboard box attempting to pop the balloon!
00:31
Миллионер | 3 - серия
36:09
Million Show
Рет қаралды 2,1 МЛН
Молодой боец приземлил легенду!
01:02
МИНУС БАЛЛ
Рет қаралды 2 МЛН
L17: Consistency Models in Distributed Systems
18:58
Distributed Systems Course
Рет қаралды 30 М.
Distributed Systems 7.2: Linearizability
18:44
Martin Kleppmann
Рет қаралды 37 М.
Distributed Systems 5.1: Replication
25:21
Martin Kleppmann
Рет қаралды 45 М.
Distributed Systems 7.1: Two-phase commit
18:45
Martin Kleppmann
Рет қаралды 65 М.
Distributed Systems 6.1: Consensus
18:15
Martin Kleppmann
Рет қаралды 38 М.
programming ≠ coding - Leslie Lamport
1:15:46
Stanford Math
Рет қаралды 33 М.
Ordering of Events: Logical Time and Logical Clock, Happened-Before Relationship, Causality
12:50
Dr Nitin Naik - Aston University, UK
Рет қаралды 12 М.
Distributed Systems 1.3: RPC (Remote Procedure Call)
19:45
Martin Kleppmann
Рет қаралды 104 М.