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

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

Browse source
This commit is contained in:
Marco Realacci 2025-03-03 09:22:47 +01:00
parent 38bc756787
commit 1ff3d80f5e
1 changed files with 5 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Concurrent Systems/notes/Lezione1.md
View file

@ -90,4 +90,8 @@ So safety is necessary for correctness, liveness for meaningfulness.
- **Safety:** there is at most one process at a time in a C.S.
- **Liveness:**
- **Deadlock freedom:** if there is at least one invocation of lock, eventually after at least one process enters a C.S.
- **Starvation freedom:** every invocation of lock eve
- **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).