首页> 外文期刊>Journal of information & knowledge management >A Proximity and Semantic-Aware Optimisation Model for Sub-Domain-Based Decentralised Resource Discovery in Grid Computing
【24h】

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

机译:网格计算中基于子域的分散资源发现的一种接近语义优化模型

获取原文
获取原文并翻译 | 示例
           

摘要

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 Appro? priate 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.
机译:网格分散式资源发现服务的基本问题之一是高通信开销,这会严重影响网格系统的性能。理由是网格资源通过各种虚拟组织下的广域网在全球范围内进行地理分布。为了解决该问题,通过提出各种具有语义解决方案的分散式覆盖算法,已经做出了大量努力。当前的Grid文献表明,将语义特征添加到发现服务中时,发现资源的可能性会增加,并且通信开销可能会更好。但是,大多数现有的分散式资源发现模型利用基于域的语义本体和“先来先服务(FCFS)”基础调度来分配Grid资源,这可能导致运行时作业被拒绝并可以选择远离用户节点的资源。 。结果,模型的通信开销受到影响,因为在选择过程中未考虑邻近标准。为了克服这些问题并提高应用程序性能,我们提出了Appro?的接近度和语义相似度的统一。分布式资源发现模型中的优先资源选择(UPSARS)算法,方法是使用网格计算环境的子域本体结构。这种统一的目的是为用户作业(Gridlets)获取优化的资源,以便Grid Broker可以根据具有高度语义相关性的邻近性来选择最佳资源。该算法同时考虑了语义标准和邻近标准,并选择了邻近节点的资源,并根据邻近性和延迟减少了通信开销。我们使用GridSim和FreePastry仿真和建模工具包设计和实现模型。实验结果为减少通信开销和增强资源分配性能提供了有希望的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号