CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

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

by Abhishek Swaroop, Awadhesh Kumar Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 9
Year of Publication: 2013
Authors: Abhishek Swaroop, Awadhesh Kumar Singh
10.5120/11426-6777

Abhishek Swaroop, Awadhesh Kumar Singh . A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems. International Journal of Computer Applications. 67, 9 ( April 2013), 51-59. DOI=10.5120/11426-6777

@article{ 10.5120/11426-6777,
author = { Abhishek Swaroop, Awadhesh Kumar Singh },
title = { A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 9 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 51-59 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number9/11426-6777/ },
doi = { 10.5120/11426-6777 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:24:15.057279+05:30
%A Abhishek Swaroop
%A Awadhesh Kumar Singh
%T A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 9
%P 51-59
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Joung, Y. J. , 2000,, Asynchronous Group Mutual Exclusion, Distrib. Comput. 13(4), 51 –60.
  2. Park, J. , Gang, S. , Kim, K. , 2003, Group Mutual Exclusion Based Secured Distributed Protocol, Joho Shori Gakkai Shinpojiumu Ronbushu. 15, 445-450.
  3. Thiare, O. , Gueroui,M. , Naimi, M. , 2006, Distributed Group Mutual Exclusion Based on Clients/ Server Model, In Proc. 7th Int. Conf. on Parallel and Distribut. Comput. Appl. and Technol. 67-73.
  4. Advance System Format (ASF) specifications for digital media files available at URL: http://www. msdn. microsoft. com/en-us/library/bb643323. aspx.
  5. Kean, P. , Moir, M. , 1999, A Simple Local Spin Group Mutual Exclusion Algorithm, In Proc. 18th Annu. ACM Symp. on Princ. of Distrib. Comput, 23-32.
  6. IEEE 802. 11 Working Group for Wireless Local Area Networks, available at URL: http://ieee802. org/11/,2003
  7. Jiang, J. R. , 2002, A Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks, In Proc. 6th Int. Conf. on Comput. Sci. and Inf. 266-272.
  8. Hadzilacos, V. , 2001, A Note on Group Mutual Exclusion. In Proc. 20th ACM Symp. on Princ. of Distrib. Comput. , 100-106.
  9. Jayanti, P. , Petrovic, S. , Tan, K. , 2003, Fair Group Mutual Exclusion, In Proc. 22nd Conf. on Princ. of Distrib. Comput. , 275-284.
  10. Joung, Y. J. , 2002, The Congenial Taking Philosopher Problem in Computer Networks, Distrib. Comput. , 15(3), 189-206.
  11. Attreya, R. , Mittal, N. , 2005, A Dynamic Group Mutual Exclusion Algorithm using Surrogate Quorums, In Proc. 25th IEEE Conf. on Distrib. Comput. Syst. , 251-260.
  12. Joung, Y. J. , 2003, Quorum-Based Algorithms for Group Mutual Exclusion, IEEE Trans. on Parallel and Distrib. Comput. Syst. , 14(5), 463-476.
  13. Mamun, Q. E. K. , Nakazato, H. , 2006, A New Token Based Algorithm for Group Mutual Exclusion in Distributed Systems, In Proc. 5th Int. Symp. on Parallel and Distrib. Comput. , 34-41.
  14. Mittal, N. , Mohan, P. K. , 2007, A Priority Based Distributed Group Mutual Exclusion Algorithm when Group Access is Non-Uniform. , J. of Parallel and Distrib. Comput. 67(7), 795-815.
  15. Swaroop, A. , Singh, A. K. , 2007, A Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed systems, J. of Comput. Sci. , 3(10), 829-835.
  16. Chang, Y. I. , Singhal, M. , Liu, M. T. , 1990, A Hybrid Approach to Mutual Exclusion for Distributed Systems, In Proc. 14th Intl. Comput. Softw. and Appl. Conf. , 289-294.
  17. Bertier, M. , Arantes, L. , Sens, P. , 2006, Distributed Mutual Exclusion Algorithms for Grid Applcations: A Hierarchical approach, J. of Parallel and Distrib. Comput. , 66, 128-144.
  18. Madhuram, S. , Kumar, A. , 1994, A Hybrid Approach for Mutual Exclusion in Distributed Computing Systems, In Proc. 6th IEEE Symp. on Parallel and Distrib. Process. , 18-25.
  19. Erciyes, K. , 2004, Distributed Mutual Exclusion Algorithms on a ring of Clusters, In Proc. Int. Conf. on Comput. Sci. and Its Appl. , 518-527 .
  20. Singhal, M. , 1989, A Dynamic Information Structure Distributed Mutual Exclusion Algorithm for Distributed Systems. In Proc. 9th Int. Conf. on Distrib. Comput. and Syst. , 70-78.
  21. Maekawa, M. , 1985, An Algorithm for Mutual Exclusion in Decentralized Systems, ACM Trans. on Comput. Syst. 3(2) (1985) 145–159.
  22. Naimi, M. , Trehel, M. , Arnold, A. , 1993, A Log(N) Distributed Mutual Exclusion Algorithm based on Path Reversal. J. of Parallel and Distrib. Comput. , 34, 1-13.
  23. Ricart, G. , Agarwala, A. K. , 1981, An Optimal Algorithm for Mutual Exclusion in Computer Networks, Commun. Of the ACM, 24(1), 9-17.
  24. Swaroop, A. , Singh, A. K. , 2009, A Hierarchical Approach to Handle Group Mutual Exclusion in Distributed Systems, In Proc. Int. Conf. On Dist. Comput. And Networking, 462-467.
  25. Yang, B. , Molina, H. G. , 2003, Designing a super peer networks, In Proc 19th Intl. Conf. on Data Engg. , 49-60.
Index Terms

Computer Science
Information Sciences

Keywords

Concurrency Group Mutual Exclusion Hybrid Token.

Powered by PhDFocusTM