Distributed mutual exclusion on a ring of processes (Q1060005): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054621224 / rank | |||
Normal rank |
Latest revision as of 01:56, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distributed mutual exclusion on a ring of processes |
scientific article |
Statements
Distributed mutual exclusion on a ring of processes (English)
0 references
1985
0 references
A set of processes called 'masters' are sharing a critical section on a mutual exclusion basis. A master communicates only with its private 'server'. The servers communicate with each other in a ring. Three solutions for solving the mutual exclusion problem are presented. They all rely on the presence of a unique privilege in the ring. The notation used extends CSP input and output commands with a Boolean primitive, the 'probe', which makes it possible to determine whether a communication action is pending on a channel. In the correctness proofs, the concept of 'trace' is introduced, i.e. a total ordering of actions corresponding to a possible interleaving of the atomic actions of a concurrent computation.
0 references
distributed mutual exclusion
0 references
cyclic processes
0 references
communication network
0 references
CSP
0 references
correctness proofs
0 references
concurrent computation
0 references