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

vault backup: 2025-04-02 12:31:12

Browse source
This commit is contained in:
Marco Realacci 2025-04-02 12:31:12 +02:00
parent e37fc71f91
commit a2e91be432
2 changed files with 12 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

19
.obsidian/workspace.json vendored
View file

@ -28,15 +28,16 @@
"state": {
"type": "markdown",
"state": {
"file": "Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
"file": "Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md",
"mode": "source",
"source": false
},
"icon": "lucide-file",
"title": "3b - Aravind's algorithm and improvements"
"title": "3a - Hardware primitives & Lamport Bakery algorithm"
}
}
]
],
"currentTab": 1
}
],
"direction": "vertical"
@ -205,12 +206,15 @@
"companion:Toggle completion": false
}
},
"active": "483215723737b6f7",
"active": "0b5880764d0a0d29",
"lastOpenFiles": [
"Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
"Concurrent Systems/notes/4 - Semaphores.md",
"Concurrent Systems/notes/5 - Software Transactional Memory.md",
"Concurrent Systems/notes/4c - Dining Philosophers.md",
"Concurrent Systems/notes/1b - Peterson algorithm.md",
"Concurrent Systems/notes/2 - Fast mutex by Lamport.md",
"Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md",
"Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md",
"Concurrent Systems/notes/1b - Peterson algorithm.md",
"Concurrent Systems/notes/7- MUTEX-free concurrency.md",
"Concurrent Systems/notes/9 - Consensus.md",
"Concurrent Systems/notes/10 - Implementing Consensus.md",
@ -218,13 +222,10 @@
"Pasted image 20250401092557.png",
"Pasted image 20250401083747.png",
"Concurrent Systems/notes/2b - Round Robin algorithm.md",
"Concurrent Systems/notes/4c - Dining Philosophers.md",
"Concurrent Systems/notes/6a - Alternatives to Atomicity.md",
"Concurrent Systems/notes/6 - Atomicity.md",
"Concurrent Systems/notes/5 - Software Transactional Memory.md",
"Concurrent Systems/notes/8 - Enhancing Liveness Properties.md",
"Concurrent Systems/slides/class 9.pdf",
"Concurrent Systems/notes/4 - Semaphores.md",
"Concurrent Systems/slides/class 6.pdf",
"Concurrent Systems/slides/class 5.pdf",
"Concurrent Systems/notes/images/Pasted image 20250325090735.png",

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

@ -150,9 +150,9 @@ lock(i) :=
FLAG[i] <- up
max_turn <- max{MY_TURN[1],...,MY_TURN[n]}
if max_turn > 2n then
MY_TURN[i] = max_turn - 2n + 1
MY_TURN[i] = 1
else
MY_TURN[i] = max_turn + 1 | secondo me basta già così
MY_TURN[i] = max_turn + 1
FLAG[i] <- down