GCOA : An Effective Task Scheduling for Load Balancing in the Cloud Framework

<p>There are several physical data centers in cloud environment with hundreds or thousands of computers. Virtualization is the key technology to make cloud computing feasible. It separates virtual machines in a way that each of these so-called virtualized machines can be configured on a number of hosts according to the type of user application. It is also possible to dynamically alter the allocated resources of a virtual machine. Different methods of energy saving in data centers can be divided into three general categories: 1) methods based on load balancing of resources; 2) using hardware facilities for scheduling; 3) considering thermal characteristics of the environment. This paper focuses on load balancing methods as they act dynamically because of their dependence on the current behavior of system. By taking a detailed look on previous methods, we provide a hybrid method which enables us to save energy through finding a suitable configuration for virtual machines placement and considering special features of virtual environments for scheduling and balancing dynamic loads by live migration method.</p>

An efficient resource utilization method can greatly reduce expenses and unwanted resources. Typical cloud resource planning approaches lack support for the emerging paradigm regarding asset management speed and optimization. The use of cloud computing relies heavily on task planning and allocation of resources. The task scheduling issue is more crucial in arranging and allotting application jobs supplied by customers on Virtual Machines (VM) in a specific manner. The task planning issue needs to be specifically stated to increase scheduling efficiency. The task scheduling in the cloud environment model is developed using optimization techniques. This model intends to optimize both the task scheduling and VM placement over the cloud environment. In this model, a new hybrid-meta-heuristic optimization algorithm is developed named the Hybrid Lemurs-based Gannet Optimization Algorithm (HL-GOA). The multi-objective function is considered with constraints like cost, time, resource utilization, makespan, and throughput. The proposed model is further validated and compared against existing methodologies. The total time required for scheduling and VM placement is 30.23%, 6.25%, 11.76%, and 10.44% reduced than ESO, RSO, LO, and GOA with 2 VMs. The simulation outcomes revealed that the developed model effectively resolved the scheduling and VL placement issues.

In recent decades, task scheduling and load balancing in the cloud is a growing research area, due to the vast amount of data stored in the server highly increases the load. In order to address this concern, Hybrid Max-Min Genetic Algorithm (HMMGA) is proposed for task scheduling and load balancing in the cloud environment. At first, the load is evaluated for every Virtual Machine (VM), if the load is high, then HMMGA is used for balancing the load. HMMGA selects the best VMs to assign the tasks and migrates the over-loaded VMs tasks to the under-loaded VMs. HMMGA significantly avoids the imbalanced workload performance in the cloud environment. In this research paper, the proposed HMMGA performance is compared to Max-Min algorithm, Low time complexity and low cost binary Particle Swarm Optimizer (IBPSO-LBS) and PSO with Technique of Order Preference by Similarity to Ideal Solution (TOPSIS) algorithm to examine the efficacy of HMMGA. From the experimental simulation, the result shows that HMMGA averagely delivers 1.63 and 3.88 seconds less make span compared to the Max-Min and TOPSIS-PSO algorithm for five VMs. In addition, HMMGA averagely enhances 10% to 40% of resource utilization than the MaxMin and TOPSIS-PSO algorithm. In another experiment, the HMMGA approximately showed 1.7 to 25.99 seconds less average waiting time compared to the Max-Min and IBPSO-LBS.

Hybrid grey wolf and improved particle swarm optimization with adaptive intertial weight-based multi-dimensional learning strategy for load balancing in cloud environments

