Skip to search formSkip to main contentSkip to account menu

Lamport's distributed mutual exclusion algorithm

Known as: Lamport 
Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Lamport timestampsLamport's bakery algorithmMutual exclusionSuzuki-Kasami algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improved mathematical model of the post-quantum eletronic signature mechanism
In the paper new electronic signature mechanisms which will be urgent in the post-quantum period development necessity is… 
Review
2016
Review
2016
Increasing Learner Engagement in Online Learning through Use of Interactive Feedback: Results of a Pilot Study
Technologies for eLearning continue to evolve and provide additional mechanisms for teaching and facilitating learner engagement… 
Review
2012
Review
2012
Breakfast and Adolescent Academic Performance : An Analytical Review of Recent Research
ver the past several decades, researchers have suspected and confirmed various links between breakfast consumption and adolescent… 
Review
2010
Review
2010
A Review of Checkpointing Fault Tolerance Techniques in Distributed Mobile Systems
Fault Tolerance Techniques enable systems to perform tasks in the presence of faults. A checkpoint is a local state of a process… 
Review
2000
Review
2000
A survey of checkpointing algorithms for parallel and distributed computers
Checkpoint is defined as a designated place in a program at which normal processing is interrupted specifically to preserve the… 
Highly Cited
1993
Highly Cited
1993
Fully polynomial Byzantine agreement in t + 1 rounds
This paper presents a polynomial protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number… 
1989
1989
Efficient temporal reasoning (extended abstract)
There has been much interest in decision procedures for testing satisfiability (or validity) of formulae in various systems of… 
Review
1986
Review
1986
The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP
Proofsystems for proving partial correctness of distributed processes which communicate through message-passing are discussed… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)