Regressive Whale Optimization for Workflow Scheduling in Cloud Computing

Author(s):  
G. Narendrababu Reddy ◽  
S. Phani Kumar

Cloud computing is the advancing technology that aims at providing services to the customers with the available resources in the cloud environment. When the multiple users request service from the cloud server, there is a need of the proper scheduling of the resources to attain good customer satisfaction. Therefore, this paper proposes the Regressive Whale Optimization (RWO) algorithm for workflow scheduling in the cloud computing environment. RWO is the meta-heuristic algorithm, which schedules the task depending on a fitness function. Here, the fitness function is defined based on three major constraints, such as resource utilization, energy, and the Quality of Service (QoS). Therefore, the proposed task scheduling requires minimum time and cost for executing the task in the virtual machines. The performance of the proposed method is analyzed using the four experimental setups, and the results of the analysis prove that the proposed multi-objective task scheduling method performs well than the existing methods. The evaluation metrics considered for analyzing the performance of the proposed workflow scheduling method are resource utilization, energy, cost, and time. Resource utilization is the process of making the most of the resources available for performing tasks. Energy is the quantitative property of the resource to perform tasks. The proposed method attains the maximum resource utilization at a rate of 0.0334, minimal rate of energy, scheduling cost, and time as 0.2291, 0.0181, and 0.0007, respectively.

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jafar Ababneh

In the context of cloud computing, one problem that is frequently encountered is task scheduling. This problem has two primary implications, which are the planning of tasks on virtual machines and the attenuation of performance. In order to address the problem of task scheduling in cloud computing, requisite nontraditional optimization attitudes to attain the optima of the problem, the present paper puts forth a hybrid multiple-objective approach called hybrid grey wolf and whale optimization (HGWWO) algorithms, that integrates two algorithms, namely, the grey wolf optimizer (GWO) and the whale optimization algorithm (WOA), with the purpose of conjoining the advantages of each algorithm for minimizing costs, energy consumption, and total execution time needed for task implementation, beside that improving the use of resources. Assessment of the aims of the proposed approach is carried out with the help of the tool known as CloudSim. As pointed out by the results of the experimental work undertaken, the proposed approach has the capability of performing at a superior level by comparison to the original algorithms GWO and WOA on their own with regard to costs, energy consumption, makespan, use of resources, and degree of imbalance.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
LiWei Jia ◽  
Kun Li ◽  
Xiaoming Shi

The efficiency of task scheduling under cloud computing is related to the effectiveness of users. Aiming at the problems of long scheduling time, high cost consumption, and large virtual machine load in cloud computing task scheduling, an improved scheduling efficiency algorithm (called the improved whale optimization algorithm, referred to as IWC) is proposed. Firstly, a cloud computing task scheduling and distribution model with time, cost, and virtual machines as the main factors is constructed. Secondly, a feasible plan for each whale individual corresponding to cloud computing task scheduling is to find the best whale individual, which is the best feasible plan; in order to better find the optimal individual, we use the inertial weight strategy for the whale optimization algorithm to improve the local search ability and effectively prevent the algorithm from reaching premature convergence; we use the add operator and delete operator to screen individuals after each iteration which is completed and updated to improve the quality of understanding. In the simulation experiment, IWC was compared with the ant colony algorithm, particle swarm algorithm, and whale optimization algorithm under a different number of tasks. The results showed that the IWC algorithm has good results in terms of task scheduling time, scheduling cost, and virtual machine. The application is in cloud computing task scheduling.


2017 ◽  
Vol 22 (S1) ◽  
pp. 1087-1098 ◽  
Author(s):  
Karnam Sreenu ◽  
M. Sreelatha

2018 ◽  
Vol 6 (5) ◽  
pp. 340-345
Author(s):  
Rajat Pugaliya ◽  
Madhu B R

Cloud Computing is an emerging field in the IT industry. Cloud computing provides computing services over the Internet. Cloud Computing demand increasing drastically, which has enforced cloud service provider to ensure proper resource utilization with less cost and less energy consumption. In recent time various consolidation problems found in cloud computing like the task, VM, and server consolidation. These consolidation problems become challenging for resource utilization in cloud computing. We found in the literature review that there is a high level of coupling in resource utilization, cost, and energy consumption. The main challenge for cloud service provider is to maximize the resource utilization, reduce the cost and minimize the energy consumption. The dynamic task consolidation of virtual machines can be a way to solve the problem. This paper presents the comparative study of various task consolidation algorithms.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Fanghai Gong

In recent years, cloud workflow task scheduling has always been an important research topic in the business world. Cloud workflow task scheduling means that the workflow tasks submitted by users are allocated to appropriate computing resources for execution, and the corresponding fees are paid in real time according to the usage of resources. For most ordinary users, they are mainly concerned with the two service quality indicators of workflow task completion time and execution cost. Therefore, how cloud service providers design a scheduling algorithm to optimize task completion time and cost is a very important issue. This paper proposes research on workflow scheduling based on mobile cloud computing machine learning, and this paper conducts research by using literature research methods, experimental analysis methods, and other methods. This article has deeply studied mobile cloud computing, machine learning, task scheduling, and other related theories, and a workflow task scheduling system model was established based on mobile cloud computing machine learning from different algorithms used in processing task completion time, task service costs, task scheduling, and resource usage The situation and the influence of different tasks on the experimental results are analyzed in many aspects. The algorithm in this paper speeds up the scheduling time by about 7% under a different number of tasks and reduces the scheduling cost by about 2% compared with other algorithms. The algorithm in this paper has been obviously optimized in time scheduling and task scheduling.


