Content deleted Content added
No edit summary |
No edit summary |
||
Line 13:
As this algorithm is part from a distributed system model wich tries to make it fail-free (like [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)
* Allows processes to crash during execution of algorithm. (To=2*Delta+Cmax so timer knows when omision fails happens)
* Message delivery between processes should be reliable.(Coordinator dilema,¿is it trustworthy; or suplantation,inyection,replication,DoS may happen?)
| |||