Workload Aware Load Balancing For Cloud Data Center

Similar documents
A Mediator based Dynamic Server Load Balancing Approach using SDN

Analysis of Various Load Balancing Techniques in Cloud Computing: A Review

Improved Task Scheduling Algorithm in Cloud Environment

An in-depth analysis and study of Load balancing techniques in the cloud computing environment.

Keywords: Cloud, Load balancing, Servers, Nodes, Resources

Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing

Improved Effective Load Balancing Technique for Cloud

LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING

Dynamic Task Scheduling in Cloud Computing Based on the Availability Level of Resources

Experimental Model for Load Balancing in Cloud Computing Using Equally Spread Current Execution Load Algorithm

Nowadays data-intensive applications play a

Improving QoS Parameters for Cloud Data Centers Using Dynamic Particle Swarm Optimization Load Balancing Algorithm

Computing Environments

CHAPTER 6 ENERGY AWARE SCHEDULING ALGORITHMS IN CLOUD ENVIRONMENT

Load Balancing in Cloud Computing

ScienceDirect. Autonomous Agent Based Load Balancing Algorithm in Cloud Computing

Load Balancing in Cloud Computing Priya Bag 1 Rakesh Patel 2 Vivek Yadav 3

Task Scheduling Algorithm in Cloud Computing based on Power Factor

Selection of a Scheduler (Dispatcher) within a Datacenter using Enhanced Equally Spread Current Execution (EESCE)

Dynamic Data Placement Strategy in MapReduce-styled Data Processing Platform Hua-Ci WANG 1,a,*, Cai CHEN 2,b,*, Yi LIANG 3,c

A Grouping based Scheduling Algorithm on Load Balancing in Cloud Computing

CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE

Global Journal of Engineering Science and Research Management

Properties of Processes

k-tier AND SELECTIVE BACKFILLING APPROACH FOR PARALLEL WORKLOAD SCHEDULING IN CLOUD

ABSTRACT I. INTRODUCTION

Multi-Criteria Strategy for Job Scheduling and Resource Load Balancing in Cloud Computing Environment

PriDynSim: A Simulator for Dynamic Priority Based I/O Scheduling for Cloud Applications

Virtual Machine Placement in Cloud Computing

[Kaur* et al., 5(7): July, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

Experimental Model for Load Balancing in Cloud Computing Using Throttled Algorithm

An Integration of Round Robin with Shortest Job First Algorithm for Cloud Computing Environment

International Journal of Scientific & Engineering Research Volume 9, Issue 3, March-2018 ISSN

LOAD BALANCING USING THRESHOLD AND ANT COLONY OPTIMIZATION IN CLOUD COMPUTING

Efficient Task Scheduling Algorithms for Cloud Computing Environment

LOAD BALANCING IN CLOUD COMPUTING USING A NOVEL MINIMUM MAKESPAN ALGORITHM

A Process Scheduling Algorithm Based on Threshold for the Cloud Computing Environment

ANALYSIS OF LOAD BALANCERS IN CLOUD COMPUTING

Preview. Process Scheduler. Process Scheduling Algorithms for Batch System. Process Scheduling Algorithms for Interactive System

The Load Balancing Research of SDN based on Ant Colony Algorithm with Job Classification Wucai Lin1,a, Lichen Zhang2,b

Artificial Bee Colony Based Load Balancing in Cloud Computing

Energy Efficiency Using Load Balancing in Cloud Data Centers: Proposed Methodology

PRIORITY BASED NON-PREEMPTIVE SHORTEST JOB FIRST RESOURCE ALLOCATION TECHNIQUE IN CLOUD COMPUTING

Priority-Aware Virtual Machine Selection Algorithm in Dynamic Consolidation

Performance evaluation of Load Balancing with Service Broker policies for various workloads in cloud computing

A Novel Approach for Dynamic Load Balancing with Effective Bin Packing and VM Reconfiguration in Cloud

Cloud Computing Load Balancing Model with Heterogeneous Partition for Public Cloud

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Figure 1: Virtualization

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University

CloudBATCH: A Batch Job Queuing System on Clouds with Hadoop and HBase. Chen Zhang Hans De Sterck University of Waterloo

A new efficient Virtual Machine load balancing Algorithm for a cloud computing environment

Improve the Efficiency of Load Balancing in Cloud Environment using DAG and Honey Bee Algorithm

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5)

