一种多跳自组织移动网格资源发现和调度协议

A. A. Gomes, A. Ziviani, Luciana dos S. Lima, M. Endler
{"title":"一种多跳自组织移动网格资源发现和调度协议","authors":"A. A. Gomes, A. Ziviani, Luciana dos S. Lima, M. Endler","doi":"10.1109/CCGRID.2007.41","DOIUrl":null,"url":null,"abstract":"There has been a good amount of research over the past few years on the integration of mobile devices into computational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource discovery and scheduling protocol for mobility (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mobile grid, while mitigating the overhead of discovery messages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the protocol provides efficient load balancing between nodes under an increasing number of requests, and scales well with respect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids\",\"authors\":\"A. A. Gomes, A. Ziviani, Luciana dos S. Lima, M. Endler\",\"doi\":\"10.1109/CCGRID.2007.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There has been a good amount of research over the past few years on the integration of mobile devices into computational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource discovery and scheduling protocol for mobility (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mobile grid, while mitigating the overhead of discovery messages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the protocol provides efficient load balancing between nodes under an increasing number of requests, and scales well with respect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.\",\"PeriodicalId\":278535,\"journal\":{\"name\":\"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCGRID.2007.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGRID.2007.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

摘要

在过去的几年里,人们对移动设备与计算网格的集成进行了大量的研究。然而,其中很少涉及动态建立自发的多跳自组织移动网格这一更具挑战性的问题,而且只是初步的形式。在这样的网格中,资源发现和调度传统上在文献中是分开处理的。在我们看来,对于多跳自组织移动网格来说,这是一个不恰当的二分法。在本文中,我们提出了一种移动资源发现和调度协议(二分法),该协议允许在移动网格中资源最丰富的节点之间调度资源供应,同时减少了它们之间交换发现消息的开销。我们在测试平台和仿真平台上的实验结果表明,与传统的基于广播的服务发现解决方案相比,该协议在不断增加的请求数量下提供了有效的节点间负载平衡,并且在节点数量增加的情况下具有良好的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids
There has been a good amount of research over the past few years on the integration of mobile devices into computational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource discovery and scheduling protocol for mobility (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mobile grid, while mitigating the overhead of discovery messages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the protocol provides efficient load balancing between nodes under an increasing number of requests, and scales well with respect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信