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

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!