Cloud Load Balancing using Round Robin and Shortest Cloudlet First Algorithms

Load Balancing in Cloud Computing System

Technotes: Cognos BI for z/os with WebSphere Application Serverfor z/os worker threads

A SURVEY OF VARIOUS SCHEDULING ALGORITHM IN CLOUD COMPUTING ENVIRONMENT

D. Suresh Kumar, E. George Dharma Prakash Raj

Enhanced Bee Colony Algorithm for Efficient Load Balancing and Scheduling in Cloud

Chapter 5. Minimization of Average Completion Time and Waiting Time in Cloud Computing Environment

A Survey On Load Balancing Methods and Algorithms in Cloud Computing

Comparative Study of Load Balancing Algorithms in Cloud Computing Environment

Double Threshold Based Load Balancing Approach by Using VM Migration for the Cloud Computing Environment

Bio-Inspired Techniques for the Efficient Migration of Virtual Machine for Load Balancing In Cloud Computing

ANALYSIS OF A DYNAMIC LOAD BALANCING IN MULTIPROCESSOR SYSTEM

A New Approach to Ant Colony to Load Balancing in Cloud Computing Environment

Energy Efficient in Cloud Computing

Simulation of Cloud Computing Environments with CloudSim

A Comparative Performance Analysis of Load Balancing Policies in Cloud Computing Using Cloud Analyst

Distributed Load Balancing using Dynamic Load Balancing Algorithm.

Published by: PIONEER RESEARCH & DEVELOPMENT GROUP ( ) 1

CPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes:

3. CPU Scheduling. Operating System Concepts with Java 8th Edition Silberschatz, Galvin and Gagn

Performance Analysis of Cloud Load Balancing Algorithms

An Enhanced Scheduling in Weighted Round Robin for the Cloud Infrastructure Services

Chapter 5 CPU scheduling

A Comparative Study of Various Scheduling Algorithms in Cloud Computing

Chapter 5: CPU Scheduling

CS370 Operating Systems Midterm Review

Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter

Improving CPU Performance of Xen Hypervisor in Virtualized Environment

EECE.4810/EECE.5730: Operating Systems Spring 2017 Homework 3 Solution

CHAPTER 2: PROCESS MANAGEMENT

STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTING

ayaz ali Micro & Macro Scheduling Techniques Ayaz Ali Department of Computer Science University of Houston Houston, TX

An Optimized Virtual Machine Migration Algorithm for Energy Efficient Data Centers

Assorted Load Balancing Algorithms in Cloud Computing: A Survey

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

Using Genetic Algorithm for Load Balancing in Cloud Computing

CPU Scheduling Algorithms

Dynamic Resource Allocation on Virtual Machines

