Resource Utilization in Cloud Computing as an Optimization Problem
Resource Utilization in Cloud Computing as an Optimization Problem
复制标题
云计算中的资源利用作为优化问题
DOI：
10.14569/ijacsa.2016.070643
复制
发表时间：
2016
影响因子：
0.9
通讯作者：
Azzam Sleit
中科院分区：
文献类型：
--
作者：
A. Al;Hebatallah Khattab;A. Sharieh;Azzam Sleit
提出了一种基于贪婪算法的云计算资源利用问题求解算法。假设为大量用户提供服务的私有云。对于一个给定的资源，随着时间的推移，世界各地的不同用户通过互联网使用该资源的请求会积累数百或数千个。还假定预先知道使用该资源的请求。主要关注的是找到一个给定的资源的最佳利用时间表，通过利用该资源获得的利润，以及资源将被利用的时间片的数量。证明了该问题是一个NP完全问题。提出了一种贪婪算法，并分析了其运行时的复杂性。建议的解决方案是基于0/1背包问题和活动选择问题的组合。该算法使用Java实现。结果表明，性能良好，运行时间复杂度为O（（F-S）nLogn）
In this paper, an algorithm for resource utilization problem in cloud computing based on greedy method is presented. A privately-owned cloud that provides services to a huge number of users is assumed. For a given resource, hundreds or thousands of requests accumulate over time to use that resource by different users worldwide via the Internet. A prior knowledge of the requests to use that resource is also assumed. The main concern is to find the best utilization schedule for a given resource in terms of profit obtained by utilizing that resource, and the number of time slices during which the resource will be utilized. The problem is proved to be an NP-Complete problem. A greedy algorithm is proposed and analyzed in terms of its runtime complexity. The proposed solution is based on a combination of the 0/1 Knapsack problem and the activity-selection problem. The algorithm is implemented using Java. Results show good performance with a runtime complexity O((F-S)nLogn)