A Study of Grid Resource Management Model Based on Ant Colony Algorithm

2011 ◽  
Vol 211-212 ◽  
pp. 918-924
Author(s):  
Xian Chun Zou ◽  
Yan Ma ◽  
Ning Song

This paper analyzes grid resources organization, elaborates on the fundamental principles of the Ant Colony Algorithm, and proposes a grid resource discovery method based on the Ant Colony Algorithm. We consider users request ontology as ants, take search resource as food, and food source is the node of search target. The process of ants to find food is similar to the process of discovery grid resources.

2011 ◽  
Vol 63-64 ◽  
pp. 41-46
Author(s):  
Yan Ma ◽  
Yuan Yuan Liang ◽  
Xiao Ping Jiang

This paper analyzes the basic principles of ant colony algorithm,Grid Resource Discovery Method is proposed based on the ant colony algorithm. Applying the domain to organize grid resource, and keeping the dynamic resource up to date by adding the domain node and updates. Using the improved ant colony algorithm to discover the inter-domain resource, avoid repeated search process, and achieve quick search of resources.


2017 ◽  
Vol 7 (1) ◽  
pp. 1398-1404
Author(s):  
M. Mollamotalebi ◽  
R. Maghami ◽  
A. S. Ismail

Grid computing environments include heterogeneous resources shared by a large number of computers to handle data and process intensive applications. The required resources must be accessible for the grid applications on demand, which makes resource discovery a critical service. In recent years, different techniques are provided to index and discover grid resources. Response time and message load during the search process highly affect the efficiency of resource discovery. This paper proposes a technique to forward the queries based on the resource types accessible through each neighbor in super-peer-based grid resource discovery approaches. The proposed technique is simulated in GridSim and the experimental results indicated that it is able to reduce the response time and message load during the search process especially when the grid environment contains a large number of nodes.


2011 ◽  
Vol 271-273 ◽  
pp. 340-343
Author(s):  
Lei Chen

To solve the Grid resource discovery framework problem, this paper proposes the resource discovery mechanism based on Peer-to-Peer (P2P). The mechanism introduces the concept of super-node (SN) and virtual organization (VO), which combines both the advantage of decentralized and centralized resource discovery, and makes up a layered resource management model: SN manages user and storages resource information by MDS(Meta Data Service) mechanism in the VO; a P2P virtual level is composed of a large amount of peer service (PS) among VOs, which utilizes the querying and transmitting policy based on historical information and control the diffusion algorithm in resource discovery mechanism. And the simulation shows that the algorithm can find the most suitable resources and improve resource discovery efficiency.


2011 ◽  
Vol E94-D (4) ◽  
pp. 913-916
Author(s):  
Yuan LIN ◽  
Siwei LUO ◽  
Guohao LU ◽  
Zhe WANG

Sign in / Sign up

Export Citation Format

Share Document