Lecture Distributed Systems - Lecture 5: Logical Clocks and Causal
Số trang: 26
Loại file: pdf
Dung lượng: 226.38 KB
Lượt xem: 16
Lượt tải: 0
Xem trước 3 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Lecture Distributed Systems - Lecture 5: Logical Clocks. In this chapter, students will be able to understand: Why do we need global clocks? ordering of events, causally related versus concurrent, lamport’s logical clock, how lamport’s clocks advance, points to note, limitation of lamport’s clock, solution: vector clocks, partial order between timestamps, causal ordering, use of vector clocks in causal ordering of messages, birman-schiper-stephenson protocol, problem of vector clock, global state collection, notations, chandy-lamport’s algorithm, notable points, huang’s algorithm, weight distribution and recovery.
Nội dung trích xuất từ tài liệu:
Lecture Distributed Systems - Lecture 5: Logical Clocks and Causal
Nội dung trích xuất từ tài liệu:
Lecture Distributed Systems - Lecture 5: Logical Clocks and Causal
Tìm kiếm theo từ khóa liên quan:
Distributed Systems Lecture Distributed Systems Logical Clocks Chandy-Lamport’s Algorithm Notable Points Termination DetectionTài liệu liên quan:
-
Lecture Distributed systems (3/E) - Chapter 3: Processes
62 trang 211 0 0 -
Lecture Distributed systems (3/E) - Chapter 6: Coordination
71 trang 34 0 0 -
distributed systems - concepts and design (5th edition): part 1
480 trang 34 0 0 -
Lecture Distributed Systems - Lecture 11: Commit Protocols
14 trang 32 0 0 -
Operating System Concepts - Appendix A: UnixBSD
64 trang 31 0 0 -
Lecture Distributed Systems - Lecture 9: Distributed Deadlock Detection
14 trang 29 0 0 -
Lecture Distributed systems (3/E) - Chapter 2: Architectures
40 trang 28 0 0 -
Operating System Concepts - Chapter 9: Virtual Memory
70 trang 28 0 0 -
Lecture Distributed Systems - Lecture 1: Introduction
10 trang 28 0 0 -
Lecture Distributed Systems - Lecture 3: Routing Algorithms
15 trang 26 0 0