In addition to cutting down on energy use, the green cloud-based service also drastically cuts down on operating expenses. Strongly coupled data centers demand controlled energy, constant performance, and overall optimization of excess energy consumption in order to do considerable calculations, which in turn give entire processing influence from a wide collection of resources. An energy-saving scheduling method is the focus of the research, which makes use of green cloud technologies. In recent years, cloud computing has been integrated into several domains, including computing, research, industry, and business. The need for specialized hardware along with additional resources is rendered obsolete by the provision of many services across the internet through cloud computing. Problems with energy efficiency, resource heterogeneity, and resource usage are only a few of the issues that cloud computing systems encounter. Consolidation approaches like as task scheduling as well as virtual machines (VMs) are used to address these concerns. There has been a plethora of research on task scheduling. Researchers have examined the issue using a variety of metrics and aims. The essay delves into the topic of virtualized cloud data centers' energy usage and effective resource use. Task categorization and thresholds form the basis of the proposed method, which aims to improve resource use and scheduling efficiency. Every company needs a highly efficient structure that is both flexible and homogeneous across all of their cloud environments. This research aims to reduce energy consumption in green cloud systems by using a hybrid scheduling strategy that combines a minimal completion time with a priority-based weighted round-robin. An Artificial Neural Network (ANN) based load balancing method is presented in this study. ANN makes demand predictions and then distributes resources accordingly. This method uses less energy than the cautious over-provisioning strategy since it constantly adjusts the number of active servers based on current demand. In addition, a server that is operating at a high utilization may handle more task with the same amount of power, but it will use more power overall. At last, we take a look at the current state of load balancing in cloud computing and compare it to others using different metrics.

HEPGA: A new effective hybrid algorithm for scientific workflow scheduling in cloud computing environment

In this paper, we consider two critical issues in data centers: load balancing and server consolidation. We propose a live consolidation method, which identifies an optimal strategy of hosting a new virtual machine (VM). Our algorithm finds the optimal allocation scheme to host a VM in term of load balancing, reducing the migration cost, and mitigating resource redundancy. Based on queueing and optimization theory, we model the allocation resource in data centers and analyze how to choose the location for each VM, and also minimize the number of active servers. The live consolidate algorithm exploits the distribution VM process and determines the optimal active server set. The numerical analysis demonstrates that our algorithm is able to consolidate the system lively. By using a real dataset, our simulation results show that the optimal distribution probability vector can allocate a new VM into a appropriate server to improve the resource utilization and the energy efficiency.

In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources of virtual machines. Load balancing in the CC environment is one of the analytical approaches utilized to ensure indistinguishable workload distribution and effective utilization of resources. This is because only by ensuring effective balance of dynamic workload results in higher user satisfaction and optimal allocation of resource, therefore improve cloud application performance. Moreover, a paramount objective of load balancing is task scheduling because surges in the number of clients utilizing cloud lead to inappropriate job scheduling. Hence, issues encircling task scheduling has to be addressed. In this work a method called, Ford Fulkerson and Newey West Regression-based Dynamic Load Balancing (FF-NWRDLB) in CC environment is proposed. The FF-NWRDLB method is split into two sections, namely, task scheduling and dynamic load balancing. First, Ford Fulkerson-based Task Scheduling is applied to the cloud user requested tasks obtained from Personal Cloud Dataset. Here, employing Ford Fulkerson function based on the flow of tasks, energy-efficient task scheduling is ensured. The execution of asymmetrical scientific applications can be smoothly influenced by an unbalanced workload distribution between computing resources. In this context load balancing signifies as one of the most significant solution to enhance utilization of resources. However, selecting the best accomplishing load balancing technique is not an insignificant piece of work. For example, selecting a load balancing model does not work in circumstances with dynamic behavior. In this context, a machine learning technique called, Newey West Regression-based dynamic load balancer is designed to balance the load in a dynamic manner at run time, therefore ensuring accurate data communication. The FF-NWRDLB method has been compared to recent algorithms that use the markov optimization and the prediction scheme to achieve load balancing. Our experimental results show that our proposed FF-NWRDLB method outperforms other state of the art schemes in terms of energy consumption, throughput, delay, bandwidth and task scheduling efficiency in CC environment.

