Affiliation:
1. Jadavpur University, Kolkata, India
Abstract
Correctness issues in two process mutual exclusion algorithms are investigated. A new theorem is proposed and proved that describes the key concept involved in such algorithms. For the purpose of proving the techniques developed in [3] are used. Result of this theorem is applied to two different algorithms of which one could be proved incorrect. Technique developed in [3] is also used to prove the correct algorithm.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification
2. Ordering of events in two-process concurrent system
3. Jayadev Misra A family of 2-process mutual exclusion algorithms Notes on UNITY:13--90 http://www.cs.utexas.edu/users/psp/unity/notes/13-90.pdf. March 7 1994. Jayadev Misra A family of 2-process mutual exclusion algorithms Notes on UNITY:13--90 http://www.cs.utexas.edu/users/psp/unity/notes/13-90.pdf. March 7 1994.
4. Myths about the mutual exclusion problem
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献