D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, SETI@home: an experiment in public-resource computing, Communications of the ACM, vol.45, issue.11, pp.56-61, 2002.
DOI : 10.1145/581571.581573

A. Andersson, General Balanced Trees, Journal of Algorithms, vol.30, issue.1, pp.1-18, 1999.
DOI : 10.1006/jagm.1998.0967

G. Antoniu, L. Bougé, and M. Jan, Juxmem: An adaptive supportive platform for data sharing on the grid, Scalable Computing: Practice and Experience, vol.6, issue.3, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000984

G. Antoniu, L. Cudennec, M. Jan, and M. Duigou, Performance scalability of the JXTA P2P framework, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-10, 2007.
DOI : 10.1109/IPDPS.2007.370299
URL : https://hal.archives-ouvertes.fr/inria-00119916

P. Arquet, IntroductionàIntroduction`Introductionà MPI ? Message Passing Interface, 2001.

Y. Caniou, E. Caron, G. L. Mahec, and H. Nakada, Transparent Collaboration of GridRPC Middleware using the OGF Standardized GridRPC Data Management API, The International Symposium on Grids and Clouds (ISGC), page 12p. Proceedings of Science, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01009373

Y. Caniou, H. Croubois, and G. L. Mahec, Standardized Multi-protocol Data Management for Grid and Cloud GridRPC Frameworks, Globe'14, pp.61-72, 2014.
DOI : 10.1007/978-3-319-10067-8_6

G. Fedak, C. Germain, V. Neri, and F. Cappello, XtremWeb: a generic global computing system, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid, 2001.
DOI : 10.1109/CCGRID.2001.923246

I. Galperin and R. L. Rivest, Scapegoat trees, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, pp.165-174, 1993.

J. Gustedt, Data Handover: Reconciling message passing and shared memory, Foundations of Global Computing, number 05081 in Dagstuhl Seminar Proceedings, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00549564

S. L. Hernane, J. Gustedt, and M. Benyettou, Modeling and Experimental Validation of the Data Handover??API, Lecture Notes in Computer Science, vol.3, issue.9, pp.117-126, 2011.
DOI : 10.1287/opre.9.3.383
URL : https://hal.archives-ouvertes.fr/inria-00547598

S. L. Hernane, J. Gustedt, and M. Benyettou, A Dynamic Distributed Algorithm for Read Write Locks, 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.180-184, 2012.
DOI : 10.1109/PDP.2012.32
URL : https://hal.archives-ouvertes.fr/hal-00641068

H. V. Jagadish, B. C. Ooi, and Q. H. Vu, Baton: A balanced tree structure for peer-to-peer networks, VLDB, pp.661-672, 2005.

H. V. Jagadish, B. C. Ooi, K. Tan, Q. H. Vu, and R. Zhang, Speeding up search in peer-to-peer networks with a multi-way tree structure, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, pp.1-12, 2006.
DOI : 10.1145/1142473.1142475

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

M. Maekawa, A N algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems, vol.3, issue.2, pp.145-159, 1985.
DOI : 10.1145/214438.214445

D. S. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne et al., Peer-to-peer computing, 2002.

M. Naimi and M. Tréhel, How to detect a failure and regenerate the token in the log(N ) distributed algorithm for mutual exclusion, Proceedings of the 2nd International Workshop on Distributed Algorithms, pp.155-166, 1988.

M. Naimi, M. Tréhel, and A. Arnold, A Log (N) Distributed Mutual Exclusion Algorithm Based on Path Reversal, Journal of Parallel and Distributed Computing, vol.34, issue.1, pp.1-13, 1996.
DOI : 10.1006/jpdc.1996.0041

. Openmp, The OpenMP API specification for parallel programming

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

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

J. Sopena, L. B. Arantes, M. Bertier, and P. Sens, A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree, Euro-Par'05, pp.654-663, 2005.
DOI : 10.1007/11549468_72
URL : https://hal.archives-ouvertes.fr/inria-00179797

P. Velho and A. Legrand, Accuracy study and improvement of network simulation in the SimGrid framework, Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, pp.1-10, 2009.
DOI : 10.4108/ICST.SIMUTOOLS2009.5592
URL : https://hal.archives-ouvertes.fr/inria-00361031