A Proximity and Semantic-Aware Optimisation Model for Sub-Domain-Based Decentralised Resource Discovery in Grid Computing

Abdul Khalique Shaikh, Saadat M. Alhashmi, Rajendran Parthiban

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

One of the fundamental issues in Grid decentralised resource discovery services is high communication overheads that affect the Grid system's performance significantly. The rationale is that Grid resources are geographically distributed across the world through a wide area network under various virtual organisations. To address the issue, a significant amount of effort has been made by proposing various decentralised overlay algorithms with semantic solutions. Current Grid literature reveals that when semantic features are added into discovery services, the probability of finding resources is enhanced and communication overheads could be better. However, most of the existing decentralised resource discovery models utilise a domain-based semantic ontology with First Come First Serve (FCFS) basis scheduling for allocating Grid resources that can cause job rejection at run time and can pick resources that are far from the user nodes. As a result, communication overheads of the models are affected as the proximity criterion is not being considered in the selection process. To overcome these issues and enhance the application performance, we propose a Unification of Proximity and Semantic similarity for Appropriate Resource Selection (UPSARS) algorithm in a decentralised resource discovery model by using a sub-domain ontology structure for Grid computing environments. The purpose of this unification is to get optimised resources for user jobs (Gridlets) so that Grid brokers could select optimum resources in terms of proximity with high semantic relevancy. The algorithm considers both semantic and proximity criteria and selects the nearby nodes resources and reduces the communication overheads in terms of proximity and latency. We design and implement the model using the GridSim and the FreePastry simulation and modelling toolkits. The experimental results provide promising outcomes to reduce communication overheads and enhance resource allocation performance.

Original languageEnglish
Article number1650020
JournalJournal of Information and Knowledge Management
Volume15
Issue number2
DOIs
Publication statusPublished - Jun 1 2016

Fingerprint

Grid computing
optimization model
Semantics
semantics
resources
Communication
Ontology
communication
Wide area networks
ontology
Resource allocation
Scheduling
performance
scheduling

Keywords

  • decentralised resource discovery
  • FreePastry
  • Grid computing
  • GridSim
  • proximity, semantic

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Library and Information Sciences

Cite this

A Proximity and Semantic-Aware Optimisation Model for Sub-Domain-Based Decentralised Resource Discovery in Grid Computing. / Shaikh, Abdul Khalique; Alhashmi, Saadat M.; Parthiban, Rajendran.

In: Journal of Information and Knowledge Management, Vol. 15, No. 2, 1650020, 01.06.2016.

Research output: Contribution to journalArticle

@article{4a4325588cea4a639880833c8b658f13,
title = "A Proximity and Semantic-Aware Optimisation Model for Sub-Domain-Based Decentralised Resource Discovery in Grid Computing",
abstract = "One of the fundamental issues in Grid decentralised resource discovery services is high communication overheads that affect the Grid system's performance significantly. The rationale is that Grid resources are geographically distributed across the world through a wide area network under various virtual organisations. To address the issue, a significant amount of effort has been made by proposing various decentralised overlay algorithms with semantic solutions. Current Grid literature reveals that when semantic features are added into discovery services, the probability of finding resources is enhanced and communication overheads could be better. However, most of the existing decentralised resource discovery models utilise a domain-based semantic ontology with First Come First Serve (FCFS) basis scheduling for allocating Grid resources that can cause job rejection at run time and can pick resources that are far from the user nodes. As a result, communication overheads of the models are affected as the proximity criterion is not being considered in the selection process. To overcome these issues and enhance the application performance, we propose a Unification of Proximity and Semantic similarity for Appropriate Resource Selection (UPSARS) algorithm in a decentralised resource discovery model by using a sub-domain ontology structure for Grid computing environments. The purpose of this unification is to get optimised resources for user jobs (Gridlets) so that Grid brokers could select optimum resources in terms of proximity with high semantic relevancy. The algorithm considers both semantic and proximity criteria and selects the nearby nodes resources and reduces the communication overheads in terms of proximity and latency. We design and implement the model using the GridSim and the FreePastry simulation and modelling toolkits. The experimental results provide promising outcomes to reduce communication overheads and enhance resource allocation performance.",
keywords = "decentralised resource discovery, FreePastry, Grid computing, GridSim, proximity, semantic",
author = "Shaikh, {Abdul Khalique} and Alhashmi, {Saadat M.} and Rajendran Parthiban",
year = "2016",
month = "6",
day = "1",
doi = "10.1142/S0219649216500209",
language = "English",
volume = "15",
journal = "Journal of Information and Knowledge Management",
issn = "0219-6492",
publisher = "World Scientific Publishing Co.",
number = "2",

}

