A Broker-Based Approach to Resource Discovery and Selection in Grid Environments

2008 ◽  
Author(s):  
N. Malarvizhi ◽  
V. Rhymend Uthariaraj
Keyword(s):  
Resource Discovery ◽  
Grid Environments

Resource discovery and management in computational GRID environments

2006 ◽  
Vol 19 (6) ◽  
pp. 639-657 ◽  
Author(s):  
Alan Bradley ◽  
Kevin Curran ◽  
Gerard Parr
Keyword(s):  
Computational Grid ◽  
Resource Discovery ◽  
Grid Environments

scholarly journals THE EFFICIENCY CHALLENGES OF RESOURCE DISCOVERY IN GRID ENVIRONMENTS

2014 ◽  
Vol 45 (8) ◽  
pp. 671-692
Author(s):  
Mahdi MollaMotalebi ◽  
Raheleh Maghami ◽  
Abdul Samad Ismail ◽  
Alireza Poshtkohi
Keyword(s):  
Resource Discovery ◽  
Grid Environments

C-HLRD: a category-based hierarchical localisation technique for resource discovery in grid environments

2013 ◽  
Vol 9 (3) ◽  
pp. 268 ◽  
Author(s):  
Mahdi MollaMotalebi ◽  
Abdul Samad Ismail ◽  
Aboamama Atahar Ahmed
Keyword(s):  
Resource Discovery ◽  
Grid Environments

scholarly journals Optimizing Resource Discovery Technique in the P2P Grid Systems

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Wang Tun ◽  
J. Pourqasem ◽  
S. A. Edalatpanah
Keyword(s):  
Response Time ◽  
Resource Discovery ◽  
Point Of View ◽  
Main Concept ◽  
Hop Count ◽  
Grid Systems ◽  
Discovery Service ◽  
Grid Environments ◽  
Super Peer ◽  
Routing Index

Distributed discovery service is a main concept in the scalable and dynamic grid environments. In this paper, based on the super-peer technique, we propose a new topology for the grid discovery service. The model is designed in such a way that each super-peer within the cluster has the routing indices (RIs) based on cobweb and uses the hop-count routing index (HRI) to select the best neighbor. Besides, each super-peer includes a cache table, which stores the query and the query results. Furthermore, from the point of view of the response time and the number of submitted messages, we compare the new model with an existing method. An illustrative simulation is also presented to show the efficiency and validation of the new technique.

Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions

2011 ◽  
Vol 2 (3) ◽  
pp. 19-36
Author(s):  
Stelios Sotiriadis ◽  
Nik Bessis ◽  
Ye Huang ◽  
Paul Sant ◽  
Carsten Maple
Keyword(s):  
Resource Discovery ◽  
Virtual Organizations ◽  
Communication Overhead ◽  
Critical Friends ◽  
Community Model ◽  
Grid Environments ◽  
Minimum Requirements ◽  
Selection Decision

This paper focuses on defining the minimum requirements to support the inter-cooperation between various scales, dynamically evolved Virtual Organizations (VOs). This proposed method is able to assign a weighted value to each pair-wise path that each member (node) can select in order to locate neighbouring nodes according to their preferences. The method also takes into account the communication overhead between each node interaction. The weight of each path is to be measured by the analysis of prerequisites in order to achieve a mutually agreed interaction between nodes. Requirements are defined as the least parameters or conditions that a node needs to achieve in order to determine its accessibility factor. The motivation behind this work is the vision of the Critical Friends Community model, which is a suitable topology for interoperable grid environments. The topology suggests that capturing inter-cooperated nodes interactions that can be publicly available could lead to knowledge of neighbouring VO members which, in turn, could be used for facilitating a more effective resource discovery and selection decision.

Sign in / Sign up

Export Citation Format

Share Document