Data handover on a peer-to-peer system
Résumé
We propose a Data Handover API for an efficient management for locking
and mapping data in extensible distributed settings, on the top of a three level structure.
At the lowest level, the lock manager ensures consistency in the logical order of requests,
although involved processes in the request processing may leave the system. This is what
we describe in our proposal ELMP algorithm. We also deal with the flooding issue of
insertion of new processes. All operations have an amortized cost of O(log n). In the mid-
dle of the structure, the resource manager carries out requests sent at the applicant level
through DHO routines, interacts with the lock manager and finally maps the resource in
the local memory. An experimental assessment validates the practicality of our proposal.
Origine | Fichiers produits par l'(les) auteur(s) |
---|