Consistency requirements of distributed shared memory for Lamport's bakery algorithm for mutual exclusion

As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes. An application of weaker consistency models (e.g. causal, processor, PRAM), available in replicated distributed share...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Parallel and Distributed Processing: Proceedings of the 8th Euromicro Workshop, Rhodos, Greece, 2000 s. 220 - 226
Hlavní autori: Brzezinski, J., Wawrzyniak, D.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2000
Predmet:
Contracts
Delay
Phase change random access memory
Programming profession
Read only memory
ISBN:9780769505008, 0769505007
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes. An application of weaker consistency models (e.g. causal, processor, PRAM), available in replicated distributed shared memory (DSM) systems appealing due to possible performance improvement may imply incorrectness of the algorithm. It raises consistency requirement problem, a problem of finding weaker consistency models of DSM that is sufficient for the algorithm correctness. In this paper, consistency requirements of distributed shared memory for Lamport's Bakery algorithm for mutual exclusion of n processes are considered It is proven that the algorithm is correct with a consistency model resulting from a combination of sequential consistency and one of the weakest consistency models, PRAM, without explicit synchronisation. The combination is achieved by specifying the consistency model with write operations on shared locations.
ISBN:9780769505008
0769505007
DOI:10.1109/EMPDP.2000.823415