Synchronization Using Failure Detectors
132
Microsoft Research330 тыс
Следующее
07.09.16 – 4491:05:07Популярные
11.01.23 – 3 6371:22:54
12.12.22 – 68531:52Опубликовано 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
Свежие видео
7 дней – 1 774 03820:03
9 дней – 119 94114:59
10 дней – 411 9451:38
11 дней – 5827:37
11 дней – 1 0360:28Случайные видео
100 дней – 592 8502:28:22
13.05.23 – 95 90219:11
16.02.22 – 1 606 55819:29
09.07.21 – 1 1730:32
05.04.20 – 79 5281:20
05.07.14 – 147 95312:35
5 дней – 3691:32
5 дней – 82 7711:16
7 дней – 227 8329:13
17 дней – 447 46925:06
17 дней – 1 9710:12
18 дней – 116 4650:23
