Answers are grounded in this paper and cite their sources.
Task Scheduling is one of the most challenging problems in cloud computing. It is an NP-Hard and plays an important role in optimizing the use of available resources. Recently, Multi-Objectives Genetic Algorithm (MOGA) is proposed for cloud tasks scheduling. However, the execution time of the GA is higher than Particle Swarm Optimization (PSO), and the convergence is slower. PSO converges fast because it can be implemented without too many parameters and operators. In this paper, Multi-Objectives PSO (MOPSO) and MOPSO with Importance Strategy (IS) (MOPSO_IS) algorithms are proposed. MOPSO algorithm is integrated with the IS to select the global best leader. Furthermore, incorporating a mutation operator in MOPSO_IS resolved the problem of premature convergence to the local Pareto-optimal front. The performance of the proposed algorithms was compared with MOGA and produced better results. The results of the experiments showed that the proposed MOPSO and MOPSO_IS significantly minimized the total task time and average task time and obtained better distribution for tasks on the available resources in a minimal time.
No takes yet. Share an insight, caveat, or question.
Abdullah et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: