1. Homepage
  2. Exam
  3. [2018] COMPSCI 711 Parallel and Distributed Computing - Byzantine Problem and EIG Algorithms

[2018] COMPSCI 711 Parallel and Distributed Computing - Byzantine Problem and EIG Algorithms

This question has been solved
Engage in a Conversation

Question 5 CourseNana.COM

(a) Demonstrate your understanding of the Byzantine problem by describing one scenario where the EIG algorithm fails to reach agreement for three nodes, N=3, with one failure, F=1, even if the EIG tree is expanded to two levels. CourseNana.COM


CourseNana.COM

(b) Which of the three correctness conditions (termination, agreement and validity) will be violated in this case and why? CourseNana.COM

Hint: Consider the case when process P1 is faulty, process P2 is non-faulty and starts with v2=1, process P3 is non-faulty and starts with v3=1 and the default (tie-breaking) value is v0=0. To support your arguments, you can use EIG diagrams such as the one given below. CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

CourseNana.COM

Get the Solution to This Question

WeChat WeChat
Whatsapp WhatsApp