|Table of Contents|

[1] Han Songqiao, Zhang Shensheng, Zhang Yong, Cao Jian, et al. Dynamic software allocation algorithm for saving powerin pervasive computing [J]. Journal of Southeast University (English Edition), 2007, 23 (2): 216-220. [doi:10.3969/j.issn.1003-7985.2007.02.013]
Copy

Dynamic software allocation algorithm for saving powerin pervasive computing()
普适计算中节约电量的动态软件部署算法
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
23
Issue:
2007 2
Page:
216-220
Research Field:
Computer Science and Engineering
Publishing date:
2007-06-30

Info

Title:
Dynamic software allocation algorithm for saving powerin pervasive computing
普适计算中节约电量的动态软件部署算法
Author(s):
Han Songqiao Zhang Shensheng Zhang Yong Cao Jian
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200240, China
韩松乔 张申生 张勇 曹健
上海交通大学计算机科学与工程系, 上海 200240
Keywords:
power aware software allocation code mobility graph theory pervasive computing
电量感知 软件部署 代码移动 图论 普适计算
PACS:
TP311
DOI:
10.3969/j.issn.1003-7985.2007.02.013
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.
为了节约移动设备的电量消耗, 提出了一种适合于普适计算环境的动态软件部署算法.综合考虑了软件组件的计算、通信和移动所消耗的费用, 建立了一个在移动设备和服务器间组件部署的电量消耗模型.在软件部署中同时也考虑了组件的移动性和组件间的移动关系.利用网络流理论, 将节约电量的最优化问题转化为一个流网络的最优分割问题, 而后者可采用最大流最小切割算法实现最优切分.实验结果表明提出的算法比现有算法能够节约更多的电量.

References:

[1] Weiser M.Some computer science issues in ubiquitous computing [J].Communications of the ACM, 1993, 36(7):75-84.
[2] Want R, Farkas K I, Narayanaswami C.Energy harvesting and conservation [J].IEEE Pervasive Computing, 2005, 4(1):14-17.
[3] Ahmed J, Chakrabarti C.A dynamic task scheduling algorithm for battery powered DVS systems [C]//Proc of IEEE International Symposium on Circuits and Systems.Vancouver, BC, Canada, 2004:813-816.
[4] Balan R, Flinn J, Satyanarayanan M, et al.The case for cyber foraging [C]//Proc of the 10th Workshop on ACM SIGOPS European Workshop.Saint-Emilion, France, 2002:87-92.
[5] Rudenko A, Reiher P, Popek G J, et al.The remote processing framework for portable computer power saving [C]//Proc of the ACM Symposium on Applied Computing.San Antonio, TX, USA, 1999:365-372.
[6] Li Z, Wang C, Xu R.Computation offloading to save energy on handheld devices:a partition scheme [C]//Proc of International Conference on Compilers, Architecture, and Synthesis for Embedded Systems.Atlanta, Georgia, USA, 2001:238-246.
[7] Flinn J, Satyanarayanan M.Managing battery lifetime with energy-aware adaptation [J].ACM Transactions on Computer Systems, 2004, 22(2):137-179.
[8] Fuggetta A, Picco G P, Vigna G.Understanding code mobility [J].IEEE Transactions on Software Engineering, 1998, 24(5):342-361.
[9] Li Z, Wang C, Xu R.Task Allocation for distributed multimedia processing on wirelessly networked handheld devices[C]//Proc of the 16th International Symposium on Parallel and Distributed Processing.Fort Lauderdale, Florida, USA, 2002:312-317.

Memo

Memo:
Biographies: Han Songqiao(1975—), male, graduate;Zhang Shen-sheng(corresponding author), male, doctor, professor, sszhang@sjtu.edu.cn.
Last Update: 2007-06-20