Multi‐objective task scheduling in cloud computing. (30th July 2022)

• Record Type: Journal Article
• Authors: Malti, Arslan Nedhir; Hakem, Mourad; Benmammar, Badr
• Is Part Of: Concurrency and computation. Volume 34:Number 25(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2022-07-30
• Subjects: cloud computing -- FPA -- multiobjective optimization -- Pareto optimality -- task scheduling -- TOPSIS technique; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.7252
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Cloud computing services are used to fulfill user requests, often expressed in the form of tasks and their execution in such environments requires efficient scheduling strategies that take into account both algorithmic and architectural characteristics. Unfortunately, this problem is known to be NP‐hard in its general form. Despite the fact that several studies have been published in the literature, there are still interesting and relevant questions to be addressed. Indeed, most of the previous studies focus on a single objective and in the case where they deal with a set of objectives, they use a simple compromise function and do not consider how each of the parameters might influence the others. To this end, we propose an efficient task scheduling algorithm which is based on the pollination behavior of flowers and makes use of both Pareto optimality principle and TOPSIS technique to improve the quality of the obtained solutions. Both single and multiobjective optimization variants are investigated. In the latter case, three optimization criteria are considered, namely, minimizing the time makespan or schedule length, the execution cost, and maximizing the overall reliability of the task mapping. Different test‐bed scenarios and QoS metrics were considered and the obtained results corroborate the merits of the proposed algorithm.