Share This Article:

A Fault Tolerance Algorithm for Resource Discovery in Semantic Grid Computing Using Task Agents

Abstract Full-Text HTML XML Download Download as PDF (Size:678KB) PP. 256-263
DOI: 10.4236/jsea.2014.74026    3,641 Downloads   4,611 Views   Citations


One of the interesting topics in grid computing systems is resources discovery. After the failure of a resource in a chain of resources made for a specific task in grid environment, discovering and finding a new resource that reconstructs the chain is an important topic. In this study, with defining new agent that is called task agent, and by proposing an algorithm, we will increase the fault tolerance against probable failure of a resource in the resource chain.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Barati, M. , Lotfi, S. and Rahmati, A. (2014) A Fault Tolerance Algorithm for Resource Discovery in Semantic Grid Computing Using Task Agents. Journal of Software Engineering and Applications, 7, 256-263. doi: 10.4236/jsea.2014.74026.


[1] Foster, I. and Kesselman, C. (1999) The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, Massachusetts.
[2] Jacobi, B., Brown, M., Fukui, K. and Trivedi, N. (2005) Introduction to Grid Computing, an IBM Redbook.
[3] Liangxiu, H. and Dave, B. (2008) Semantic-Supported and Agent-Based Decentralized Grid Resource Discovery. Future Generation Computer Systems, 24, 806-812. 2008.04.005
[4] Somasundaram, T.S., Balachandar, R.A., Kandasamy, V., Buyya, R., Raman, R., Mohanram, N. and Varun, S. (2006) Semantic-Based Grid Resource Discovery and Its Integration with the Grid Service Broker. Technical Report, GRIDS-TR-2006-10, Grid Computing and Distributed Systems Laboratory, The University of Melbourne, Melbourne, 84-89.
[5] Rahimzadeh, P., Barati, M. and alizadeh, R. (2010) A New Semantic-Supported and Agent-Based Decentralized Algorithm Forresource Discovery in Economic Grid. 3rd International Conference on Advanced Computer Theory and Engineering, Chengdu, 20-22 August 2010, V5-441-V5-445.
[6] Fensel, D. (2003) Ontologies: A Silver Bullet for Knowledge Management And Electronic Commerce. Springer, Berlin.
[7] Stuckenschmidt, H. (2002) Ontology-Based Information Sharing in Weakly Structured Environments. Ph.D. Thesis, AI Department, Vrije University, Amsterdam.
[8] Gruber, T.R. (2003) Toward Principles for the Design of Ontologies Used for Knowledge Sharing, KSL-93-04, Knowledge Systems Laboratory, Stanford University, Stanford.
[9] Andreasen, T., Bulskov, H. and Knappe, R. (2003) From Ontology over Similarity to Query Evaluation. In: Bernardi, R. and Moortgat, M., Eds., 2nd CoLogNET-ElsNET Symposium—Questions and Answers: Theoretical and Applied Perspectives, Amsterdam, Holland, 39-50.
[10] Resnik, O. (1999) Semantic Similarity in a Taxonomy: An Information-Based Measure and Its Application to Problems of Ambiguity and Natural Language. Journal of Artificial Intelligence Research, 11, 95-130.
[11] Richardson, R. , Smeaton, A. and Murphy, J. (1994) Using WordNet as A Knowledge Base for Measuring Semantic Similarity between Words. Technical Report Working paper CA-1294, School of Computer Applications, Dublin City University, Dublin.
[12] Rodriguez, M.A. and Egenhofer, M.J. (2003) Determining Semantic Similarity among entity classes from Different Ontologies. IEEE Transactions on Knowledge and Data Engineering, 15, 442-456.
[13] Seco, N., Veale, T. and Hayes, J. (2004) An Intrinsic Information Content Metric for Semantic Similarity in WordNet. Tech. Report, University College Dublin, Dublin.
[14] Tversky, A. (1977) Features of Similarity. Psychological Review, 84, 327-352.
[15] Watts, D.J. and Strogatz, S.H. (1998) Collective Dynamics of Small-World Networks. Nature, 393, 440-442.
[16] Watts, D.J. (1999) Networks, Dynamics, and the Small-World Phenomenon, American Journal of Sociology, 105, 493-527.

comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.