In this blog post I’m going to describe a very simple distributed algorithm
that is useful in different programming scenarios.
The algorithm is useful when you need to take some kind of information
synchronized among a number of processes.
The information can be everything as long as it is composed of a small
number of bytes, and as long as it is idempotent, that is, the current value
of the information does not depend on the previous value, and we can just
replace an old value, with the new one.
While reading this post from Salvatore Sanfilippo all I was visualizing were the diagrams in James Micken’s “The saddest moment” paper.
Original title and link: A simple distributed algorithm for small idempotent information