Skip to Main content Skip to Navigation

Exclusion mutuelle de groupes dans les systèmes distribués

Abstract : Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This was introduced by Joung, and some algorithms for the problem have been proposed by incorporating mutual exclusion algorithms. Group mutual exclusion occurs naturally in a situation where a resource can be shared by processes of the same group, but not by processes of different groups. It is also called the "congenial talking philosophers problem".
An example of application interesting is a CD jukebox (documentation, films...) on Internet: several users wishing to reach some CD will be able to do it at the same time instead of awaiting the end of the request of the other users. Effective solutions, written in the message passing model and based on the quorums on the one hand and the circulation of token on the other hand are presented in this thesis.
We tackle also the problem of the mutual exclusion of group on the ad hoc mobile networks and we have proposed an algorithm which is sensitive to link formation and link breaking and thus which is suitable for ad hoc mobile networks.
Complete list of metadatas

Cited literature [150 references]  Display  Hide  Download
Contributor : Ousmane Thiare <>
Submitted on : Tuesday, December 18, 2007 - 9:37:06 AM
Last modification on : Thursday, March 5, 2020 - 4:25:48 PM
Long-term archiving on: : Monday, April 12, 2010 - 8:16:15 AM


  • HAL Id : tel-00198862, version 1



Ousmane Thiare. Exclusion mutuelle de groupes dans les systèmes distribués. Réseaux et télécommunications [cs.NI]. Université de Cergy Pontoise, 2007. Français. ⟨tel-00198862⟩



Record views


Files downloads