期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2017
卷号：95
期号：1
出版社：Journal of Theoretical and Applied
摘要：Resource allocation in cloud computing systems is getting more complex and demanding due to the increasing requirements for cloud-based services. Scheduling services using a limited number of resources is problem that has been under study since the evolution of cloud computing. However, there are several open areas for improvements due to the large number of optimization variables. In this work, we intend to presents an algorithm to solve the fundamental problem of multiple tasks resource allocation that are to be scheduled on available services. Several resources will be considered where the cost of available services will depend the computational complexity needed for every service. The proposed algorithm can be applied without constraints on cost or execution time vectors as opposed to most practical and recent existing algorithms. The proposed algorithm is illustrated on two different examples. In addition, the algorithm as implemented and simulated in order to validate its correctness. The experimental results conducting using the proposed method proofs that the algorithm runs in linear time vs. different design parameters. The main limitation of the proposed algorithm is that it is only applicable to the scheduling problem of multiple tasks that has one price vector and one execution time vector. However, providing optimum solution for this particular case, can be helpful in designing heuristic based methods for cloud services are actually run with multiple users with multiple tasks, which requires initial solutions that are usually obtained based on guess or generated randomly.
