This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"
April 1998 (vol. 9 no. 4)
pp. 414-416

Abstract—The circular list-based mutual exclusion algorithm proposed by Fu and Tzeng [1] is subject to a race condition that leads to a deadlock under subtle situations. An execution sequence evidences the race, and a modified version is provided. The performance of the original algorithm remains unchanged.

[1] S.S. Fu and N.-F. Tzeng, "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 628-639, June 1997.

Index Terms:
Critical sections, race conditions, deadlocks, atomic instructions.
Citation:
Ting-Lu Huang, Chien-Hua Shann, "A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 414-416, April 1998, doi:10.1109/71.667901
Usage of this product signifies your acceptance of the Terms of Use.