From 2532a362f8f8df811c309ba515ac7ab214c2a18b Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 25 Mar 2025 16:52:22 +0100 Subject: [PATCH] vault backup: 2025-03-25 16:52:22 --- Concurrent Systems/notes/8 - Enhancing Liveness Properties.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md index 20ac61d..d432701 100644 --- a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md +++ b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md @@ -73,6 +73,8 @@ IDEA: Guessing the time duration for suspecting a process: - `SUSPECT[i,j]` = # of times pi has suspected pj - For all k, take the t+1 minimum values in `SUSPECT[1..n , k]` + - remember: t is the max number of processes that can fail (it is known) + - so doing this we ensure considering at least a process that doesn't fail - Sum them, to obtain $S_{k}$ - The interval to use in the timers is the minimum $S_{k}$ - it can be proved that this eventually becomes ≥ $\nabla$