A Dynamic Resource Management Scheme on P2P-Based Grid Systems

Efficient multi-dimensional data indexing mechanism is one of the fundamental requirement for Grid computing systems. Peer-to-peer organization of Grid resource discovery approach would have several desirable features, including high scalability, high reliability, self-organization and self-healing. Most of the research in this area only considers static resource.In this paper, we describe a tree vector indexing scheme for Grid systems, in order to support range queries and at the same time preserve the important attributes of grid systems.

Download Full-text

COOPERATIVE SELF-COMPOSITION AND DISCOVERY OF GRID SERVICES IN P2P NETWORKS

Parallel Processing Letters ◽

10.1142/s0129626408003430 ◽

2008 ◽

Vol 18 (03) ◽

pp. 329-346 ◽

Cited By ~ 5

Author(s):

EUGENIO ZIMEO ◽

ALBERTO TROISI ◽

HARRIS PAPADAKIS ◽

PARASKEVI FRAGOPOULOU ◽

AGOSTINO FORESTIERO ◽

...

Keyword(s):

Resource Discovery ◽

Network Partitioning ◽

P2p Networks ◽

Grid Services ◽

Grid Resource ◽

Grid Environment ◽

Grid Systems ◽

Semantic Grid ◽

Automatic Discovery ◽

Grid Resource Discovery

The desirable global scalability of Grid systems has steered the research towards the employment of the peer-to-peer (P2P) paradigm for the development of new resource discovery systems. As Grid systems mature, the requirements for such a mechanism have grown from simply locating the desired service to compose more than one service to achieve a goal. In Semantic Grid, resource discovery systems should also be able to automatically construct any desired service if it is not already present in the system, by using other, already existing services. In this paper, we present a novel system for the automatic discovery and composition of services, based on the P2P paradigm, having in mind (but not limited to) a Grid environment for the application. The paper improves composition and discovery by exploiting a novel network partitioning scheme for the decoupling of services that belong to different domains and an ant-inspired algorithm that places co-used services in neighbouring peers.

Download Full-text

Group Aware Semantic Matchmaker for Grid Resource Discovery

2009 International Conference on Advances in Recent Technologies in Communication and Computing ◽

10.1109/artcom.2009.181 ◽

2009 ◽

Author(s):

Bindu K.R. ◽

S. Mary Saira Bhanu

Keyword(s):

Resource Discovery ◽

Grid Resource ◽

Grid Resource Discovery

Download Full-text

Grid Resource Discovery Model Based on Improved Architecture and Multicast

2009 Eighth International Conference on Grid and Cooperative Computing ◽

10.1109/gcc.2009.12 ◽

2009 ◽

Author(s):

Qiuyu Zhang ◽

Zan Qiao ◽

Zhanting Yuan

Keyword(s):

Resource Discovery ◽

Grid Resource ◽

Model Based ◽

Grid Resource Discovery

Download Full-text

A Weight-based Query Forwarding Technique for Super-peer-based Grid Resource Discovery

Engineering, Technology & Applied Science Research ◽

10.48084/etasr.952 ◽

2017 ◽

Vol 7 (1) ◽

pp. 1398-1404

Author(s):

M. Mollamotalebi ◽

R. Maghami ◽

A. S. Ismail

Keyword(s):

Response Time ◽

Resource Discovery ◽

Search Process ◽

Grid Resource ◽

Grid Environment ◽

Grid Applications ◽

Computing Environments ◽

Grid Resources ◽

Grid Resource Discovery ◽

Super Peer

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.

Download Full-text