Mazen Farid1,3,*, Rohaya Latip1,2, Masnida Hussin1, Nor Asilah Wati Abdul Hamid1
CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 1529-1560, 2022, DOI:10.32604/cmc.2022.021410
Abstract One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation. The workflow scheduling involves assigning independent computational jobs with conflicting objectives to a set of virtual machines. Most optimization methods for solving non-deterministic polynomial-time hardness (NP-hard) problems deploy multi-objective algorithms. As such, Pareto dominance is one of the most efficient criteria for determining the best solutions within the Pareto front. However, the main drawback of this method is that it requires a reasonably long time to provide an optimum solution. In this paper, a new multi-objective minimum… More >
Login
Register
