首页 | 本学科首页   官方微博 | 高级检索  
     检索      

普适计算中节约电量的动态软件部署算法
引用本文:韩松乔,张申生,张勇,曹健.普适计算中节约电量的动态软件部署算法[J].东南大学学报,2007,23(2):216-220.
作者姓名:韩松乔  张申生  张勇  曹健
作者单位:上海交通大学计算机科学与工程系 上海200240
基金项目:国家自然科学基金,上海市科委资助项目
摘    要:为了节约移动设备的电量消耗,提出了一种适合于普适计算环境的动态软件部署算法.综合考虑了软件组件的计算、通信和移动所消耗的费用,建立了一个在移动设备和服务器间组件部署的电量消耗模型.在软件部署中同时也考虑了组件的移动性和组件间的移动关系.利用网络流理论,将节约电量的最优化问题转化为一个流网络的最优分割问题,而后者可采用最大流最小切割算法实现最优切分.实验结果表明提出的算法比现有算法能够节约更多的电量.

关 键 词:电量感知  软件部署  代码移动  图论  普适计算
修稿时间:2006-10-30

Dynamic software allocation algorithm for saving power in pervasive computing
Han Songqiao,Zhang Shensheng,Zhang Yong,Cao Jian.Dynamic software allocation algorithm for saving power in pervasive computing[J].Journal of Southeast University(English Edition),2007,23(2):216-220.
Authors:Han Songqiao  Zhang Shensheng  Zhang Yong  Cao Jian
Institution:Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200240, China
Abstract:A novel dynamic software allocation algorithm suitable for pervasive computing environments is proposed to minimize power consumption of mobile devices.Considering the power cost incurred by the computation,communication and migration of software components,a power consumption model of component assignments between a mobile device and a server is set up.Also,the mobility of components and the mobility relationships between components are taken into account in software allocation.By using network flow theory,the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max-flow min-cut algorithm.Simulation results show that the proposed algorithm can save significantly more energy than existing algorithms.
Keywords:power aware  software allocation  code mobility  graph theory  pervasive computing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号