Distributed Mutual Exclusion Algorithms on a Ring of Clusters

Erciyes, K.

doi:10.1007/978-3-540-24767-8_54

Cited by 16 publications

(15 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Madhuram et al [9], the authors also present a two level algorithm where the centralized approach is used at lower level and Ricard-Agrawala at the higher level. Erciyes [6] proposes an approach close to ours based on a ring of clusters. Each node in the ring represents a cluster of nodes.…”

Section: Related Workmentioning

confidence: 97%

Building effective mutual exclusion services for grids

et al. 2008

View full text Add to dashboard Cite

Taking into account the intrinsic heterogeneity of communication latency of grid environments, we propose in this article a composition approach that enables to build mutual exclusion services for grids. By using our approach, different intra and inter cluster token-based mutual exclusion algorithms can be combined easily. Performance evaluation tests were conducted on the French national grid testbed called Grid'5000, whose results show that our approach is effective and that the choice of the most suitable inter cluster algorithm depends on the behavior of the application.

show abstract

Section: Related Workmentioning

confidence: 97%

Building effective mutual exclusion services for grids

et al. 2008

View full text Add to dashboard Cite

show abstract

“…In Madhuram et al [12], the authors also present a two level algorithm where the centralized approach is used at lower level and Ricard-Agrawala at the higher level. Erciyes [6] proposes an approach close to ours based on a ring of clusters. Each node in the ring represents a cluster of nodes.…”

Section: Related Workmentioning

confidence: 99%

Verification of a Hierarchical Generic Mutual Exclusion Algorithm

Baarir

Sopena

Legond-Aubry

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

View full text Add to dashboard Cite

Abstract. In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verification of a new generic hierarchical approach. This approach is based on the composition of classical already proof checked distributed algorithms. It overcomes some limitations of these classical algorithms by taking into account the network topology latencies and have a high scalability where centralized ones don't. We also have formalized the properties of the mutual exclusion paradigm in order to verify them against our solution. We prove that our compositional approach preserves theses properties under the assumption that all used plain algorithms assert them. This verification by formal method checkers was eased by the efficient use of already proved mutual exclusion algorithms and the reduction of state spaces by exploiting the symmetries.

show abstract

“…Several hybrid algorithms exist in the literature for the classical mutual exclusion problem e.g. [16][17][18][19]. Chang-Singhal-Liu [16] used Singhal's algorithm [20] at the intra cluster level and Maekawa's algorithm [21] at the inter cluster level.…”

Section: Introductionmentioning

confidence: 99%

“…They used a different algorithm at each level of hierarchy. Erciyes [19] proposed an architecture that consists of a ring of clusters. Erciyes [19] used Ricart-Agrawala's [23] algorithm at the local level and a token passing algorithm at the global level.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems

Swaroop¹,

Singh²

2013

IJCA

View full text Add to dashboard Cite

In the present paper, we propose a hierarchical algorithm to solve the group mutual exclusion (GME) problem in cluster-based systems. We consider a two-level hierarchy in which the nodes are divided in to clusters and a node in each cluster is designated as coordinator which is essentially the cluster head. The number of global messages per critical section entry in our algorithm depends upon the number of clusters in the system unlike most of the existing GME algorithms where it depends upon the total number of nodes in the system. Performance of the algorithm directly depends on the coherent behavior of nodes inside clusters. The results have been substantiated with extensive simulation. A fault tolerant extension of the algorithm has also been proposed in the present exposition.

show abstract

Distributed Mutual Exclusion Algorithms on a Ring of Clusters

Cited by 16 publications

References 7 publications

Building effective mutual exclusion services for grids

Building effective mutual exclusion services for grids

Verification of a Hierarchical Generic Mutual Exclusion Algorithm

A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems

Contact Info

Product

Resources

About