Diapositivas
Notas
<aside> 💡 Election Algorithms
One process has to act as a coordinator. It doesn’t matter which process is
If the coordinator goes does, an election must be taken
We assume that every process knows the process number of every other process. What the process do not know is which one are currently up and which ones are currently down.
In general, the highest numbered process is the winner of the election.
The goal of the election algorithm is to ensure that when an election starts, it concludes with all processes agreeing on who the new coordinator is to be </aside>
Bully Algorithm
Ring Algorithm
Sockets en Rust
Cap 3: Distributed Operating Systems
https://drive.google.com/file/d/1yJBqxyS-7mez4mH7xjl66oP0uMfmnfQ-/view