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

Content Provider	IEEE Xplore Digital Library
Author	Brzezinski, J. Wawrzyniak, D.
Copyright Year	2000
Description	Author affiliation: Inst. of Comput. Sci., Poznan Univ. of Technol., Poland (Brzezinski, J.)
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.
Starting Page	220
Ending Page	226
File Size	95493
Page Count	7
File Format	PDF
ISBN	0769505007
ISSN	10666192
DOI	10.1109/EMPDP.2000.823415
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-01-21
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Phase change random access memory Contracts Read only memory Delay Programming profession
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

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

A lattice based framework of shared memory consistency models

Group mutual exclusion in linear time and space

Bounds for mutual exclusion with only processor consistency (2000)

Bounds for mutual exclusion with only processor consistency (2000)

Nemos: a framework for axiomatic and executable specifications of memory consistency models

ASCOMA: an adaptive hybrid shared memory architecture

Multi-criterion coherence protocol for distributed shared memory

Heat and Dump: competitive distributed paging

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

Similar Documents

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

A lattice based framework of shared memory consistency models

Group mutual exclusion in linear time and space

Bounds for mutual exclusion with only processor consistency (2000)

Bounds for mutual exclusion with only processor consistency (2000)

Nemos: a framework for axiomatic and executable specifications of memory consistency models

ASCOMA: an adaptive hybrid shared memory architecture

Multi-criterion coherence protocol for distributed shared memory

Heat and Dump: competitive distributed paging

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