Graph partitioning algorithms for optimizing software deployment in mobile cloud computing

► Algorithms for partitioning software on the cloud are presented. ► KL-based algorithm allows fast partitioning for realtime use. ► Simulated annealing improves solution quality at the cost of computation capacity. ► Hybrid approach combines both. ► Comparison to METIS shows our algorithms find 10%-40% better graph cuts.