Shared memory and the Bakery algorithm

- Shared memory and the Bakery algorithm
Recommendations
Consistency requirements of distributed shared memory for Lamport's Bakery algorithm for mutual exclusion
EURO-PDP'00: Proceedings of the 8th Euromicro conference on Parallel and distributed processingAs 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), ...
Avoiding Register Overflow in the Bakery Algorithm
ICPP Workshops '20: Workshop Proceedings of the 49th International Conference on Parallel ProcessingComputer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users’ requirements. This scheme may implement certain ...
Shared memory multiplexing: a novel way to improve GPGPU throughput
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniquesOn-chip shared memory (a.k.a. local data share) is a critical resource to many GPGPU applications. In current GPUs, the shared memory is allocated when a thread block (also called a workgroup) is dispatched to a streaming multiprocessor (SM) and is ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Appears in

Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 235Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)13
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in