Some Sample Distributed Systems Problems And Algorithms
1 316
39.9
Microsoft Research331 тыс
Следующее
12.08.16 – 8131:02:19Популярные
129 дней – 8501:02:50
216 дней – 9485:33Опубликовано 12 августа 2016, 1:02
In this talk I will introduce some traditional problems in distributed systems and describe simple algorithms to solve them. The focus will mostly be on asynchronous messaging passing algorithms, however we will look at some asynchronous shared memory and synchronous message passing algorithms as well. The first half of the talk will introduce problems that arise due to the asynchronous nature of distributed systems. We will look at 3 major topics in this section; (1) time and event ordering, (2) mutual exclusion, (3) global consistent snapshots. The second half we will look at additional problems that arise due to failure of components. Once again we will look at 3 major topics (1) consensus, (2) leader election, (3) fault tolerance via replication.
Свежие видео
5 дней – 113 6040:42
9 дней – 2 086 0480:39
15 дней – 72532:29
16 дней – 20 15625:29
19 дней – 104 84823:00
Случайные видео
149 дней – 3087:47
10.10.23 – 68 6231:37
05.03.23 – 54 1670:42
09.08.22 – 17134:19
24.06.21 – 1 20537:07
10.01.18 – 14 0321:12
2 дня – 65 39810:36
4 дня – 2946:20
5 дней – 43 1020:30
5 дней – 6 8712:46
5 дней – 3920:55
11 дней – 2368:04
