Abstract: The limited battery life is a big obstacle for the further growth of mobile devices, so a new dynamic application partitioning algorithm was proposed to minimize power consumption of mobile devices by offloading its computation to a remote resource-rich server. An Object Relation Graph (ORG) for such an application was set up, and then it was transformed into a network. By using network flow theory, the optimization problem of power consumption was transformed into the optimal bipartition problem of a flow network which can be partitioned by the max-flow min-cut algorithm. The simulation results show that the proposed algorithm can greatly save more energy than the existing algorithms, and better adapt to environment changes.

Key words: code offloading, application partitioning, mobile device, energy save, max-flow min-cut

摘要： 针对移动设备电量有限严重影响其发展的问题，提出一种应用于移动计算环境的动态程序分割算法。考虑了将移动设备的部分代码通过无线网络迁移到资源丰富的服务器上执行以节约移动设备电量消耗，建立了程序对象关系图，进一步将其转化成流网络；利用网络流理论，采用最大流最小切割算法实现流网络的最优切分。实验结果表明提出的算法不仅比现有算法节约更多电量，而且能适应易变的网络环境。

关键词: 代码卸载, 程序分割, 移动设备, 节约能耗, 最大流最小切