The rapid development of cloud computing expands the scale of modern cloud data centers, resulting in growing challenges of energy consumption. Load balancing of virtual machines(VMs), for the purposes of improving the utilization of physical resources and reducing energy consumption, has become a research focus in recent years. However, the existing researches mostly focus on how to maximize resource utilization and reduce energy consumption. Security issues in the context of load balancing of VMs were rarely addressed. In this paper, we research the key procedures of load balancing, VM selection and VM placement, we find that the existing schemes introduced several security problems. In consideration of some conclusions of recent researches and inevitable live migrations during load balancing, common tenants have sufficient reasons to worry about their VMs' security when they are migrated to strange hosts and/or co-reside with the VMs owned by strange tenants. In short, VMs' mobility introduced by load balance expands the attack surface. In this work, we classify and analyze related security threats and create an information leakage model for load balancing. We present a new security policy, SeLance, to secure the load balancing via avoiding above threats as far as possible. We develop exact implementations in CloudSim and OpenStack. We show that SeLance can effectively alleviate the threats introduced by load balancing, the security score can improve 46.90%-81.15%, while keeping the load balancer's original function to a great extent (± 2.5%).

Scheduling large-scale and resource-intensive workflows in cloud infrastructure is one of the main challenges for cloud service providers (CSPs). Cloud infrastructure is more efficient when virtual machines and other resources work up to their full potential. The main factor that influences the quality of cloud services is the distribution of workflow on virtual machines (VMs). Scheduling tasks to VMs depends on the type of workflow and mechanism of resource allocation. Scientific workflows include large-scale data transfer and consume intensive resources of cloud infrastructures. Therefore, scheduling of tasks from scientific workflows on VMs requires efficient and optimized workflow scheduling techniques. This paper proposes an optimised workflow scheduling approach that aims to improve the utilization of cloud resources without increasing execution time and execution cost.

Nowadays cloud computing provides an effective way of implementing infrastructure as a service (IaaS). However virtualized data centers still face many challenges, such as low resource utilization of physical machines (PMs) and imbalanced server loads. Virtual machine (VM) consolidation based on live migration allows administrator to dynamically redeploy VMs into PMs for better resource utilization. Common VM consolidation methods usually focus on one challenge, and pay little attention to others or just ignore them, while effective VM redeployment should make tradeoffs between these challenges, and more importantly, should not let other challenges become worse. On the other hand, since VM live migration leads to performance degradation of applications, consolidation work should control migration cost. In this paper, we provide a manner to comprehensively consider power consumption, load balancing, communication delay and migration cost during VM redeployment. And we formalize VM consolidation as a multiobjective optimization problem, then solve this problem with an improved genetic algorithm. Simulation experiments based on real world workload trace show that compared with single objective optimization approaches our method effectively make tradeoffs between optimized objectives and has better overall performance, which is more practical in real data centers.

Virtualisation is a major technology in cloud computing for optimising the cloud data centre's power usage. In the current scenario, most of the services are migrated to the cloud, putting more load on the cloud data centres. As a result, the data center's size expands resulting in increased energy usage. To address this problem, a resource allocation optimisation method that is both efficient and effective is necessary. The optimal utilisation of cloud infrastructure and optimisation algorithms plays a vital role. The cloud resources rely on the allocation policy of the virtual machine on cloud resources. A virtual machine placement technique, based on the Harris Hawk Optimisation (HHO) model for the cloud data centre is presented in this paper. The proposed HHO model aims to find the best place for virtual machines on suitable hosts with the least load and power consumption. PlanetLab's real-time workload traces are used for performance evaluation with existing PSO (Particle Swarm Optimisation) and PABFD (Best Fit Decreasing). The performance evaluation of the proposed method is done using power consumption, SLA, CPU utilisation, RAM utilisation, Execution time (ms) and the number of VM migrations. The performance evaluation is done using two simulation scenarios with scaling workload in scenario 1 and increasing resources for the virtual machine to study the performance in underloaded and overloaded conditions. Experimental results show that the proposed HHO algorithm improved execution time(ms) by 4%, had a 27% reduction in power consumption, a 16% reduction in SLA violation and an increase in resource utilisation by 17%. The HHO algorithm is also effective in handling dynamic and uncertain environments, making it suitable for real-world cloud infrastructures.

