可靠的分布式算法(一)+瑞典皇家理工学院+无字幕

1954
3
2018-08-28 19:07:50
6
3
55
10
https://www.edx.org/course/reliable-distributed-algorithms-part-1-kthx-id2203-1x-0
视频选集
(67/79)
KTH distributed algorithm trailer
04:02
0 Content
03:26
1.0 Introduction
01:50
1.1 Intro-new
06:10
1.2.core-problems
16:25
1.3 Models.new
12:04
1.4 Not Covered
05:31
2.0 Introduction to input-output automata
01:43
2.1 Models 1
04:04
2.2 Input Output automata
13:40
2.3 Example
16:37
2.4 Executions
08:23
2.5 Operations of IO automata
14:15
2.6 Distributed system example
09:47
2.7 composition results
10:28
2.8 Fairness
09:37
2.9 Trace properties
12:39
3.1 Basic abstractions
03:35
3.2 Event based Component Model
11:00
3.3 Specification of Distributed Services
13:50
3.4 Safety liveness
17:04
3.5 Process failures
06:39
3.6 fault tolerance hierarchy
03:54
3.7 Channel behavior
02:38
3.8 Fair Loss Links
04:05
3.9 Stubborn links
12:50
3b.1 Asynchronous systems
18:10
3b.2 Synchrony and partial synchrony
05:18
3b.3 Lamport clocks
11:51
3b.4 vector clocks
17:11
4.0 Introduction
02:17
4.1 Falure detectors
13:26
4.2 Failure detector classes
02:43
4.3 Perfect failure dector P
06:24
4.4 Eventully perfect failure detector
04:28
4.5 Leader election
07:37
4.6 Implementation of le
04:11
4.7 Eventual leader election
07:27
4.8 Reductions
10:25
4.9 FD related
13:37
5.0 Introduction
01:59
5.1 Designing algorithms
05:20
5.2 Quorums
05:23
5.3 Broadcast abstractions
05:11
5.4 Specifications
14:31
5.5 Model vs reality
01:29
5.6 Fail stop lazy reliable broadcast
13:39
5.7 Performance
08:56
5.8 Fail silent eager reliable broadcast
06:16
5.9 Eager Uniform broadcast
14:05
5.10 Fail silent uniform broadcast
05:51
6.0 Introduction
01:54
6.1 Causal order
12:01
6.2 specification
07:21
6.3 No wait causal algorithm
14:56
6.4 Efficient no wait algorithm
06:44
6.5 vector clock algorithm
11:26
6.6 correctness of vector clock algorithm
06:54
6.7 broadcast orderings
09:13
7.0 Introduction
02:37
7.1 distributed shared momory
08:21
7.2 Executions
10:21
7.3 Regular registers
15:06
7.4 Majority voting regular register
14:57
7.5 Linearizability and sequential consistency
09:35
7.6 Examples
04:50
7.7 Compositionality of consistency conditions
12:27
7.8 Linearizable registers algorithms
06:21
7.9 1 N linearizble algorithm
09:32
7.10 N N linearizable algorithm
07:16
7.11 Proof of Linearizability
16:20
7.12 Sequentailly consistent algorithm
10:34
7.13 Proof Sequential consistency
11:06
8.0 Introduction
02:40
8.1 Concensus
03:52
8.3 Implementation and correctness
07:14
8.4 Uniform consensus
08:14
8.5 Weaker failure detectors
03:43
8.6 Tolerance of eventuality (partitioning argument)
09:16
客服
顶部
赛事库 课堂 2021拜年纪