A linear-time heuristic for improving network partitions
25 years of DAC Papers on Twenty-five years of electronic design automation
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A systematic procedure for setting parameters in simulated annealing algorithms
Computers and Operations Research
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Mesh Partitioning for Efficient Use of Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs
IEEE Transactions on Computers
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An effective offloading middleware for pervasive services on mobile devices
Pervasive and Mobile Computing
A PROBE-Based Heuristic for Graph Partitioning
IEEE Transactions on Computers
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
Future Generation Computer Systems
A New Multi-level Algorithm Based on Particle Swarm Optimization for Bisecting Graph
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Future Generation Computer Systems
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Graph partitioning and disturbed diffusion
Parallel Computing
An effective multi-level algorithm based on ant colony optimization for bisecting graph
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
An effective multi-level algorithm based on simulated annealing for bisecting graph
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Dynamic deployment and quality adaptation for mobile augmented reality applications
Journal of Systems and Software
A heuristic algorithm for mapping parallel applications on computational grids
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Cloudlets: bringing the cloud to the mobile user
Proceedings of the third ACM workshop on Mobile cloud computing and services
Pragmatic assessment of research intensive areas in cloud: a systematic review
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important to optimize the deployment, by minimizing the network usage. Therefore we have designed and evaluated graph partitioning algorithms that allocate software components to machines in the cloud while minimizing the required bandwidth. Contrary to the traditional graph partitioning problem our algorithms are not restricted to balanced partitions and take into account infrastructure heterogenity. To benchmark our algorithms we evaluated their performance and found they produce 10%-40% smaller graph cut sizes than METIS 4.0 for typical mobile computing scenarios.