Bully algorithm: Difference between revisions

Content deleted Content added
No edit summary
No edit summary
Line 11:
==Assumptions==
 
As this algorithm is part from a distributed system model wich tries to make it fail-free (like the solution shown in[1]), we need some assumptions as the whole point of the model is to make a distributed system, free from arbitrary failures (not from processing ones) while saving some computational costs.
 
* The system is synchronous and uses timeout for identifying process failure. (so you can have Delta and Cmax in order to calculate timeout as opposed to asynchronous systems where you can't calculate a timeout and then you can't distinguise between an omision fail on a process or a delay)