.. Objectifs-de-notre-système-distribué, 97 6.3 DHO dans un système peer-to-peer, p.98

E. Au-blocage and .. , 110 6.6.1 Paradigme Client-serveur vs système peer-to-peer en l'absence de retard, Évaluation des performances du système peer, p.111

. Bibliographie, P. David, . Anderson, C. Jeff, K. Eric et al., Seti@home : an experiment in public-resource computing, Commun. ACM, issue.11, pp.4556-61, 2002.

A. James, A. Yong-jik, and K. , Adaptive mutual exclusion with local spinning, Proceedings of the 14th International Symposium on Distributed Computing, pp.29-43, 2001.

P. David and . Anderson, Boinc : A system for public-resource computing and storage, Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.

B. Marin, A. Luciana, and S. Pierre, Distributed mutual exclusion algorithms for grid applications : A hierarchical approach, J. Parallel Distrib. Comput, vol.66, issue.1, pp.128-144, 2006.

B. Luc, G. Joachim, and M. Xavier, Concurrent AVL Revisited : Self-Balancing Distributed Search Trees, 1995.

[. Jalel, C. Isabelle, D. Denis, G. Pierre-françois, L. Dimitri et al., Message passing interface

C. Sébastien, A. Kumar, D. Franck, P. Vincent, and V. , Token based group mutual exclusion for asynchronous rings, ICDCS, pp.691-694, 2001.

C. Ann, F. Ian, K. Carl, S. Charles, and T. Steven, The data grid : Towards an architecture for the distributed management and analysis of large scientific datasets, JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, vol.23, pp.187-200, 1999.

C. Bengt and G. Rune, The rise and fall of napster : An evolutionary approach, Proceedings of the 6th International Computer Science Conference on Active Media Technology, AMT '01, pp.347-354, 2001.

E. M. Clarke, J. Orna, G. Doron, and A. , PELED : Model checking, 1999.

C. Jalel and L. Pierre-françois, Openmp multithreaded parallelization for shared-memory machines

C. Henri, L. Arnaud, and Q. Martin, Simgrid : a generic framework for large-scale distributed experiments, Proceedings of the Tenth International Conference on Computer Modeling and Simulation, UKSIM '08, pp.126-131, 2008.

G. [. Carvalho, ROUCAIROL : Further Comments on Mutual Exclusion in Computer Networks. Rapports de recherche, 1984.

C. Yatin, R. Sylvia, B. Lee, L. Nick, and S. Scott, Making gnutella-like p2p systems scalable, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '03, pp.407-418, 2003.

C. Manhoi, K. Ambuj, T. Singh-gerard, and M. B. Paul, Coping with contention (extended abstract) In VITÁNYI, éditeurs : Distributed Algorithms, Proceedings, volume 857 de Lecture Notes in Computer Science, pp.89-100, 1994.

C. Pierre-nicolas, S. Mark, G. Stéphane, S. Frédéric, C. Henri et al., Single node on-line simulation of mpi applications with smpi, IPDPS, pp.664-675, 2011.

]. D. Dha06 and . Dhamdhere, Operating Systems, 2006.

W. Edsger and . Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM, vol.8, issue.9, p.569, 1965.

W. Edsger and . Dijkstra, Cooperating sequential processes éditeur : Programming Languages : NATO Advanced Study Institute, pp.43-112, 1968.

M. J. Fischer, N. A. Lynch, J. E. Burns, and B. Allan, Resource allocation with immunity to limited process failure, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979.
DOI : 10.1109/SFCS.1979.37

URL : http://groups.csail.mit.edu/tds/papers/Lynch/focs79-joanne.pdf

F. Ian, Grid technologies and applications : Architecture and achievements, Proceedings of Computing in High Energy and Nuclear Physics (CHEP01, 2001.

G. William and L. Ewing, Mpich working note : The secondgeneration adi for the mpich implementation of mpi, 1996.

G. William, L. Ewing, D. Nathan, and S. Anthony, A high-performance, portable implementation of the mpi message passing interface standard, Parallel Comput, vol.22, issue.6, pp.789-828, 1996.

P. B. Gibbons, M. Yossi, and R. Vijaya, The qrqw pram : accounting for contention in parallel algorithms, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, SODA '94, pp.638-648, 1994.

G. Cécile, N. Vincent, F. Gilles, and C. Franck, Xtremweb : Building an experimental platform for global computing, Proceedings of the First IEEE/ACM International Workshop on Grid Computing, GRID '00, pp.91-101, 2000.

G. Jens, Data handover : Reconciling message passing and shared memory, José Luiz FIADEIRO, Ugo MONTANARI et Martin WIRSING, éditeurs : Foundations of Global Computing, numéro 05081 de Dagstuhl Seminar Proceedings, 2006.

[. Leila, H. Jens, G. Mohamed, B. Jukka, R. Mika et al., Modeling and experimental validation of the data handover API, Lecture Notes in Computer Science, vol.6646, pp.117-126, 2011.

[. Leila, H. Jens, G. Mohamed, and B. , A dynamic distributed algorithm for read write locks, PDP, pp.180-184, 2012.

H. Gerard, Spin model checker, the : primer and reference manual

J. , Y. , and J. H. Anderson, A fast, scalable mutual exclusion algorithm, Distributed Computing, pp.9-10, 1994.

[. Yuh-jzer and J. , Asynchronous group mutual exclusion, Distributed Computing, vol.13, pp.51-60, 1998.

K. Hirotsugu, F. Satoshi, Y. Masafumi, and A. Tadashi, A distributed k-mutual exclusion algorithm using k-coterie, Information Processing Letters, vol.49, pp.213-218, 1994.

L. Leslie, Ti clocks, and the ordering of events in a distributed system, Commun. ACM, vol.21, pp.558-565, 1978.

[. Le and L. , Distributed systems -towards a formal approach, IFIP Congress, pp.155-160, 1977.

D. C. John, LITTLE : A proof for the queuing formula : L = ?W, Operations Research, vol.3, issue.9, pp.383-387, 1961.

. Mpi, Extensions to the message-passing interface. http://www. mpi-forum.org/docs/mpi-20-html/mpi2-report.html. [mpib] Mpich

L. Mitchell, . Neilsen, and M. Masaaki, Nondominated k-coteries for multiple mutual exclusion, Inf. Process. Lett, vol.50, issue.5, pp.247-252, 1994.

N. Otto, S. Eljas, and W. Derick, Concurrency control in database structures with relaxed balance, PODS, pp.170-176, 1987.

N. Mohamed and T. Michel, How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion, Jan van LEEUWEN, éditeur : WDAG, volume 312 de Lecture Notes in Computer Science, pp.155-166, 1987.
DOI : 10.1007/BFb0019802

N. Mohamed, T. Michel, and A. André, A log(N ) distributed mutual exclusion algorithm based on path reversal, J. Parallel Distrib. Comput, vol.34, pp.1-13, 1996.

N. Mohamed, T. Michel, and A. André, A log (n) distributed mutual exclusion algorithm based on the path reversal, Journal of Parallel and Distributed Computing, vol.34, 1996.

Q. Martin, GRAS : a Research and Development Framework for Grid and P2P Infrastructures, IASTED, éditeur : 18th IASTED International Conference on PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS, 2006.

Q. Martin, GRAS : a Research and Development framework for Grid services, 2006.

Q. Martin and V. Flavien, Byte-range asynchronous locking in distributed settings, PDP, pp.191-195, 2009.

Q. Martin and V. Flavien, Byte-range asynchronous locking in distributed settings, 17th Euromicro International Conference on Parallel , Distributed and network-based Processing -PDP 2009, 2009.

R. Glenn and K. Ashok, AGRAWALA : An optimal algorithm for mutual exclusion in computer networks, Commun. ACM, vol.24, issue.1, pp.9-17, 1981.

R. Kerry, A distributed algorithm for multiple entries to a critical section, Inf. Process. Lett, vol.30, issue.4, pp.189-193, 1989.

R. Kerry, A tree-based algorithm for distributed mutual exclusion, ACM Trans. Comput. Syst, vol.7, issue.1, pp.61-77, 1989.

R. Michel, A distributed solution to the k-out of-m resources allocation problem, In ICCI, pp.599-609, 1991.

R. Michel, A simple taxonomy for distributed mutual exclusion algorithms, SIGOPS Oper. Syst. Rev, vol.25, issue.2, pp.47-50, 1991.

S. Julien, L. Bezerra, A. Marin, B. Pierre, and S. , A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree, Euro-Par, pp.654-663, 2005.

. Sin89 and S. Mukesh, A heuristically-aided algorithm for mutual exclusion in distributed systems, IEEE Trans. Computers, vol.38, issue.5, pp.651-662, 1989.

S. Michael, Introduction to the Theory of Computation, PWS, 1997.

S. Ichiro and K. Tadao, A distributed mutual exclusion algorithm, ACM Trans. Comput. Syst, vol.3, issue.4, pp.344-349, 1985.

S. Julien, L. Fabrice, L. Bezerra, A. Pierre, and S. , A composition approach to mutual exclusion algorithms for grid applications, ICPP, p.65, 2007.

S. Warren, T. Valerie, and F. Ian, Using run-time predictions to estimate queue wait times and improve scheduler performance, Scheduling Strategies for Parallel Processing, pp.202-219, 1999.

T. Rajeev, G. William, and L. Ewing, On implementing mpiio portably and with high performance, Proceedings of the 6th Workshop on I/O in Parallel and Distributed Systems, pp.23-32, 1999.

T. Ousmane and N. Mohamed, %mohamed naimi + h. mohamed naimi = identisch ? a quorum-based algorithm for group mutual exclusion, ISCA PDCS, pp.63-69, 2006.

V. Pedro and L. Arnaud, Accuracy study and improvement of network simulation in the SimGrid framework, Simutools '09, pp.1-10, 2009.

W. Claus and M. Frank, Token-based read/write-locks for distributed mutual exclusion, Proceedings from the 6th International Euro-Par Conference on Parallel Processing, Euro-Par '00, pp.1185-1195, 2000.

J. E. Walter, J. L. Welch, and H. Nitin, VAIDYA : A mutual exclusion algorithm for ad hoc mobile networks, Wireless Networks, vol.7, issue.6, pp.585-600, 2001.
DOI : 10.1023/A:1012363200403

. Mots-clés, Data Handover, cycle de vie DHO, gestionnaire de ressource, verrouillage en lecture/écriture , ADEMLEP, recouvrement