A new decentralized method is proposed to resource discovery in Grid computing systems. This agent-based method supports semantic description and is flexible for resource identification and allocation. It allows each of the individual resource agents to interact only with its neighbor agents semantically and form a resource chain for a specific task dynamically. We discuss about the success of probability of our method under different task loading rates and compare it with some other known Algorithms. The experiments show the algorithm could flexibly and dynamically discover resources.
목차
Abstract 1. Introduction 2. Definitions and Primary Concepts 2.1. Connected Components 2.2. Ontology and Semantic Similarity Function 2.3. Model Description 2.4. Resource Agent 3. Proposed Algorithm 3.1. Constructing Primary Resources Chain 3.2. Removing Superfluous Nodes 4. The Simulation Results 4.1. The Relationship between Task Success Probability under Different Levels Task Complexity and Different Task Load Rates 4.2. The Relationship between Success Probability and Increasing the Number of Nodes 5. Conclusions and Future Works References
키워드
Grid computingRecourse agentRecourse discovery
저자
Masoud Barati [ Department of Computer science Islamic Azad University- Kangavar branch Kangavar, Iran ]
Rahim Alizadeh [ Department of Mathematics, Shahed University P.O.Box:18151-159, Tehran, Iran ]
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.7 No.2