vault backup: 2025-03-24 09:19:23

Concurrent Systems/notes/7- MUTEX-free concurrency.md

@@ -63,4 +63,11 @@ this implementation satisfies the three requirements for the splitter
 2. not all processes can obtain L
 	- let us consider the last process that writes into LAST (this is an atomic register, so this is meaningful)
 	- if the door is closed, it receives R and √
-3. let $p_i$ be the first process that receives S 
+3. let $p_i$ be the first process that receives $S \to LAST=i$ in its second if
+		![[Pasted image 20250324091452.png]]
+
+### An Obstruction-free Timestamp Generator
+A **timestamp generator** is a concurrent object that provides a single operation get_ts such that:
+1. (*validity*) not two invocations of get_ts return the same value
+2. (*consistency*) if one process terminates its invocation of get_ts before another one starts, the first receives a timestamp that is smaller than the one received by the second one
+3. (*obstruction freedom*) if run in isolation