From 7e6858cd470220122c317d0096824d9696a8e193 Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 25 Mar 2025 16:42:22 +0100 Subject: [PATCH] vault backup: 2025-03-25 16:42:22 --- Concurrent Systems/notes/8 - Enhancing Liveness Properties.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md index 4cdb4b3..5e3a235 100644 --- a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md +++ b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md @@ -66,7 +66,7 @@ It can be proved that there exists no wait-free implementation of $\Omega$ in an IDEA: - `PROGRESS[1..n]` is an array of SWMR atomic registers used by proc’s to signal that they’re alive -- pi suspects pj if pi doesn’t see any progress of pj after a proper time interval (to be guessed) set in its timer +- $p_{i}$ suspects $p_j$ if pi doesn’t see any progress of $p_{j}$ after a proper time interval (to be guessed) set in its timer - the leader is the least suspected process, or the one with smallest/biggest ID among the least suspected ones (if there are more than one) - this changes in time, but not forever