Skip to main content
SpringerLink
Log in

Building effective mutual exclusion services for grids

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Antoniu G, Bouge L, Lacour S (2003) Making a DSM consistency protocol hierarchy-aware: an efficient synchronization scheme. In: Proceedings of the workshop on distributed shared memory on clusters, May 2003, pp 516–521

  2. Arantes L, Sens P, Folliot B (2002) An effective logical cache for a clustered LRC-based DSM system. Clust Comput 5(1):19–31

    Article  Google Scholar 

  3. Bertier M, Arantes L, Sens P (2006) Distributed mutual exclusion algorithms for grid applications: a hierarchical approach. J Parallel Distrib Comput 66:128–144

    MATH  Google Scholar 

  4. Cappello F, Desprez F, Dayde M, Jeannot E, Jegou Y, Lanteri S, Melab N, Namyst R, Vicat-Blanc Primet P, Richard O, Caron E, Leduc J, Mornet G (2006) Grid5000: a nation wide experimental grid testbed. High Perform Comput Appl 20(4):481–494

    Article  Google Scholar 

  5. Chang I, Singhal M, Liu M (1990) A hybrid approach to mutual exclusion for distributed system. In: IEEE international computer software and applications conference, 1990, pp 289–294

  6. Erciyes K (2004) Distributed mutual exclusion algorithms on a ring of clusters. In: International conference on computational science and its applications. LNCS, vol 3045, pp 518–527

  7. Housni A, Tréhel M (2001) Distributed mutual exclusion by groups based on token and permission. In: International conference on computational science and its applications, June 2001, pp 26– 29

  8. Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. CACM 21(7):558–564

    MATH  Google Scholar 

  9. Madhuram X, Kumar X (1994) A hybrid approach for mutual exclusion in distributed computing systems. In: IEEE symposium on parallel and distributed processing, 1994

  10. Maekawa M (1985) A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2):145–159

    Article  Google Scholar 

  11. Martin AJ (1985) Distributed mutual exclusion on a ring of processes. Sci Comput Program 5(3):265–276

    Article  MATH  Google Scholar 

  12. Mueller F (1998) Prioritized token-based mutual exclusion for distributed systems. In: International parallel processing symposium, March 1998, pp 791–795

  13. Naimi M, Trehel M, Arnold A (1996) A log (N) distributed mutual exclusion algorithm based on path reversal. J Parallel Distributed Comput 34(1):1–13

    Article  Google Scholar 

  14. Omara F, Nabil M (2002) A new hybrid algorithm for the mutual exclusion problem in the distributed systems. Int J Intell Comput Inf Sci 2(2):94–105

    Google Scholar 

  15. Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7(1):61–77

    Article  MathSciNet  Google Scholar 

  16. Ricart G, Agrawala A (1981) An optimal algorithm for mutual exclusion in computer networks. Commun ACM, 24, 1981

  17. Rizzo L (1997) Dummynet: a simple approach to the evaluation of network protocols. ACM Comput Commun Rev 27(1):31–41

    Article  Google Scholar 

  18. Singhal M (1992) A dynamic information structure for mutual exclusion algorithm for distributed systems. IEEE Trans Parallel Distrib Syst 3(1):121–125

    Article  Google Scholar 

  19. Sopena J, Arantes L, Legond F, Sens P (2008) The impact of clustering on token-based mutual exclusion algorithms. In: Euro-Par 2008 processing, Las Palmas, Spain. Springer, Berlin

    Google Scholar 

  20. Sopena J, Legond F, Arantes L, Sens P (2007) A composition approach to mutual exclusion algorithms for grid applications. In: The 36th international conference on parallel processing, September 2007, pp 65–75

  21. Suzuki I, Kasami T (1985) A distributed mutual exclusion algorithm. ACM Trans Comput Syst 3(4):344–349

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP6—Université de Paris 6, INRIA Rocquencourt 4, Place Jussieu 75252, Paris Cedex 05, France

    Julien Sopena, Luciana Arantes, Fabrice Legond-Aubry & Pierre Sens

Authors
  1. Julien Sopena
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luciana Arantes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabrice Legond-Aubry
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pierre Sens
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julien Sopena.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sopena, J., Arantes, L., Legond-Aubry, F. et al. Building effective mutual exclusion services for grids. J Supercomput 49, 84–107 (2009). https://doi.org/10.1007/s11227-008-0235-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-008-0235-8

Keywords

Search

Navigation