marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-03-03 09:27:47

Browse source
This commit is contained in:
Marco Realacci 2025-03-03 09:27:47 +01:00
parent 1ff3d80f5e
commit 6c75cd86c1
1 changed files with 1 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
Concurrent Systems/notes/Lezione1.md
View file

@ -93,5 +93,6 @@ So safety is necessary for correctness, liveness for meaningfulness.
- **Starvation freedom:** every invocation of lock eventually grants access to the associated C.S. - **Starvation freedom:** every invocation of lock eventually grants access to the associated C.S.
- **Bounded bypass:** let $n$ be the number of processes; then, there exists $f: N \to N$ s.t. every lock enters the C.S. after at most $f(n)$ other C.S.s (The process must win in at most f(n) steps). - **Bounded bypass:** let $n$ be the number of processes; then, there exists $f: N \to N$ s.t. every lock enters the C.S. after at most $f(n)$ other C.S.s (The process must win in at most f(n) steps).
todo: riscrivere meglio l'ultimo