2021 ◽  
Vol 12 (3) ◽  
pp. 16-38
Author(s):  
Pushpa R. ◽  
M. Siddappa

In this paper, VM replacement strategy is developed using the optimization algorithm, namely artificial bee chicken swarm optimization (ABCSO), in cloud computing model. The ABCSO algorithm is the integration of the artificial bee colony (ABC) in chicken swarm optimization (CSO). This method employed VM placement based on the requirement of the VM for the completion of the particular task using the service provider. Initially, the cloud system is designed, and the proposed ABCSO-based VM placement approach is employed for handling the factors, such as load, CPU usage, memory, and power by moving the virtual machines optimally. The best VM migration strategy is determined using the fitness function by considering the factors, like migration cost, load, and power consumption. The proposed ABCSO method achieved a minimal load of 0.1688, minimal power consumption of 0.0419, and minimal migration cost of 0.0567, respectively.


Author(s):  
Pooja Arora ◽  
Anurag Dixit

Purpose The advancements in the cloud computing has gained the attention of several researchers to provide on-demand network access to users with shared resources. Cloud computing is important a research direction that can provide platforms and softwares to clients using internet. However, handling huge number of tasks in cloud infrastructure is a complicated task. Thus, it needs a load balancing (LB) method for allocating tasks to virtual machines (VMs) without influencing system performance. This paper aims to develop a technique for LB in cloud using optimization algorithms. Design/methodology/approach This paper proposes a hybrid optimization technique, named elephant herding-based grey wolf optimizer (EHGWO), in the cloud computing model for LB by determining the optimal VMs for executing the reallocated tasks. The proposed EHGWO is derived by incorporating elephant herding optimization (EHO) in grey wolf optimizer (GWO) such that the tasks are allocated to the VM by eliminating the tasks from overloaded VM by maintaining the system performance. Here, the load of physical machine (PM), capacity and load of VM is computed for deciding whether the LB has to be done or not. Moreover, two pick factors, namely, task pick factor (TPF) and VM pick factor (VPF), are considered for choosing the tasks for reallocating them from overloaded VM to underloaded VM. The proposed EHGWO decides the task to be allocated in the VM based on the newly derived fitness functions. Findings The minimum load and makespan obtained in the existing methods, constraint measure based LB (CMLB), fractional dragonfly based LB algorithm (FDLA), EHO, GWO and proposed EHGWO for the maximum number of VMs is illustrated. The proposed EHGWO attained minimum makespan with value 814,264 ns and minimum load with value 0.0221, respectively. Meanwhile, the makespan values attained by existing CMLB, FDLA, EHO, GWO, are 318,6896 ns, 230,9140 ns, 1,804,851 ns and 1,073,863 ns, respectively. The minimum load values computed by existing methods, CMLB, FDLA, EHO, GWO, are 0.0587, 0.026, 0.0248 and 0.0234. On the other hand, the proposed EHGWO with minimum load value is 0.0221. Hence, the proposed EHGWO attains maximum performance as compared to the existing technique. Originality/value This paper illustrates the proposed LB algorithm using EHGWO in a cloud computing model using two pitch factors, named TPF and VPF. For initiating LB, the tasks assigned to the overloaded VM are reallocated to under loaded VMs. Here, the proposed LB algorithm adapts capacity and loads for the reallocation. Based on TPF and VPF, the tasks are reallocated from VMs using the proposed EHGWO. The proposed EHGWO is developed by integrating EHO and GWO algorithm using a new fitness function formulated by load of VM, migration cost, load of VM, capacity of VM and makespan. The proposed EHGWO is analyzed based on load and makespan.


2019 ◽  
Vol 10 (4) ◽  
pp. 1-17 ◽  
Author(s):  
Mohit Agarwal ◽  
Gur Mauj Saran Srivastava

Cloud computing is an emerging technology which involves the allocation and de-allocation of the computing resources using the internet. Task scheduling (TS) is one of the fundamental issues in cloud computing and effort has been made to solve this problem. An efficient task scheduling mechanism is always needed for the allocation to the available processing machines in such a manner that no machine is over or under-utilized. Scheduling tasks belongs to the category of NP-hard problem. Through this article, the authors are proposing a particle swarm optimization (PSO) based task scheduling mechanism for the efficient scheduling of tasks among the virtual machines (VMs). The proposed algorithm is compared using the CloudSim simulator with the existing greedy and genetic algorithm-based task scheduling mechanism. The simulation results clearly show that the PSO-based task scheduling mechanism clearly outperforms the others as it results in almost 30% reduction in makespan and increases the resource utilization by 20%.


2016 ◽  
Vol 13 (10) ◽  
pp. 7655-7660 ◽  
Author(s):  
V Jeyakrishnan ◽  
P Sengottuvelan

The problem of load balancing in cloud environment has been approached by different scheduling algorithms. Still the performance of cloud environment has not been met to the point and to overcome these issues, we propose a naval ADS (Availability-Distribution-Span) Scheduling method to perform load balancing as well as scheduling the resources of cloud environment. The method performs scheduling and load balancing in on demand nature and takes dynamic actions to fulfill the request of users. At the time of request, the method identifies set of resources required by the process and computes Availability Factor, Distributional Factor and Span Time factor for each of the resource available. Based on all these factors computed, the method schedules the requests to be processed in least span time. The proposed method produces efficient result on scheduling as well as load balancing to improve the performance of resource utilization in the cloud environment.


Sign in / Sign up

Export Citation Format

Share Document