移动自组织计算网格中的能源高效资源分配

Sayed Chhattan Shah, Myong-Soon Park
{"title":"移动自组织计算网格中的能源高效资源分配","authors":"Sayed Chhattan Shah, Myong-Soon Park","doi":"10.1109/COMSNETS.2011.5716409","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Energy efficient resource allocation in mobile ad hoc computational grids\",\"authors\":\"Sayed Chhattan Shah, Myong-Soon Park\",\"doi\":\"10.1109/COMSNETS.2011.5716409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.\",\"PeriodicalId\":302678,\"journal\":{\"name\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2011.5716409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2011.5716409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了移动自组织计算网格中相互依赖任务的高效资源分配问题。相互依赖的任务可能交换大量的数据,并消耗与任务之间交换的数据量成正比的能量。如果不能有效地分配任务,那么能耗和通信成本就会显著增加。能耗增加会限制节点的寿命,并可能导致节点掉电,不仅影响节点上的任务执行,还会以各种方式影响其他任务。此外,电网中的移动节点是由电池驱动的,因此应该有效地利用有限的功率。本文提出了一种基于混合功率的资源分配方案,以降低相互依赖任务之间的能耗和通信成本。其基本思想是利用依赖关系和任务类型,并将相互依赖的任务分配给以最小传输功率级别可访问的节点。我们还提出了一种基于功率的算法来找到一组最近的节点来分配一组相互依赖的任务。与传统算法相比,该算法的复杂度取决于传输功率等级的数量,而不是取决于电网内节点的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy efficient resource allocation in mobile ad hoc computational grids
This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信