From 03c186157e399b414b35f51e7ef1685e079d6355 Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Wed, 19 Mar 2025 22:01:46 +0100 Subject: [PATCH] vault backup: 2025-03-19 22:01:46 --- Concurrent Systems/notes/2b - Round Robin algorithm.md | 1 + 1 file changed, 1 insertion(+) diff --git a/Concurrent Systems/notes/2b - Round Robin algorithm.md b/Concurrent Systems/notes/2b - Round Robin algorithm.md index 38549ea..8205afb 100644 --- a/Concurrent Systems/notes/2b - Round Robin algorithm.md +++ b/Concurrent Systems/notes/2b - Round Robin algorithm.md @@ -24,6 +24,7 @@ Since DLF is deadlock free, it is sufficient to prove that at least one process If TURN = k and $p_k$ invoked lock, then it finds TURN = k and exits its wait. Otherwise, any other process will find `FLAG[TURN] = down` and exits from its wait. +###### Is it bounded bypass? **Lemma 1:** if TURN = i and `FLAG[i] = up` then $p_i$ enters the CS in at most n-1 iterations Observation 1: TURN changes only when FLAG[i] is down (after pi has completed its CS)