Today's article comes from the Distributed Computing journal. The authors are Ben-David et al., from the Technion-Israel Institute of Technology. In this paper they're showcasing a locking algorithm that should, (if it works), guarantee both fairness and bounded execution time, even under the assumption of an adversary.
DOI: 10.1007/s00446-024-00474-4
You must be an active Journal Club member to access this content. If you're already a member, click the blue button to login. If you're not a member yet, click the sign-up button to get started.
Login to My Account
Sign Up