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...

Full description

Bibliographic Details

Published in:	Parallel and Distributed Processing: Proceedings of the 8th Euromicro Workshop, Rhodos, Greece, 2000 pp. 220 - 226
Main Authors:	Brzezinski, J., Wawrzyniak, D.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2000
Subjects:	Contracts Delay Phase change random access memory Programming profession Read only memory
ISBN:	9780769505008, 0769505007
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!