Murat Buffalo's blog provides insights into computer science research, machine learning, and artificial intelligence. Readers can explore articles covering topics such as algorithm design, data mining, and computational biology. Additionally, they can learn about machine learning algorithms, deep learning techniques, and applications of AI in various domains.

Metadata

A creative analogy explains how distributed systems can coordinate without synchronized clocks by using causal relationships between events. The "sauna algorithm" demonstrates the happened-before relationship: by tracking when someone enters after you and leaving when they leave, you ensure a safe duration without measuring time. This mirrors how asynchronous distributed systems use logical clocks and causal ordering to maintain consistency. The approach highlights the importance of anchoring to events that occur after your entry point, avoiding stale state, though it introduces potential deadlock risks if universally adopted.

The Sauna Algorithm: Surviving Asynchrony Without a Clock

There is another potential problem: What if you go to the sauna at a less busy time and the next person after you doesn’t enter for 10 minutes or more?

this makes all sense , haven’t thought about sync by events order

And if the someone enters thinking the same as you

I guess you do operate on logical clocks. (This post interested me becuase I work with the PTP protocol)
What if there were another person (taking you as reference when you arrived), while you are in time dialation and no-one else is arriving, it would be a griding halt. I did consider this in one of the possible workarounds where a h/w system (in design) did not consider a reference clock but the requirement was to implement some metering algorithms (which would require some way to measure time and credits). Is this a common solution in the application/database systems?