Geodesic
Non-deterministic choice in the mutual exclusion algorithm
News of the Kabardin-Balkar scientific center of RAS, no. 1 (1999), pp. 25-28 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper explores the possibility of introducing a non-deterministic choice operation into a parallel algorithm for synchronizing N processors with global memory. An algorithm is a combination of three things: non-deterministic choice, semantics of operations, suitable data structure.
Keywords: synchronization, deep memory, parallel algorithm 
@article{IZKAB_1999_1_a0,
     author = {U. M. Bishenov},
     title = {Non-deterministic choice in the mutual exclusion algorithm},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {25--28},
     year = {1999},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_1999_1_a0/}
}
TY  - JOUR
AU  - U. M. Bishenov
TI  - Non-deterministic choice in the mutual exclusion algorithm
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 1999
SP  - 25
EP  - 28
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/IZKAB_1999_1_a0/
LA  - ru
ID  - IZKAB_1999_1_a0
ER  - 
%0 Journal Article
%A U. M. Bishenov
%T Non-deterministic choice in the mutual exclusion algorithm
%J News of the Kabardin-Balkar scientific center of RAS
%D 1999
%P 25-28
%N 1
%U http://geodesic.mathdoc.fr/item/IZKAB_1999_1_a0/
%G ru
%F IZKAB_1999_1_a0
U. M. Bishenov. Non-deterministic choice in the mutual exclusion algorithm. News of the Kabardin-Balkar scientific center of RAS, no. 1 (1999), pp. 25-28. http://geodesic.mathdoc.fr/item/IZKAB_1999_1_a0/