Synchronization Using Failure Detectors
132
Microsoft Research334 тыс
Следующее
07.09.16 – 4511:05:07Популярные
41 день – 7274:30
22.12.22 – 1 41452:53Опубликовано 7 сентября 2016, 16:02
Many important synchronization problems in distributed computing are impossible to solve (in a fault-tolerant manner) in purely asynchronous systems, where message transmission delays or relative processor speeds are unbounded. It is then natural to seek for the minimal synchrony assumptions that are sufficient to solve a given synchronization problem. A convenient way to describe synchrony assumptions is using the failure detector abstraction. In this talk, I will present a few recent results on determining the weakest failure detectors for synchronization problems in distributed computing. The problems considered include solving fault-tolerant mutual exclusion, solving non-blocking atomic commit, and boosting the synchronization power of atomic objects
Свежие видео
4 дня – 3 012 4020:39
5 дней – 1 7891:30
6 дней – 6 10858:36
6 дней – 10 3540:10
7 дней – 1 052 40417:54
9 дней – 10 9592:06Случайные видео
73 дня – 12 5771:00
125 дней – 1 69619:48
157 дней – 71 5720:44
27.02.23 – 11 061 1100:57
19.05.20 – 5 356 35511:14
15.06.14 – 2 022 2195:20
2 дня – 2560:13
2 дня – 7220:33
3 дня – 326 8607:38
5 дней – 5991:23
7 дней – 9071:25
8 дней – 3326:22
1 день – 01:02:39