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

Authors:
Jerzy Brzeziński;Dariusz Wawrzyniak
Affiliations:
Institute of Computing Science, Poznan University of Technology, Poznań, POLAND;Institute of Computing Science, Poznan University of Technology, Poznań, POLAND
Venue:
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Year:
2000

Citing 8
Cited 1

Memory coherence in shared virtual memory systems

ACM Transactions on Computer Systems (TOCS)
Distributed operating systems

Distributed operating systems
Mixed consistency: a model for parallel programming (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Limitations of fast consistency conditions for distributed shared memories

Information Processing Letters
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Multi-Criterion Coherence Protocol for Distributed Shared Memory

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers

Consistency Requirements of Peterson's Algorithm for Mutual Exclusion of {n} Processes in a Distributed Shared Memory System

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.