Consistent models and algorithms for sharing resources in large scale distributed systems.
Identifieur interne : 001154 ( Main/Exploration ); précédent : 001153; suivant : 001155Consistent models and algorithms for sharing resources in large scale distributed systems.
Auteurs : Soumeya Hernane [Algérie]Source :
Descripteurs français
- mix :
English descriptors
Abstract
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.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 001856
- to stream Hal, to step Curation: 001856
- to stream Hal, to step Checkpoint: 001069
- to stream Main, to step Merge: 001165
- to stream Main, to step Curation: 001154
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Consistent models and algorithms for sharing resources in large scale distributed systems.</title><title xml:lang="fr">Modèles et algorithmes de partage de données cohérents pour le calcul parallèle et distribué à haut débit.</title><author><name sortKey="Hernane, Soumeya" sort="Hernane, Soumeya" uniqKey="Hernane S" first="Soumeya" last="Hernane">Soumeya Hernane</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-301316" status="VALID"><orgName>[USTO MB] Université des Sciences et de la technologie d'Oran Mohamed Boudiaf</orgName><desc><address><country key="DZ"></country></address></desc></hal:affiliation><country>Algérie</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:tel-00919272</idno><idno type="halId">tel-00919272</idno><idno type="halUri">https://tel.archives-ouvertes.fr/tel-00919272</idno><idno type="url">https://tel.archives-ouvertes.fr/tel-00919272</idno><date when="2013-06-20">2013-06-20</date><idno type="wicri:Area/Hal/Corpus">001856</idno><idno type="wicri:Area/Hal/Curation">001856</idno><idno type="wicri:Area/Hal/Checkpoint">001069</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001069</idno><idno type="wicri:Area/Main/Merge">001165</idno><idno type="wicri:Area/Main/Curation">001154</idno><idno type="wicri:Area/Main/Exploration">001154</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Consistent models and algorithms for sharing resources in large scale distributed systems.</title><title xml:lang="fr">Modèles et algorithmes de partage de données cohérents pour le calcul parallèle et distribué à haut débit.</title><author><name sortKey="Hernane, Soumeya" sort="Hernane, Soumeya" uniqKey="Hernane S" first="Soumeya" last="Hernane">Soumeya Hernane</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-301316" status="VALID"><orgName>[USTO MB] Université des Sciences et de la technologie d'Oran Mohamed Boudiaf</orgName><desc><address><country key="DZ"></country></address></desc></hal:affiliation><country>Algérie</country></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Dho life cycle</term><term>Overlapping</term><term>dynamic system</term><term>read/write lock</term><term>resource handler</term></keywords><keywords scheme="mix" xml:lang="fr"><term>ADEMLEP</term><term>Data handover</term><term>cycle de vie Dho</term><term>gestionnaire de ressource</term><term>recouvrement</term><term>système dynamique</term><term>système dynamique.</term><term>verrouillage en lecture/écriture</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI><affiliations><list><country><li>Algérie</li></country></list><tree><country name="Algérie"><noRegion><name sortKey="Hernane, Soumeya" sort="Hernane, Soumeya" uniqKey="Hernane S" first="Soumeya" last="Hernane">Soumeya Hernane</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001154 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001154 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Hal:tel-00919272
|texte= Consistent models and algorithms for sharing resources in large scale distributed systems.
}}
| This area was generated with Dilib version V0.6.33. |  |