A Generic Software Partitioning Algorithm for Pervasive Computing
- Cite this paper as:
- Han S., Zhang S., Zhang Y. (2006) A Generic Software Partitioning Algorithm for Pervasive Computing. In: Cheng X., Li W., Znati T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg
The ever-changing context and resource limitation of mobile devices and wireless network are two challenges in the development of pervasive computing application. In this paper, we present a generic optimal partitioning algorithm of mobile applications which tries to overcome the two obstacles. The algorithm can reallocate the components of an application among machines for saving resources according to the environment variations. For each resource, we construct a corresponding cost graph, involving computation cost, communication cost and migration cost, in the foundation of the software architecture. Based on the network flow theory, we transform the cost graph into an equivalent flow network that can be optimally cut by well-known Max-flow Min-cut algorithm. As a generic algorithm, the proposed algorithm can be applied to save network bandwidth, time or energy. In addition, it can elegantly allocate the software components among the two machines so as to balance multiple resource consumptions. The simulation results demonstrate the validity and effectiveness of the proposed algorithm.
KeywordsSoftware partitioning Algorithm Pervasive computing
Unable to display preview. Download preview PDF.