top of page

Tutorial 6

  • Writer: Michael Cheng
    Michael Cheng
  • Mar 30, 2021
  • 1 min read

1. How Byzantine General’s algorithm is able to be applied to achieve an agreement with at least three ranks, where number of processes, n = 7 and number of faulty processes, m = 2 (include any diagram for elaboration as needed).


2. What is leader election algorithm and why do we need this algorithm?


Recent Posts

See All
Tutorial 10

Case study on a particular state-of-the-art distributed computing system. For example, IoT, Cloud Computing or Dockers Technology....

 
 
 
Tutorial 9

1. What is denial of service (DoS)? How DOS causes vandalism in distributed environment? 2. What is Botnet and Permanent Denial of...

 
 
 
Tutorial 8

1. What are those requirements of name spaces which could be applied in a distributed system? 2. Illustrate 2 different methods adopted...

 
 
 

Comentarios


bottom of page