.png){kind=icon}
返回
Using the TSP Solution Strategy for Cloudlet Scheduling in Cloud Computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s10922-018-9469-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cloudlet scheduling in cloud computing is one of the most issues that face the cloud computing environment. This paper presents a new efficient approach, called Traveling Salesman Approach for Cloudlet Scheduling (TSACS), to solve the cloudlet-scheduling problem. The main idea is to convert the cloudlet-scheduling problem into an instance of the Traveling Salesman Problem (TSP) and then apply one of the TSP solution strategies to solve the problem. The proposed approach consists of three phases: clustering phase, converting phase, and assignment phase. In the clustering phase, the proposed approach converts the large size cloudlet-scheduling problem into a small size cluster-scheduling problem to minimize computation time complexity of the proposed approach. In the converting phase, the approach forms the cluster-scheduling problem as an instance of the TSP. In the assignment phase, the approach schedules the clusters into the available virtual machines by using the nearest neighbor algorithm. The proposed approach is evaluated by using the CloudSim and the results are compared with that obtained by the most recent algorithms. The results show that the proposed approach enhances the overall system performance in terms of schedule length, balancing degree, and time complexity. In addition, the proposed TSACS overcomes the oscillation problem of the existing cloudlet-scheduling algorithms.
Keyword:
Cloudlet-scheduling
Nearest neighbor algorithm
Makespan
Load balancing
Oscillation problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
1.0K
被引数:
1.3K
机构
引用论文
A drug repurposing screen identifies hepatitis C antivirals as inhibitors of the SARS-CoV2 main protease.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏Towards the entropy of gravity time-dependent models via the Cardy-Verlinde formula通过Cardy-Verlinde公式研究引力时变模型的熵
OAAI
OAAI分享收藏
查看更多内容