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

vault backup: 2025-04-01 08:24:49

Browse source
This commit is contained in:
Marco Realacci 2025-04-01 08:24:49 +02:00
parent 4a4b42165d
commit 0bbc52b902
3 changed files with 29 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Concurrent Systems/notes/10 - Consensus Implementation.md Normal file
View file

@ -0,0 +1,8 @@
Which objects allow for a wait free implementation of (binary) consensus? The answer depends on the number of participants
The **consensus number** of an object of type T is the greatest number n such that it is possible to wait free implement a consensus object in a system of n processes by only using objects of type T and atomic R/W registers.
For all T, CN(T) > 0; if there is no sup, we let CN(T) := +∞
**Thm:** let CN(T1) < CN(T2), then there exists no wait free implementation of T2 that only uses objects of type T1 and atomic R/W registers for all n s.t. CN(T1) < n <= CN(T2).