一种基于提前预约的探针反馈机制资源发现算法

Jianqun Cui, Yanxiang He, Libing Wu, Fei Li
{"title":"一种基于提前预约的探针反馈机制资源发现算法","authors":"Jianqun Cui, Yanxiang He, Libing Wu, Fei Li","doi":"10.1109/GCC.2006.16","DOIUrl":null,"url":null,"abstract":"Resource discovery is a challenging problem in grid computing because computational resources are large-scale geographically distributed. Traditional decentralized resource discovery algorithms often focus on the searching method in forwarding direction. Response message is just used to report the matching node or matching failure. In this paper, a new resource discovery algorithm is introduced. Under this mechanism, request message and corresponding response message may choose different path to destination node. So we add probe feedback mechanism in response message to rediscovery requested resource if the resource can't be found in forwarding path. It provides more chances to satisfy the request. Furthermore, if advance reservation is supported by environment, response message can return the node which can provide matching resource firstly in near future if there are still no suitable resources in rediscovery period. Simulation shows that it can improve the performance of resource discovery especially when the job size is large and turn-around time is not very important to users","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Resource Discovery Algorithm with Probe Feedback Mechanism Based on Advance Reservation\",\"authors\":\"Jianqun Cui, Yanxiang He, Libing Wu, Fei Li\",\"doi\":\"10.1109/GCC.2006.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Resource discovery is a challenging problem in grid computing because computational resources are large-scale geographically distributed. Traditional decentralized resource discovery algorithms often focus on the searching method in forwarding direction. Response message is just used to report the matching node or matching failure. In this paper, a new resource discovery algorithm is introduced. Under this mechanism, request message and corresponding response message may choose different path to destination node. So we add probe feedback mechanism in response message to rediscovery requested resource if the resource can't be found in forwarding path. It provides more chances to satisfy the request. Furthermore, if advance reservation is supported by environment, response message can return the node which can provide matching resource firstly in near future if there are still no suitable resources in rediscovery period. Simulation shows that it can improve the performance of resource discovery especially when the job size is large and turn-around time is not very important to users\",\"PeriodicalId\":280249,\"journal\":{\"name\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCC.2006.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

由于计算资源是大规模地理分布的,资源发现是网格计算中的一个具有挑战性的问题。传统的分散资源发现算法往往侧重于转发方向的搜索方法。响应消息仅用于报告匹配节点或匹配失败。本文提出了一种新的资源发现算法。在这种机制下,请求消息和相应的响应消息可能选择不同的路径到达目的节点。因此,我们在响应消息中加入探测反馈机制,以便在转发路径中找不到请求的资源时重新发现请求的资源。它提供了更多的机会来满足要求。另外,如果环境支持提前预约,如果在重新发现期间仍然没有合适的资源,响应消息可以在不久的将来返回最先提供匹配资源的节点。仿真结果表明,该方法可以提高资源发现的性能,特别是在作业规模较大且周转时间对用户不太重要的情况下
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Resource Discovery Algorithm with Probe Feedback Mechanism Based on Advance Reservation
Resource discovery is a challenging problem in grid computing because computational resources are large-scale geographically distributed. Traditional decentralized resource discovery algorithms often focus on the searching method in forwarding direction. Response message is just used to report the matching node or matching failure. In this paper, a new resource discovery algorithm is introduced. Under this mechanism, request message and corresponding response message may choose different path to destination node. So we add probe feedback mechanism in response message to rediscovery requested resource if the resource can't be found in forwarding path. It provides more chances to satisfy the request. Furthermore, if advance reservation is supported by environment, response message can return the node which can provide matching resource firstly in near future if there are still no suitable resources in rediscovery period. Simulation shows that it can improve the performance of resource discovery especially when the job size is large and turn-around time is not very important to users
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信