[Khanchi* et al., 5(6): June, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

Load Balancing Algorithms in Cloud Computing: A Comparative Study

Hybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing

LECTURE 3:CPU SCHEDULING

A QoS Load Balancing Scheduling Algorithm in Cloud Environment

Keywords: Load balancing, Honey bee Algorithm, Execution time, response time, cost evaluation.

Hybrid Improved Max Min Ant Algorithm for Load Balancing in Cloud

Transcription:

Workload Aware Load Balancing For Cloud Data Center SrividhyaR 1, Uma Maheswari K 2 and Rajkumar Rajavel 3 1,2,3 Associate Professor-IT, B-Tech- Information Technology, KCG college of Technology Abstract Cloud computing is emerging as a new standard for manipulating, configuring, and accessing large scale distributed computing applications over the network. Load balancing is the main Challenges in cloud computing which is required to distribute the workload evenly across all the nodes. Load is a measure of the work that a computation system performs which can be classified as CPU load and memory.the concept of load balancing used in cloud computing is to evenly distribute data to underutilized virtual machines in the data center for effectively scheduling. The challenge faced during the load balancing is to balance the load in single Data Center which allocates the resources overloaded in each Virtual Machines and the algorithm used two parameter namely processing power and computer loading, which is less efficient when user login multiple times. The proposed system is to perform load balancing in cloud based on the workload of the cloud data center and to create multiple data centers for single server so that when a particular Virtual Machines overloads tasks will automatically allocated to other available data center (which contains Virtual Machines) by using three parameters - number of task/jobs, workload of each Virtual Machines or threshold and computing power, which balances both data center and Virtual Machines efficiently, thereby increasing the performance.this technique that helps resources by providing a Maximum throughput with minimum response time. So that there will less time for allocating workload, thereby increases the performance. Index Terms Cloud computing, cloud data center, load balancing, processing power, virtual machines. I. INTRODUCTION Cloud computing is a type of Internet-based computing that provides shared computer processing resources and data to computers and other devices on demand. Workload is an abstraction of the actual work that instance or a set of instances are going to perform. Cloud load balancing is the process of distributing workloads and computing resources in a cloud computing environment. As cloud is composed of huge servers, load balancing techniques are used to balance load over multiple servers. Existing load balancing algorithm used two parameter namely processing power and computer loading, which is less efficient when user login multiple times. It Need to search for Candidate Virtual Machine from Data Centers[2]. While the scheduling algorithm implemented resource can execute only one job at a time which leads toincrease in execution time [3]. When the different users logged in the system in different time the scheduling and the load balancing algorithm cannot be efficiently used [1]. II. RELATED WORK The cloud balance algorithm-the cloud load balancing algorithm is designed for monitoring platform in order to obtain each server loading, computing power and the priority service value. When user sends request to the cloud server demanding for services which enters into the cloud load balancing distribution platforms, obtain the first half of the servers sorted by the priority service value from the service priority database, and it then uses a polling method to dispatch the user s request. Thus above cloud load balance architecture and cloud load balance algorithm can be used to calculate the server processing power and can also load and obtain priority service values. This can also be applied to the applications in the cloud, thus allowing smoother system operation. The experimental result for CLB enabled physical servers and virtual servers shows that cloud performance based on the architecture can balance the loading performance when the users logged in at the same time [3]. In autonomous agent based load balancing algorithm(a2lb) which provides dynamic loadbalancingforcloudenvironment.a2lbmechanism comprises of three agents.(1) Load agent controls information policies and maintains all the details of the data center. The major work of the load agent is to calculate the load on every available virtual machine after allocating new job in the data center. (2) Channel agent- It controls the transfer, selection IJIRT 144332 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 200

and location policy. After receiving the request form the load agent, the load agent will initiate some migration agent to other data center for searching the virtual machines having single configuration. (3) Migration agent- These agents are initiated by channel agent. It will move to other data center and communicate with load agent of that data center to enquire the status of the virtual machines present there, looking for desired configuration. The status of the migration of the agent may be live or destroyed based on its applicability. Load and channel agent are static and migration agent is an ant, which is a special category of mobile agent (has the ability to choose shortest or best path to their destination) The implementation is done by two ways considering the parameters number of data center, number of virtual machines, number of instances, memory unit, cost, wait time, number of runs.(1) When the requested virtual machine is found with normal status and allocation takes place.(2) When virtual machine is in critical state, then load balancing takes place. During the critical state A2LB algorithm is implemented. This mechanism provides proactive load calculation of virtual machines present in a data center and whenever the load of a virtual machine reaches near threshold value, load agent initiates search for a candidate virtual machine from the neighboring data centers. Keeping information of candidate virtual machines beforehand reduces service time but implementation has proved that this algorithm works satisfactorily [1]. Load balancing is method which distributes the workload equally among all available resources. The main focus is to allocating the load dynamically among the nodes in order to satisfy the user requirements and provide maximum resource utilization by assorting the available load to resources. In this approach Batch mode scheduling is used where the tasks are collected based on the arrival and mapped by prescheduled times. It uses two algorithms called Min-Min load balancing and Max- Min load balancing. (1)Min-Min algorithm is simple and fast providing improved performance for small set task only.min-min start with the set of all unassigned tasks in the make span. This algorithm works in two phases. First, the minimum expected completion time for all the tasks is calculated. The completion time for all the tasks is calculated on all the machines. In the second phase, the task with the minimum expected completion time from make span is selected and that tasks assigned to the corresponding resource. Then the task which is completed that is removed from the make span and this process is repeated until all tasks are completed.(2)max-min algorithm is used for large task set and small task will get executed concurrently. Max-Min start with the set of all unassigned tasks in the make span. This algorithm also works in two phases. First, the maximum expected completion time for all the tasks is calculated. The completion time for all the tasks is calculated on all the machines. In the second phase, the task with the maximum expected completion time from make span is selected and that tasks assigned to the corresponding resource. Then the task which is completed that is removed represents the modified max min algorithm.[2] III. ARCHITECTURE OF WORKLOAD AWARE SCHEDULER The method used in the project is workload balance scheduling. It helps to estimate the job related specification, processing power and load of each virtual machines. It distributes the workload evenly to all virtual machines. The objective of this project is to distribute the task/cloudlets among virtual machines and to calculate the workload of the data centers.using multiple data centers in a single server,tasks are executed efficiently. In this architecture the cloud user submits the tasks to the cloud environment were the cloud broker is present. The cloud broker does the estimation like job related estimation, estimation of workload and the processing power can be estimated. All the estimation is given to the scheduler and with the help of the estimation the scheduler distributes the loads efficiently to the datacenter present in the single server. IJIRT 144332 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 201

Else Assign the weight to the entire DC dc id Proportional DC selection (list size) dc Name load list. get(dc id); end if end if return dc Name end function. Submission of Cloudlets Job related estimation Estimation of workload Figure 1: Architecture diagram Algorithm: Input : Number of Cloudlets/Job. Number of Resource. Output: Balanced workload in all virtual machines. Estimation of Load in virtual machines in Data center, L= Executing jobs cloudlet Capacity of the vm Load per unit Capacity, LPC= L Ci n i=0 Where, n is number of nodes. ThresholdTi = LPC Ci Datacenter Selection Input : Load Output: Dc Name Load list Regional datacenter (region) If Load list is Not NULL then List size load list.size () If list size == 1 then Dc Name load list. get (0) IV. Estimation of processing power Schedule the Cloudlets Figure 2:System flow diagram. EXPERIMENTAL SETUP CloudSim version 3.0.3 is used as framework for stimulation and modeling for cloud computing environments. The CloudSim is written in java programming, for creating data center, scheduling and allocating the cloudlets.cloudsim package is imported in the Eclipse Integrated Development Environment and it is most widely used for simulating the cloud environment Java programming. In this experimental setup, job size of 50, 100, and 150 are simulated using round robin, Fist Come First Served and Workload Aware Scheduling algorithms. Experimental results are observed with respect to IJIRT 144332 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 202

waiting time response time average waiting time and turnaround time as shown in Table 1. Table 1 Experimental Results Jobs Scheduler Average Turnaround time Average Waiting time Avg turnaround time 16 14 12 50 Workload 8.32 5.32 9.002 5.878 10 8 6 Workload 100 Workload 150 Workload 9.342 5.999 12.415 8.799 12.985 8.9 13.023 9.22 16.071 12.796 16.895 13.02 4 2 0 50 100 150 waiting time Figure 3:Performance of scheduling algorithms with respect to Turnaround Time. 16 14 12 Avg waiting time 17.02 13.45 The proposed system results are compared with the existing scheduler Robbin and first come first serve with respect to average turnaround time and average waiting time as shown in Figure 2 and Figure 4respectively. 10 8 6 4 2 0 50 100 150 Workload no of jobs Figure 4: Performance of scheduling algorithms with respect to Waiting Time. IJIRT 144332 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 203

It is evident from the performance evaluation graph; the proposed workload scheduling algorithm evenly distributes the loads among all the available datacenter based the estimations of job workload, processing power and execution cost. There by job workloads are distributed evenly to all the virtual machines in each datacenters. Due to even distribution of workload the proposed algorithm minimizes the turnaround time and waiting time of all the user jobs. V. CONCLUSION AND FUTURE WORK The load balancing is one of the greatest issues in Cloud Computing environment. To solve this issue various techniques are used in the existing system. In this research work, a novel workload load balancing algorithm is proposed which gives a better performance and resources utilization with the different login time. In future this research work can be extended to the real time scheduling scenario of Amazon EC2 cloud environment. REFERENCES [1] AartiSingh, Dimple Juneja, Manisha Malhotra (2015), Autonomous Agent Based Load Balancing Algorithm In Cloud Computing, International Conference on Advanced Computing Technologies and Applications (ICACTA-2015). [2] Geethu Gopinath P P, Shriram K Vasudevan, An in-depth analysis and study of Load Balancing techniques in the cloud Computing environment,2 nd International Symposium on Big Data and Cloud Computing(ISBCC 15). [3] Shang-Liang Chen, Yun-Yao Chen, Suang-Hong Kuo (2016), CLB: A novel load balancing architecture and algorithm for cloud services, Computer and Electrical Engineering on ELSEVIER. IJIRT 144332 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 204