Abstract The very first phase in software partitioning is to choose an appropriate clustering methodology before moving the clusters to multiple computational nodes since this stage can impact on the distribution of clusters and eventually on the performance of the overall application. In pervasive computing environments, certain memory and cpu intensive applications would prefer to use the computational nodes (anything with at least networking, storage and cpu capabilities) available in the environment. To this end, this paper investigates the very specific area of clustering or partitioning an object-oriented application running on mobile devices. Graph theory has been used to model an application and a cluster analysis algorithm has been proposed. Details about the implementation are covered, followed by a laboratory application partitioning using the proposed approach. Researchers and software designers willing to investigate software partitioning can consider this practical and easy implementable approach.
[1]
Markus C Dahm.
Doorastha A step towards distribution transparency
,
2000
.
[2]
Mark Weiser.
The computer for the 21st century
,
1991
.
[3]
Ichiro Satoh.
Dynamic deployment of pervasive services
,
2005,
ICPS '05. Proceedings. International Conference on Pervasive Services, 2005..
[4]
Michael Philippsen,et al.
JavaParty – transparent remote objects in Java
,
1997
.
[5]
M. Muztaba Fuad,et al.
AdJava - Automatic Distribution of Java Applications
,
2002,
ACSC.
[6]
Yung-Hsiang Lu,et al.
Cloud Computing for Mobile Users: Can Offloading Computation Save Energy?
,
2010,
Computer.
[7]
Nawaz Mohamudally,et al.
A Practical Approach to Partition Applications in Pervasive Computing Environments
,
2015,
FNC/MobiSPC.