Most Read Research Articles


Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79
Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More

A QoS Aware Self Adaptive General Scheme to Solve GME Problem

Print
PDF
International Journal of Computer Applications
© 2015 by IJCA Journal
Volume 109 - Number 7
Year of Publication: 2015
Authors:
Jai Singh
Maitreyee Dutta
Abhishek Swaroop
10.5120/19201-0840

Jai Singh, Maitreyee Dutta and Abhishek Swaroop. Article: A QoS Aware Self Adaptive General Scheme to Solve GME Problem. International Journal of Computer Applications 109(7):25-29, January 2015. Full text available. BibTeX

@article{key:article,
	author = {Jai Singh and Maitreyee Dutta and Abhishek Swaroop},
	title = {Article: A QoS Aware Self Adaptive General Scheme to Solve GME Problem},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {109},
	number = {7},
	pages = {25-29},
	month = {January},
	note = {Full text available}
}

Abstract

The Group mutual exclusion problem (GME) is a resource allocation problem which allows concurrency along with mutual exclusion. The concept of GME can be applied to various fields having varying quality of service (QoS) requirements. The present paper presents a self adaptive general scheme to solve GME problem using token-based approach. The striking feature of the scheme is that it considers QoS requirements, checks the QoS requirements time to time and adapts its parameters if there are deviations from the expected behavior. The dynamic analysis of the scheme has also been presented in the present exposition.

References

  • Joung, Y. J. , Asynchronous group mutual exclusion. Distributed computing, vol. 13, no. 4, pp. 189-206, 2000.
  • Park, J. H. , Gang, S. , Kim, K. , Group mutual exclusion based secure distributed protocol. In the proceedings of the computer security symposium 2003, pp. 445- 450, 2003.
  • Mamun, Q. E. K. , Nakazato, H. , A new token-based algorithm for group mutual exclusion in distributed systems. In the proceedings of the 5th international symposium on parallel and distributed computing, pp. 34-41, 2006.
  • Advance system format (ASF) specification by Microsoft Corporation, available at URL: http://www. msdn. microsoft. com/en-s/library/bb643323. aspx
  • Blelloch, G. E. , Cheng, P. , Gibbons, P. B. , Scalable room synchronizations. Theory of computing systems, vol. 36, no. 5, pp. 397-430, 2003.
  • IEEE 802. 11 Working Groups for Wireless LAN, available at URL: http://ieee802. org/11/, 2003
  • Jiang, J. R. , A group mutual exclusion algorithm for ad hoc mobile networks. In the proceedings of the 6th international conference on computer science and information, pp. 266-270, 2002.
  • Swaroop, A. , Singh, A. k. , From mutual exclusion to group mutual exclusion: a token based general scheme. In 2nd IEEE International conference on parallel, distributed and grid computing, pp. 645-650, 2012.
  • Sanders, B. A. , The information structure of distributed mutual exclusion algorithms. ACM transactions on computer systems, vol. 5, no. 3, pp. 284-299, 1987.
  • Helary, J. M. , Mostefaoui, A. , Raynal, M. , A general scheme for token- and tree based distributed mutual exclusion algorithms. IEEE transactions on parallel and distributed systems, vol. 5, no. 11, pp. 1185-1196, 1994.
  • Manabe, Y. , Baladoni, R. , Raynal, M. , Aoyagi, S. , k-arbiter: A safe and general scheme for h out of k mutual exclusion. Theoretical computer science, vol. 193, no. 1, pp. 97-112, 1998.
  • Mittal, N. , Mohan, P. K. , A priority-based distributed group mutual exclusion algorithm when group access is non-uniform. Journal of parallel and distributed computing, vol. 67, no. 7, pp. 795-815, 2007.