Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hesselink, Willem"'
Publikováno v:
Concurrency and Computation, 30(4):e4183. Wiley
This paper presents a new starvation-free software algorithm for the N-thread mutual-exclusion problem. In the absence of contention, the algorithm requires only eight write operations and four read operations to enter and leave the critical section;
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::df81cb2f3f7a010739aaf51a33967404
https://research.rug.nl/en/publications/971f7afc-16ae-4c4d-b90c-f6312fb6988c
https://research.rug.nl/en/publications/971f7afc-16ae-4c4d-b90c-f6312fb6988c
Publikováno v:
Concurrency and Computation, 28(1), 144-165. Wiley
Dekker's algorithm was thought to be safe in an environment without atomic reads or writes where bits flicker or scramble during simultaneous operations. A counter-example is presented showing Dekker's algorithm is unsafe without atomic read. A modif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::8dd1ec738b19996e6f30dc94787a8eac
https://research.rug.nl/en/publications/93ef46f3-765e-4901-ad74-45a14add9129
https://research.rug.nl/en/publications/93ef46f3-765e-4901-ad74-45a14add9129