Enhanced hybrid multi-objective workflow scheduling approach based artificial bee colony in cloud computing

نویسندگان

چکیده

Abstract This paper presents a hybrid approach based Binary Artificial Bee Colony (BABC) and Pareto Dominance strategy for scheduling workflow applications considering different Quality of Services (QoS) requirements in cloud computing. The main purpose is to schedule given application onto the available machines environment with minimum makespan (i.e. length) processing cost while maximizing resource utilization without violating Service Level Agreement (SLA) among users providers. proposed called Enhanced Front (EBABC-PF). Our starts by listing tasks according priority defined Heterogeneous Earliest Finish Time (HEFT) algorithm, then gets an initial solution applying Greedy Randomized Adaptive Search Procedure (GRASP) finally schedules (BABC). Further, several modifications are considered BABC improve local searching process circular shift operator mutation on food sources population improvement rate. simulated implemented WorkflowSim which extends existing CloudSim tool. performance compared Deadline (DHEFT), Non-dominated Sort Genetic Algorithm (NSGA-II) standard algorithm using sizes various benchmark workflows. results clearly demonstrate efficiency terms makespan, resources utilization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimi...

متن کامل

Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems

This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each solution corresponds to a food source, which composes of two components, i.e., the routing component and the scheduling component. Each component is filled with discrete values. A crossover operator is developed fo...

متن کامل

A Bi-objective Workflow Application Scheduling in Cloud Computing Systems

The task scheduling is a key process in large-scale distributed systems like cloud computing infrastructures which can have much impressed on system performance. This problem is referred to as a NP-hard problem because of some reasons such as heterogeneous and dynamic features and dependencies among the requests. Here, we proposed a bi-objective method called DWSGA to obtain a proper solution f...

متن کامل

Elite-guided multi-objective artificial bee colony algorithm

Multi-objective optimization has been a difficult problem and a research focus in the field of science and engineering. This paper presents a novel multi-objective optimization algorithm called elite-guided multi-objective artificial bee colony (EMOABC) algorithm. In our proposal, the fast non-dominated sorting and population selection strategy are applied to measure the quality of the solution...

متن کامل

Enhanced Artificial Bee Colony Optimization

An enhanced Artificial Bee Colony (ABC) optimization algorithm, which is called the Interactive Artificial Bee Colony (IABC) optimization, for numerical optimization problems, is proposed in this paper. The onlooker bee is designed to move straightly to the picked coordinate indicated by the employed bee and evaluates the fitness values near it in the original Artificial Bee Colony algorithm in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computing

سال: 2022

ISSN: ['0010-485X', '1436-5057']

DOI: https://doi.org/10.1007/s00607-022-01116-y