Due: 11/10/2004---midnight

Write a report on a distributed mutual exclusion algorithm we have NOT
discussed(*). [[ Algoritms discussed in class are :1) Leslie
lamport,-time clock algorithm,
2) An optimal algorithm for Mutual exclusion in CN-by glenn Ricart&
ashok K.Agarwala,3) A SQRT N algorithm for Mutual Exclusion in
decentralized systems by MAMORU MAEKAWA,4)Heuristically aided...... by
Mukesh Sighnal
we have to compare our chosen one with these...as described later]]

Convince the reader on your understanding of the following: 
Underlying principles or the basis for the algorithm. 
Functional details of the algorithm. 
Instances where it does better/worse than the (or any) competition. 
Is your algorithm closer to any of the three algorithms we discussed? Which one? 
Include the reference section and a copy of the paper you are reporting on 
Hand-in a printed copy of your report. 




(*) Example algorithms you may want to write on (or any others) 
K Raymond. A tree-based algorithm for distributed mutual exclusion.
ACM Transactions on Computer Systems Volume 7 , Issue 1 (February
1989)
Ichiro Suzuki , Tadao Kasami, A distributed mutual exclusion
algorithm, ACM Transactions on Computer Systems (TOCS), v.3 n.4,
p.344-349, Nov. 1985
S. Banerjee and P. K. Chrysanthis. A New Token Passing Distributed
Mutual Exclusion Algorithm (1996) In Proceedings of the Intl. Conf. on
Distributed Computing Systems. pp. 717--724
M. L. Neilsen and M. Mizuno. A DAG-based algorithm for distributed
mutual exclusion. In Proc. of the 11th Int. Conf. on Distributed
Computing Sys., pp. 354-360, 1991.