L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

G. Ricart and A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, vol.24, issue.1, pp.9-17, 1981.
DOI : 10.1145/358527.358537

I. Suzuki and T. Kasami, A distributed mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.3, issue.4, pp.344-349, 1985.
DOI : 10.1145/6110.214406

K. Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems, vol.7, issue.1, pp.61-77, 1989.
DOI : 10.1145/58564.59295

M. Naimi and M. Trehel, How to detect a failure and regenerate the token in the log(n) distributed algorithm for mutual exclusion, WDAG, pp.155-166, 1987.

E. W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica, vol.1, issue.2, pp.115-138, 1971.
DOI : 10.1007/BF00289519

K. M. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.632-646, 1984.
DOI : 10.1145/1780.1804

N. A. Lynch, Upper bounds for static resource allocation in a distributed system, Journal of Computer and System Sciences, vol.23, issue.2, pp.254-278, 1981.
DOI : 10.1016/0022-0000(81)90015-5

E. Styer and G. L. Peterson, Improved algorithms for distributed resource allocation, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.105-116, 1988.
DOI : 10.1145/62546.62567

B. Awerbuch and M. Saks, A dining philosophers algorithm with polynomial response time, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.65-74, 1990.
DOI : 10.1109/FSCS.1990.89525

A. Bouabdallah and C. Laforest, A distributed token-based algorithm for the dynamic resource allocation problem, ACM SIGOPS Operating Systems Review, vol.34, issue.3, pp.60-68, 2000.
DOI : 10.1145/506117.506125

D. Ginat, A. U. Shankar, and A. K. Agrawala, An efficient solution to the drinking philosophers problem and its extensions, WDAG (Disc), pp.83-93, 1989.
DOI : 10.1007/3-540-51687-5_34

A. Maddi, Token based solutions to M resources allocation problem, Proceedings of the 1997 ACM symposium on Applied computing , SAC '97, pp.340-344, 1997.
DOI : 10.1145/331697.332307

V. C. Barbosa, M. R. Benevides, and A. L. Filho, A priority dynamics for generalized drinking philosophers Asynchronous group mutual exclusion (extended abstract), PODC, pp.189-195, 1998.

V. Bhatt and C. Huang, Group mutual exclusion in O(log n) RMR, PODC 2010, pp.45-54, 2010.

W. Aoxueluo, J. Wu, and M. Cao, A Generalized Mutual Exclusion Problem and Its Algorithm, 2013 42nd International Conference on Parallel Processing, pp.300-309, 2013.
DOI : 10.1109/ICPP.2013.39

K. Raymond, A distributed algorithm for multiple entries to a critical section, Information Processing Letters, vol.30, issue.4, pp.189-193, 1989.
DOI : 10.1016/0020-0190(89)90211-1

M. Naimi, Distributed algorithm for K-entries to critical section based on the directed graphs, ACM SIGOPS Operating Systems Review, vol.27, issue.4, pp.67-75, 1993.
DOI : 10.1145/163640.163646

N. S. Dement and P. K. Srimani, A new algorithm for k mutual exclusions in distributed systems, Journal of Systems and Software, vol.26, issue.2, pp.179-191, 1994.
DOI : 10.1016/0164-1212(94)90087-6

R. Satyanarayanan and C. R. Muthukrishnan, Multiple Instance Resource Allocation in Distributed Computing Systems, Journal of Parallel and Distributed Computing, vol.23, issue.1, pp.94-100, 1994.
DOI : 10.1006/jpdc.1994.1122

S. Bulgannawar and N. H. Vaidya, A distributed K-mutual exclusion algorithm, Proceedings of 15th International Conference on Distributed Computing Systems, pp.153-160, 1995.
DOI : 10.1109/ICDCS.1995.500014

V. A. Reddy, P. Mittal, and I. Gupta, Fair K Mutual Exclusion Algorithm for Peer to Peer Systems, 2008 The 28th International Conference on Distributed Computing Systems, pp.655-662, 2008.
DOI : 10.1109/ICDCS.2008.76

I. Rhee, A modular algorithm for resource allocation, Distributed Computing, pp.157-168, 1998.
DOI : 10.1007/s004460050047

J. Lejeune, L. Arantes, J. Sopena, and P. Sens, Reducing synchronization cost in distributed multi-resource allocation problem Available: https, 2015.

F. Mueller, Priority inheritance and ceilings for distributed mutual exclusion, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), pp.340-349, 1999.
DOI : 10.1109/REAL.1999.818861