The Paxos Algorithm | Rachid Guerraoui

Поделиться
HTML-код
  • Опубликовано: 21 дек 2024

Комментарии • 20

  • @bharat261989
    @bharat261989 5 лет назад +2

    awesome lecture, a lot of information condensed in just 30 odd mintues... truly grateful to the author

  • @davidghaddad
    @davidghaddad 8 лет назад +3

    You are a great teacher. Explained extremely clearly. Thank You.

  • @jiaguo7098
    @jiaguo7098 9 лет назад +2

    Great lecture. Thank you. The witness and round concept makes things much easier to understand.

  • @jasonyang3367
    @jasonyang3367 4 года назад +1

    good lecture, clear and detailed.

  • @SUBRAT914
    @SUBRAT914 7 лет назад

    you have put up a nice foundation. I shall take it up forward and understand more. Thanks

  • @junxiongshao1771
    @junxiongshao1771 9 лет назад +2

    One lecture to rule all the others, thanks.

  • @buildlackey
    @buildlackey 10 лет назад +9

    my probability is not so great, but i think that at 2:27 there might be an error. The speaker says that if you add another server (S-2) then the probability of failure is divided by 2. But based on my (non-expert) calculations, I think the probability of failure is reduced by more than half. Please let me know if my reasoning is flawed.. here it is: Let's say the cluster has one node, and the the probability of that node going down is .25. Now we add another node, and for the sake of argument lets say that the failure of one node happens completely independent of the other (admittedly, not a perfect assumption since they may share power supplies, since both will be wiped out if a mega-asteroid hits earth, etc.) Now with two nodes (failing independently), the probability of cluster failure is the probability of these 2 independent events occurring at once (within some time window). Thus P(cluster failure) = P(node1 fails) * P(node 2 fails) = .25 * .25 = .0625. .0625 is significantly less than .25/2. (.125) Right ? If wrong, apologies in advance ! -chris

    • @smbrown
      @smbrown 7 лет назад

      agreed, the probability of both servers failing is the product of each individual server failure probability

  • @arunrajan6136
    @arunrajan6136 8 лет назад +1

    Thank you very much for the informative lecture.

  • @sbkpilot1
    @sbkpilot1 2 года назад +1

    same as Raft which is used by etcd and Kafka 3

  • @akkineni1947
    @akkineni1947 8 лет назад

    One of the better explanation of paxos.

  • @kloudja
    @kloudja 9 лет назад +1

    Really excellent and clear explanation. Take my like and my subscription

  • @my_fitness7075
    @my_fitness7075 9 лет назад

    Excellent explanation! Thanks!

  • @ProgressiveVeteran
    @ProgressiveVeteran 9 лет назад

    Very clear explanation!

  • @botelhorui
    @botelhorui 9 лет назад

    thanks you, 30 minutes explains the same as 3 hours of reading with the same pratical information.

  • @medcheikh3672
    @medcheikh3672 10 лет назад

    We can us Paxos BF to resolve the problem of intrusion detection (IDS) !?

  • @Massimus888
    @Massimus888 8 лет назад

    Excellent!

  • @jeancassou-mounat9011
    @jeancassou-mounat9011 8 лет назад +1

    En quoi un système distribué de type paxos montre-t-est elle une incohérence du système financier mondial?

  • @AbhiroopSarkar
    @AbhiroopSarkar 7 лет назад

    This is very similar to the Chandra-Toueg consensus algorithm. en.wikipedia.org/wiki/Chandra%E2%80%93Toueg_consensus_algorithm

  • @cybernessful
    @cybernessful 5 месяцев назад

    Horrible.