TY - JOUR

T1 - A Proximity and Semantic-Aware Optimisation Model for Sub-Domain-Based Decentralised Resource Discovery in Grid Computing

AU - Shaikh, Abdul Khalique

AU - Alhashmi, Saadat M.

AU - Parthiban, Rajendran

PY - 2016/6/1

Y1 - 2016/6/1

N2 - One of the fundamental issues in Grid decentralised resource discovery services is high communication overheads that affect the Grid system's performance significantly. The rationale is that Grid resources are geographically distributed across the world through a wide area network under various virtual organisations. To address the issue, a significant amount of effort has been made by proposing various decentralised overlay algorithms with semantic solutions. Current Grid literature reveals that when semantic features are added into discovery services, the probability of finding resources is enhanced and communication overheads could be better. However, most of the existing decentralised resource discovery models utilise a domain-based semantic ontology with First Come First Serve (FCFS) basis scheduling for allocating Grid resources that can cause job rejection at run time and can pick resources that are far from the user nodes. As a result, communication overheads of the models are affected as the proximity criterion is not being considered in the selection process. To overcome these issues and enhance the application performance, we propose a Unification of Proximity and Semantic similarity for Appropriate Resource Selection (UPSARS) algorithm in a decentralised resource discovery model by using a sub-domain ontology structure for Grid computing environments. The purpose of this unification is to get optimised resources for user jobs (Gridlets) so that Grid brokers could select optimum resources in terms of proximity with high semantic relevancy. The algorithm considers both semantic and proximity criteria and selects the nearby nodes resources and reduces the communication overheads in terms of proximity and latency. We design and implement the model using the GridSim and the FreePastry simulation and modelling toolkits. The experimental results provide promising outcomes to reduce communication overheads and enhance resource allocation performance.

AB - One of the fundamental issues in Grid decentralised resource discovery services is high communication overheads that affect the Grid system's performance significantly. The rationale is that Grid resources are geographically distributed across the world through a wide area network under various virtual organisations. To address the issue, a significant amount of effort has been made by proposing various decentralised overlay algorithms with semantic solutions. Current Grid literature reveals that when semantic features are added into discovery services, the probability of finding resources is enhanced and communication overheads could be better. However, most of the existing decentralised resource discovery models utilise a domain-based semantic ontology with First Come First Serve (FCFS) basis scheduling for allocating Grid resources that can cause job rejection at run time and can pick resources that are far from the user nodes. As a result, communication overheads of the models are affected as the proximity criterion is not being considered in the selection process. To overcome these issues and enhance the application performance, we propose a Unification of Proximity and Semantic similarity for Appropriate Resource Selection (UPSARS) algorithm in a decentralised resource discovery model by using a sub-domain ontology structure for Grid computing environments. The purpose of this unification is to get optimised resources for user jobs (Gridlets) so that Grid brokers could select optimum resources in terms of proximity with high semantic relevancy. The algorithm considers both semantic and proximity criteria and selects the nearby nodes resources and reduces the communication overheads in terms of proximity and latency. We design and implement the model using the GridSim and the FreePastry simulation and modelling toolkits. The experimental results provide promising outcomes to reduce communication overheads and enhance resource allocation performance.

KW - decentralised resource discovery

KW - FreePastry

KW - Grid computing

KW - GridSim

KW - proximity, semantic

UR - http://www.scopus.com/inward/record.url?scp=84964522889&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964522889&partnerID=8YFLogxK

U2 - 10.1142/S0219649216500209

DO - 10.1142/S0219649216500209

M3 - Article

VL - 15

JO - Journal of Information and Knowledge Management

JF - Journal of Information and Knowledge Management

SN - 0219-6492

IS - 2

M1 - 1650020

ER -