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

vault backup: 2025-03-10 22:18:12

Browse source
This commit is contained in:
Marco Realacci 2025-03-10 22:18:12 +01:00
parent 97bb4e0469
commit a67c8416a2
2 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
.obsidian/workspace.json vendored
View file

@ -211,13 +211,13 @@
"active": "dd6c003f9d17b0e9",
"lastOpenFiles": [
"Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md",
"Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
"Concurrent Systems/notes/1 - CS Basics.md",
"Concurrent Systems/notes/2b - Round Robin algorithm.md",
"Concurrent Systems/notes/2 - Fast mutex by Lamport.md",
"Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
"Concurrent Systems/slides/class 3.pdf",
"Pasted image 20250310172134.png",
"Pasted image 20250310103703.png",
"Concurrent Systems/notes/1 - CS Basics.md",
"Concurrent Systems/notes/1 - CS Basics2.md",
"Concurrent Systems/notes/1b - Peterson algorithm.md",
"HCIW/slides/Interface and Interaction for IoT.pdf",

2
Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md
View file

@ -105,7 +105,7 @@ unlock() :=
return
```
>[!note] a>It is bounded bypass with bound n-1>
>[!note] It is bounded bypass with bound n-1>
### Safe registers
Atomic R/W and specialized HW primitives provide some form of atomicity. But is it possible to enforce MUTEX without atomicity?