From 9b6cc48c08ed7c6d1b8be172a9e44910b2ede4cd Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 25 Mar 2025 16:57:22 +0100 Subject: [PATCH] vault backup: 2025-03-25 16:57:22 --- Concurrent Systems/notes/8 - Enhancing Liveness Properties.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md index d432701..78ebb00 100644 --- a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md +++ b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md @@ -71,11 +71,11 @@ IDEA: - this changes in time, but not forever (can be proved, but it's not covered here) Guessing the time duration for suspecting a process: -- `SUSPECT[i,j]` = # of times pi has suspected pj +- `SUSPECT[i,j]` = # of times $p_i$ has suspected $p_j$ - 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}$ +- Sum them, to obtain $S_{k}$ (for each process k) - The interval to use in the timers is the minimum $S_{k}$ - it can be proved that this eventually becomes ≥ $\nabla$