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

This commit is contained in:
Marco Realacci 2025-03-03 09:32:47 +01:00
parent 6c75cd86c1
commit a3df39231a
3 changed files with 9 additions and 3 deletions

View file

@ -36,9 +36,9 @@
"type": "pdf", "type": "pdf",
"state": { "state": {
"file": "Concurrent Systems/slides/class 1.pdf", "file": "Concurrent Systems/slides/class 1.pdf",
"page": 4, "page": 7,
"left": -22, "left": -22,
"top": 51, "top": 1,
"zoom": 0.7036817102137768 "zoom": 0.7036817102137768
}, },
"icon": "lucide-file-text", "icon": "lucide-file-text",
@ -220,6 +220,7 @@
}, },
"active": "bfdcb298848e6147", "active": "bfdcb298848e6147",
"lastOpenFiles": [ "lastOpenFiles": [
"Pasted image 20250303093116.png",
"Concurrent Systems/notes/images", "Concurrent Systems/notes/images",
"Concurrent Systems/notes/images/Pasted image 20250303090135.png", "Concurrent Systems/notes/images/Pasted image 20250303090135.png",
"Concurrent Systems/slides/class 1.pdf", "Concurrent Systems/slides/class 1.pdf",
@ -248,7 +249,6 @@
"Biometric Systems/slides/LEZIONE12_MULBIOMETRIC.pdf", "Biometric Systems/slides/LEZIONE12_MULBIOMETRIC.pdf",
"Biometric Systems/notes/13. Multi biometric.md", "Biometric Systems/notes/13. Multi biometric.md",
"Biometric Systems/notes/4. Face detection.md", "Biometric Systems/notes/4. Face detection.md",
"Biometric Systems/slides/Schema Biometric Systems_annotated.pdf",
"Biometric Systems/frequently asked questions/BS_oral_questions_16022021.md", "Biometric Systems/frequently asked questions/BS_oral_questions_16022021.md",
"Biometric Systems/notes/12. Iris recognition.md", "Biometric Systems/notes/12. Iris recognition.md",
"Biometric Systems/notes/11. Fingerprints.md", "Biometric Systems/notes/11. Fingerprints.md",

View file

@ -96,3 +96,9 @@ So safety is necessary for correctness, liveness for meaningfulness.
todo: riscrivere meglio l'ultimo todo: riscrivere meglio l'ultimo
Both inclusions are strict:
Deadlock freedom $\not{\implies}$ Starvation freedom
![[Pasted image 20250303093116.png]]
Starvation freedom $not \implies$ Bounded bypass
Assume a $f$ and consider the scheduling above, where p2 wins $f(3)$ times and so does p3

Binary file not shown.

After

Width:  |  Height:  |  Size: 56 KiB