Data handover, Dho is a library of functions adapted to large-scale distributed systems. It provides routines that allow to acquire resources in reading or writing in the ways that are coherent and transparent for users. We modeled the life cycle of Dho by a finite state automaton and through experiments, we have found that our approach produced an overlap between the calculation of the application and the controle of the data. These experiments were conducted both in simulated mode and in real environment (within Grid'5000). We exploited the GRAS library of the SimGrid toolkit. Several clients try to access the resource concurrently according the client-server paradigm. By the theory of queues, the stability of the model was demonstrated in a centralized environment. We improved, the distributed algorithm for mutual exclusion (of Naimi and Trehel), by introducing following features: (1) Allowing the mobility of processes (ADEMLE), (2) introducing shared locks (AEMLEP) and finally (3) merging both properties cited above into an algorithm summarising (ADEMLEP). We proved the properties, Safety and liveliness, theoretically for all extended algorithms. The proposed peer-to-peer system combines our extended algorithms and original dho model. Lock and resource managers operate and interact each other in an architecture based on three levels. Following the experimental study of the underlying system on Grid'5000, and the results obtained, we have proved the performance and stability of the model Dho over a multitude of parameters.
