.png){kind=icon}
返回
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2012.07.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Distributed systems
Graph algorithms
Deployment optimization
Cloud computing
Mobile computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
PREPARATION OF Au-LOADED TiO2 BY PHOTOCHEMICAL DEPOSITION AND OZONE PHOTOCATALYTIC DECOMPOSITION
PREAI
分享收藏
分享收藏
查看更多内容