Achieving mutual exclusion in a distributed computing environment
作者：
Highlights：
•
摘要
A distributed control algorithm, called MEAL, is presented for achieving mutual exclusion in a distributed computing environment. It requires only (N + 2) messages per critical section entry, in the no failures case; N being the number of nodes in the distributed system. Few assertions are proved to verify the correct functioning of MEAL. Possible modification to make it resilient, in case of node failures, are also suggested.
论文关键词：
论文评审过程：Received 9 October 1981, Revised 16 March 1982, Available online 10 June 2003.
论文官网地址：https://doi.org/10.1016/0306-4379(82)90034-5
