Dijkstra's Stabilizing Token Telephone Algorithm
One of the classical algorithms I instruct inwards my distributed systems course of written report is Dijkstra's stabilizing token telephone algorithm. This algorithm has started the self-stabilization field equally a subfield of fault-tolerance. And, it nevertheless receives involvement fifty-fifty after forty years. There has been belike hundreds of self-stabilization papers that revisits Dijkstra's stabilizing token telephone algorithm equally business office of a solution or equally business office of a illustration study. This algorithm never gets onetime for me equally well. I nevertheless taste talking close this algorithm inwards course of written report too thinking close it 1 time inwards a while. I estimate this is because it is a really elegant algorithm.
Linked is Dijkstra's master newspaper introducing the algorithm. This newspaper besides includes 2 variants of the stabilizing token telephone algorithm, 3-state too 4-state token telephone algorithms. Dijkstra would subsequently create a followup writeup, titled, "A belated proof of self-stabilization", where he gave a proof of stabilization for 3-state token telephone program.
As a side note, when I asked my distributed course of written report whether they heard Dijkstra's lift before, almost all hands went up. And almost all of them had heard his lift due to the "all pairs shortest path algorithm". Interesting. Probably, inwards Dijkstra's mind, that algorithm was a nipper contribution. Crash entirely software
The purpose of distributed state
Linked is Dijkstra's master newspaper introducing the algorithm. This newspaper besides includes 2 variants of the stabilizing token telephone algorithm, 3-state too 4-state token telephone algorithms. Dijkstra would subsequently create a followup writeup, titled, "A belated proof of self-stabilization", where he gave a proof of stabilization for 3-state token telephone program.
As a side note, when I asked my distributed course of written report whether they heard Dijkstra's lift before, almost all hands went up. And almost all of them had heard his lift due to the "all pairs shortest path algorithm". Interesting. Probably, inwards Dijkstra's mind, that algorithm was a nipper contribution. Crash entirely software
The purpose of distributed state
0 Response to "Dijkstra's Stabilizing Token Telephone Algorithm"
Post a Comment