Jean Sirmai
|
f5cb195ed2
|
Update Concurrent Programming
|
2021-04-07 18:43:48 +00:00 |
|
Jean Sirmai
|
86a12cd3b8
|
"The solution in which locks are always acquired in strict order [...] can be mathematically proven to avoid deadlocks [because] you can't get cyclic locking dependencies, which are a necessary condition fordeadlock to occur."
|
2021-04-07 18:42:33 +00:00 |
|
Adrien Bourmault
|
be9ab52204
|
Update Concurrent Programming.py
|
2021-03-31 11:38:13 +00:00 |
|
Jean Sirmai
|
0450c5de81
|
How to terminate the local threads ? Trying to circumscribe the problem...
|
2021-03-31 08:19:25 +00:00 |
|
Jean Sirmai
|
a467610eae
|
Update Concurrent Programming
|
2021-03-31 07:51:42 +00:00 |
|
Jean Sirmai
|
9d729412d4
|
Update Concurrent Programming
|
2021-03-31 06:06:07 +00:00 |
|
Jean Sirmai
|
53df6f852a
|
Update Concurrent Programming
|
2021-03-31 06:02:27 +00:00 |
|
Jean Sirmai
|
fec95335a9
|
Concurrent Programming : a simple model to tackle the problem
|
2021-03-30 19:36:01 +00:00 |
|
Jean Sirmai
|
a7c44bfbad
|
First scheme (preparing tools)
|
2021-03-30 16:56:55 +00:00 |
|
Jean Sirmai
|
ced030fc22
|
a first scheme
|
2021-03-30 15:09:29 +00:00 |
|
Jean Sirmai
|
aeefc0dd03
|
Add new file
|
2021-03-30 10:24:04 +00:00 |