Asynchronous Group Mutual Exclusion


Study the Congenial Talking Philosopher Problem and some of its solutions.


Yuh-Jzer Joung. Asynchronous Group Mutual Exclusion. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 51-60, Puerto Vallarta, Mexico, 1998. ACM.

Additional reading material

The Java Tutorial.

Implementation details

I want to use a Java applet to show the problem online, use Java synchronization of threads to simulate the asynchronous situation of the problem. I also want to do some theory work, such as prove the lower bound of fairness (how long at most a philosopher need to wait before attend the forum) and the efficiency.