A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
MCAMC: minimizing the cost and makespan of cloud service using non-dominated sorting genetic algorithm-II
2019
Sadhana (Bangalore)
The number of cloud users and their aspiration for completion of tasks at less energy consumption and operating cost are rapidly increasing. Hence, the authors of this paper aim to minimize the makespan and operating cost by optimally scheduling the tasks and allocating the resources of cloud service. The optimum task scheduling and resource allocation are obtained for each objective function using the simple genetic algorithm. Further, the non-dominated solutions of the dual objectives are
doi:10.1007/s12046-019-1200-3
fatcat:bpqmbmjou5ajhfywgt4dkv3cyy