Task scheduling is a difficult non-deterministic polynomial problem. Optimization of the scheduling algorithm is the key to improve the efficiency of cloud computing. The traditional meta-heuristic algorithm has slow convergence rate and is easy to fall into local optimal value. This paper proposes a new scheduling method based on a coral reefs algorithm. Firstly, the task scheduling model is formally described. The objective function is proposed to calculate load balancing rate, resource utilization and load balancing stability. Then the representation method of coral reef and the coding scheme of polyps are designed. Matrix random mapping method is applied to improve the variation effect of polyps. Finally, Ant Colony Optimization(ACO), the Genetic Algorithm(GA) andRound Robin(RR) algorithms are compared in terms of completion time, convergence effect and resource load. The simulation results show that the coral reef algorithm has reduced the completion time by 6.4%, 25.1%, 51.3%, and increased resource utilization by 10.0%, 15.2% and 51.3% when it is compared with the other three algorithms. It shows that the coral reef algorithm is suitable for task scheduling in the cloud environment.

In order to solve the problems of unbalanced load, slow convergence speed and low utilization of virtual machine resources existing in the previous task scheduling optimization strategies, this paper proposes a task scheduling optimization strategy using improved ant colony optimization algorithm in cloud computing. Firstly, based on the principle of cloud computing task scheduling, a scheduling model using improved ant colony algorithm is proposed to avoid the optimization strategy falling into local optimization. Then, task scheduling satisfaction function is constructed by combining the three objectives of the shortest waiting time, the degree of resource load balance and the cost of task completion to search the optimal solution of task scheduling. Finally, the reward and punishment coefficient is introduced to optimize the pheromone updating rules of ant colony algorithm, which speeds up the solution speed. Besides, we use dynamic update of volatility coefficient to optimize overall performance of this strategy, and introduce virtual machine load weight coefficient in the process of local pheromone updating, so as to ensure the load balance of virtual machine. The feasibility of our algorithm is analyzed and demonstrated by experiments with Cloudsim. The experimental results show that the proposed algorithm has the fastest convergence speed, the shortest completion time, the most balanced load and the highest utilization rate of virtual machine resources compared with other methods. Therefore, our proposed task scheduling optimization strategy has the best performance.

Cloud computing is immense technology that offers distributed resources to a number of users who are present throughout the world. Cloud model is comprised of numerous virtual machines (VMs) and physical machines (PMs) to carry out user tasks effectively in a parallel manner but in some cases, the demand of the users may be high that resulting in the overloading of PMs and this condition deteriorates the performance of cloud network. For achieving effective virtualization in the cloud paradigm, energy and resource utilization are major properties that should be handled effectively and such properties are accomplished through effective management of workload by distributing load equivalently among VMs. By doing so, resource utilization of the network is enhanced and it only requires minimum energy to process the tasks. Numerous load-balancing algorithms have been introduced earlier to maintain load in a cloud environment, nevertheless, they are devoid of mitigating the number of task migrations. Hence, this research proposes an effective load balancing algorithm and replica management method using the proposed Conditional Autoregressive Value at risk by Regression Quantiles-Horse Herd Optimization (CAViaR-HHO) model. Here, the load is computed by considering some factors like Central Processing Unit (CPU), Million Instructions per Second (MIPS), bandwidth, memory, and frequency. VM migration and replica migration is effectively carried out using the proposed CAViaR-HHO model. Meanwhile, the developed method is devised by integration of Conditional Autoregressive Value at risk by Regression Quantiles (CAViaR) with Horse Herd Optimization Algorithm (HOA). However, the proposed CAViaR-HHO has achieved a load with a minimum value of 0.109, capacity with a maximum value of 0.591, resource utilization with a maximum value of 0.467, and minimum cost of 0.344. Using setup-1, when the number of tasks is 500, the capacity of the proposed method is 5.58%, 3.89%, 2.87%, 1.52%, and 0.67% higher when compared to the existing approaches namely, C-FDLA, K-means clustering + LB, Adaptive starvation threshold, EIMORM, and Dynamic replica creation method.