CHAPTER 6 ENERGY AWARE SCHEDULING ALGORITHMS IN CLOUD ENVIRONMENT

Size: px
Start display at page:

Download "CHAPTER 6 ENERGY AWARE SCHEDULING ALGORITHMS IN CLOUD ENVIRONMENT"

Transcription

1 CHAPTER 6 ENERGY AWARE SCHEDULING ALGORITHMS IN CLOUD ENVIRONMENT This chapter discusses software based scheduling and testing. DVFS (Dynamic Voltage and Frequency Scaling) [42] based experiments have been conducted for minimizing the processing cost, makespan time in Energy Aware environment so as to achieve energy savings without compromising QoS. Simulations have been carried out using CloudSim [165] with combination of various QoS parameters and energy aware VM allocation policies. A comparison of these algorithms is shown with the commonly used algorithms based on the processing cost, makespan time and energy utilization parameters. Scheduling is a software technique to gain higher performance for applications in cloud computing. But unfortunately, to the best of our knowledge, existing energy-aware scheduling algorithms at large do not consider real-time task allocation on heterogeneous systems and energy saving simultaneously in clouds. Normally, workflow scheduling is carried out separately for achieving deadline constraints, cost minimization and energy minimization. To overcome this gap and come up with a strategy which jointly addresses above issues. Our work will provide a novel solution that will jointly address VM allocations in cloud environment with minimum energy consumption, processing cost and makespan time. 6.1 INTRODUCTION Energy consumption is a major issue in Cloud Computing environments. Its efficient use can benefit in many ways such as cost saving, efficient utilization of resources [148] and also saving the environment, as energy consumption, cost and time are important and decision making factors for both user as well as cloud service providers. QoS conscious job scheduling along with energy awareness is very important, especially in cloud environment, where large datacenters are to be maintained and at the same time massive computations are involved. Optimal resource usage and price reduction are direct and operational benefits for both users as well as service providers. Moreover scheduling can be improvised on many fronts such as energy efficiency, cost minimization, maximization of resource utilization, etc. Hence, energy 115

2 aware computations and scheduling is a big future concern that may heavily contribute to maintain the nature s environmental systems, ecological balances and may avoid direct and indirect health hazards to all living beings. Omni-directional benefits are the outcome of using energy aware scheduling techniques for Cloud environments and that too without compromising the Quality of Service. 6.2 SOME CONTEMPORARY ENERGY SAVING ALGORITHMS Amount of energy consumed, cost incurred to provide services over the cloud, amount of execution time; are major causes of concern and improvising the scheduling of tasks helps in minimizing these. Multi-objective workflow analysis framework proposed by Luo L., et al. [89] puts forward an algorithm which gives an optimal solution in the case when users require task scheduling to meet various objectives at the same time such as cost minimization along with reduction of makespan. Users expect the makespan of tasks to be as small as possible. The key to the algorithm is that a task is enveloped by a VM to enable transferring of the task to another resource while the task is in progress. Li, B., et al. [141] proposed this strategy to save energy wasted due to servers sitting idle during the placement of applications with constantly varying requirements. This helps in reducing the number of active servers. During insertion the task in hand replaces a smaller task, if it can and the smaller one is now inserted in turn. The principle behind this strategy is that smaller tasks can be easily accommodated into already active servers as compared to bigger tasks. When a task is to be deleted it releases the resources and tasks on that server go through insertion process. Vinh, T. et al [151] presented a Green scheduling algorithm based on the decision made by a neural network predictor. It was observed that powering off the servers while they were not in use saved a lot more energy as compared to lowering the voltage. The problem encountered was to assess the future demand and power off the extra servers as per the assessment because in case of a wrong prediction the drop rate of user requests increases and service level agreement is not assured. Gao, Y. et al. [176] proposed a strategy to reduce the occurrence of soft errors along with energy efficiency consideration. It includes two schedulers static and dynamic. Soft errors are caused due to noise, high energy cosmic particles and hardware fatigue. Soft errors may lead to a corrupted output or a system crash decreasing the user s QoS. To increase the QoS for the users these soft errors have to be hidden from them. This can be done by 116

3 predicting and preventing these errors using methods to detect errors and make the system fault tolerant. Some such methods are Virtual Machine Replication [52] or Idempotent Task Try [53]. The drawback of these methods is that they cost a lot in terms of energy. This work advances an integrated algorithm to make the system fault tolerant and energy efficient at the same time. A strategy is proposed wherein the Cloud Service Provider balances between increase in systems fault tolerance and decrease in the energy consumption. Tests proved the approach to be effective as it showed a 50% reduction in failure rate at an overhead of 76% in terms of energy. Energy Aware Computation in Cloud environment has become a major cause of concern for researchers and Cloud Service Providers. Lots of works are going on in this direction to address the issue at software and hardware levels. Some heuristic algorithms [32] were suggested to manage allocations of resources. An efficient architectural framework is proposed where numerous Green Compute and system resource utilization under type of loads and amount of loads on the data centers are considered. Task Consolidation based [33] on energy consumed by each of the tasks were also suggested to reduce energy usage where scheduling of VMs were based on current CPU usage of task in hand. Static and Dynamic VM migration techniques [100] in which some strategically selected VMs that use more energy onto the currently allocated machines were forced to migrate onto another physical machine. These migrations were based on loads on current machine, computational load of the individual VMs and system capacity. Dynamic scheduling algorithms [104] for reducing the energy consumption were also suggested for the data centers. These algorithms were based on the overall runtime and levels of imbalances between various underlying system resources, viz, CPU, memory and network bandwidth consumed by physical machines as well as the Virtual Machines running on those machines. Some Hotspot and Coldspot based migration techniques [35] were also suggested to reduce the energy consumption. These techniques were based on the upper and lower temperature thresholds of the CPU. CPU temperature proportionally increases when the computational load on it increases. This temperature further increases if it is extremely used and reaches a threshold known as Hotspot, beyond which the system performance degrades inspite of more CPU usage. On the other hand, if the CPU temperature of a Consolidating the Virtual Machines onto the optimally running physical 117

4 machines and switching off the remaining physical machines based on work-load awareness were also suggested to save energy [36][37][66][177]. Scheduling techniques based on either alone or a combination of workflows based on cost constraints, deadline awareness and other energy awareness parameters for homogeneous and heterogeneous processors were also implemented [38][39][40][91]. All above mentioned algorithms and techniques significantly contributed to the energy savings but the Quality of Service parameters were neglected. For example, the lower the energy consumption, lower is the frequency of usage, which further lowers the voltage of the machine. This reduction in voltage may slow down the computational speed and consequently the Quality of Service may get affected. 118

5 Table 6.1: Critical Analysis of the existing energy aware cloud algorithms. 119

6 6.3 ANALYSIS OF ENERGY EFFICIENNT CLOUD ALGORITHMS Most existing algorithms [38][39][40][81][91] address one or two of the parameters on the basis of which scheduling is improved. Some target cost optimization whereas others address shortening the make span whereas some work at minimizing the overall energy consumption. At the same time these algorithms struggle to meet the Service Level Agreement and satisfy the users by maintaining the Quality of Service. Different Cloud Structures demand different scheduling strategies. The details regarding various testing parameters and the criterion for testing of algorithms surveyed are summarized in Table 6.1. Context Aware job scheduling algorithm works for scheduling in mobile environments. It reduces resources wasted due to computation of unnecessary requests, those which are no longer useful to the user or the ones which can t be completed in the window of opportunity. The algorithm was tested in three conditions normal, peaky and flat. Normal symbolized a normal working day wherein the maximum number of requests is concentrated in the working hours, peaky is for scenarios where in the working hours number of requests keep on increasing at a high rate and dropping after sometime to rise yet again. Flat is to set a baseline wherein number of requests remain constant throughout the day. This algorithm works best for peak, cases. On increasing the amount of resources the utilization of resources increases to a certain extent in the presence of context after which on further increase in resources utilization follows the same trend as in the absence of context. It works better as compared to Triple Modulated Redundant [178] System in terms of energy overhead. To save energy is the need of the hour. Thus, many algorithms aim at minimizing the amount of energy consumed without compromising the quality of service. Enacloud [141], Green Predict [179], Energy Optimization Framework [151] all aim at increasing the energy efficiency. Enacloud proposes an algorithm which helps in scheduling the tasks on the minimum number of servers such that number of active servers is minimal. Green Predict helps in predicting the number of servers which will be needed at a particular time depending upon previous data. It has four modes normal, optimal, predict and predict with additional servers. Predict with an additional 20% servers proved to be the best mode for energy saving. Energy Optimization framework works well in case hardware is not completely utilized by a task and helps in avoiding allocation of unnecessary resources to a task. Also Li, B. et al [141] proved that prioritizing servers with 120

7 larger capacity is beneficial to save energy in case of medium loads whereas for small load allocating resources from server having least capacity first is more beneficial. 6.4 PROBLEM STATEMENT To find a VM allocation policy that can detect host overloading and schedule the algorithms in such a way that jointly results in minimum execution cost, time and energy consumption at the same time. 6.5 SOLUTION APPROACH To come up with a strategy that jointly addresses minimization of cost, time and energy consumption using DVFS on CloudSim and WorkflowSim. Our work will provide a novel solution using VM allocations techniques and combinations of scheduling algorithms in cloud environment for minimum energy consumption, processing cost and makespan time. 6.6 SIMULATION STUDY This work is done using Dynamic Voltage Frequency Scaling Technique (DVFS) technique in CloudSim. An introduction about the tools, techniques and algorithms used and implemented are presented below: CloudSim CloudSim was developed in CLOUDS Laboratory at University of Melbourne [165]. It is an open source flexible simulation toolkit. It enables the simulation and modeling of Cloud environment, CloudSim facilitates researchers and industry-based developers to simulate, analyze and develop specific environments and system style problems without bothering about low level details associated with Cloud-based infrastructures and services. Functionalities of CloudSim include support for simulation and modeling of large scale Data Centers, virtualization of Hosts which can be customized for providing host resources to Virtual Machines (VMs) and computation of energy-aware resources. Multiple Virtual Machines are configured to test the performance based on various resource provisioning algorithms and policies that eventually affect system performance. Switching between time-sharing and space-sharing is facilitated to test the performance of the cloud system algorithms for 121

8 particular application types and job properties for evaluating the optimum conditions that give better results. WorkflowSim WorkflowSim [180] is an extension of CloudSim developed by Weiwei Chen. It provides simulation of tasks at workflow level. It takes workflows as input in the form of Directed Acyclic Graph (DAG). It supports an elaborate model of node failures and delays that occurs at different levels of Workflow Management Systems (WMS) stacks. It consists of Workflow Mapper, Workflow Engine, Clustering Engine and Workflow Scheduler. A Cost-based workflow [181] for scheduling the executions is provisioned based on the users requirements that are agreed upon between users and service providers. These techniques are facilitated using the Partial Critical Path Methods with minimum execution cost within task execution deadlines. Adaptive and heuristic based VM consolidation algorithms [182] were proposed that used historical data with computational usages for future VM provisioning and allocations. It highly reduces the energy consumption by avoiding the computational overheads required as the resource requirements are known a priori. DVFS in CloudSim This is based on Dynamic Voltage and Frequency Scaling (DVFS) simulation technique [42] for supporting energy aware experiments. Power VM module of CloudSim is extended to support DVFS. It facilitated to develop power based module that can dynamically vary the voltage and frequency of a Host CPU based on its load by inculcating various upper and lower frequency based thresholds. Based on these thresholds, logical decisions to increase or decrease the frequencies can be taken. In addition, decision to migrate VMs can also be taken based on these thresholds. Various modes of arranging the computations can be implemented that are based on the variations in the frequencies and change in the voltage. For example, a low voltage reduces the power consumed by CPU but at the same time it also reduces computational power. First Come First Serve (FCFS) It is a simple rule in which tasks are arranged on the basis of their arrival time. The task that arrives first is served first. While, this technique helps in fast execution of tasks, it has one 122

9 major disadvantage, that is, if a job that requires large execution time arrives first then the jobs with less execution time have to wait in the queue for its completion. Therefore, increasing the waiting time for the whole workflow and thereby decreasing the performance. Min-min Here, we maintain the two separate lists for mapped tasks and unmapped tasks. Algorithm starts by taking all the unmapped tasks and sorting them on the basis of their completion time. Then, task with least time is scheduled first and moved to the mapped list in order to decrease their waiting time. This is repeated until all the tasks are mapped or are scheduled. Max-min Here also, we maintain the two separate lists for mapped tasks and unmapped tasks. Algorithm starts by taking all the unmapped tasks and sorting them on the basis of their completion time. Then, task with maximum completion time is scheduled first and moved to the mapped list. This is repeated until all the tasks are mapped or are scheduled. This technique is similar to Min-min technique but here we execute the larger tasks first instead of the smaller ones. Minimum Completion Time (MCT) Task with minimum completion time is scheduled at random. This technique is slightly different from Min-min in a way that it does not arrange unmapped tasks rather it assigns them randomly in order to get minimum completion time. Data Aware In this technique, task with minimum data transfer time, that is, the virtual machine that is closest is assigned to the task. Round-Robin Task is assigned to the virtual machine which can handle it and is found to be idle in first attempt. 6.7ALLOCATION POLICIES AND SCHEDULING TECNHIQUES Power model used for scheduling of VMs works on linear model in DVFS and is given by equation (6.1): P Total = (1- )P CPUIdle + P CPUFull --- (6.1) 123

10 where, is CPU load and P CPUIdle is power consumed by CPU at 0% utilization and P CPUFull is power consumed by CPU at 100% utilization. The energy aware VM allocation policies that we have considered are as follows Minimum Used Host Firstly, all the list of suitable host is prepared (in terms of MIPS). Thereafter the minimum used host is selected, i.e., the one with maximum available MIPS is chosen for VM Watt Per MIPS Host using minimum Watts/MIPS is chosen. Energy usage for any particular host in Watts per MIPS can be calculated as per equation 6.2. ((Pma- Pmi)*S/M)/N --- (6.2) where, Pma= maximum power consumed by host Pmi= minimum power consumed by host S= MIPS sum of all currently running VMs M= maximum MIPS that host can consume N= number of host processors Dedicated Network Disk Host A dedicated host for fixed number of VMs is chosen based on the available Million Instructions Per Second (MIPS). All the available VMs are scaled down to 100 hosts. So, there are 100 dedicated disks or hosts for the VMs. 6.8 CALCULATIONS Average Bandwidth calculation of average bandwidth of all the VMs in Mb/sec. Computation Cost calculation of computation cost field with time in seconds. Transfer Cost calculation of transfer cost and mapping with time in seconds to transfer all files. Rank calculation of rank for each task to be scheduled. Tasks allocations scheduling of task given in one of the VMs minimizing the Earliest Finish Time. Finish Time finding best time slot available to minimize the finish time of the given task in the VM with the constraint that scheduling should not start before ready time. Maximum Execution Time returning the largest execution time among all tasks. 124

11 Add Slack adding necessary slack to the task. Minimum Power Consumption returning minimum power consumed by any VM among all VMs. Maximum Power Consumption returning the maximum power consumed by any VM among all VMs. Energy Consumption calculating the energy consumed by particular task on VM 6.9 IMPLEMENTATION DETAILS CloudSim is used to simulate the cloud environment along with WorkflowSim. It supports in deployment, analysis and running the workflow applications. Application Modelling: Workflow Montage model is considered. This workflow covers all the basic components viz., pipeline, data aggregation, data distribution and data redistribution. Experiments were carried out for Montage based [183] two different sizes, i.e., for small (around 25 tasks) and large (100 tasks) sizes. Resource Modelling: Cloud model with single data center offering different types of VMs is considered. Configuration combinations of Host and VM parameters are considered as follows: Results were observed for five different configurations by varying the DVFS state, Host and VM MIPS. Various configurations along with their graph are presented below: 125

12 6.9.1 Configuration 1: Energy aware with deadline and cost aware scheduling of cloudlets using Montage_25 workflow model [183], 5 hosts and 5 VMs each of same configurations (VM MIPS=1000). Sampling rate=0.1, Host MIPS=2500.DVFS=ON. Figure 6.1: Configuration-1 Cost Graph Figure 6.2: Configuration-1 Time Graph 126

13 Figure 6.3: Configuration-1 Energy Graph Analysis of Configuration 1: Following observations are made regarding the processing cost, makespan time and energy consumption for Config.1: Processing Cost: Dedicated Network Disk Host VM allocation policy has minimum processing cost as compared to Minimum Used Host and Watts Per MIPS VM allocation policies, which have similar but higher processing cost as compared to Dedicated Network Disk Host allocation policy. Further, Min-min cloudlet scheduling algorithm gives least processing cost as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.1. Makespan time: Dedicated Network Disk Host VM allocation policy has minimum makespan time as compared to Minimum Used Host and Watts Per MIPS VM allocation policies, which have similar but higher makespan time. Further, Min-min cloudlet scheduling algorithm has the least makespan time as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.2. Energy Consumption: Minimum Used Host and Watts Per MIPS VM allocation policy has minimum and similar amount of energy consumption as compared to Dedicated Network Disk Host. Further, Max-min cloudlet scheduling algorithm has the least energy consumption as 127

14 compared to Data Aware, FCFS, MCT, RR and Min-min cloudlet scheduling algorithms as evident from Figure Configuration 2: Energy aware with deadline and cost aware scheduling of cloudlets using Montage_100 workflow model [183], 5 hosts and 5 VMs (BW & MIPS =1250, 1500, 1750, 2000, 2250) each of same configurations. Sampling rate=0.1, Host MIPS =2500. DVFS=ON. Figure 6.4: Configuration-2 Cost Graph 128

15 Figure 6.5: Configuration-2 Time Graph Figure 6.6: Configuration-2 Energy Graph 129

16 Analysis of Configuration 2: Following observations are made regarding the processing cost, makespan time and energy consumption for Configuration 2: Processing Cost: All three VM allocation policies i.e., Minimum Used Host, Watts Per MIPS and Dedicated Network Disk Host have similar processing costs. Further, Min-min cloudlet scheduling algorithm gives least processing cost as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.4. Makespan time: All three VM allocation policies i.e., Minimum Used Host, Watts Per MIPS and Dedicated Network Disk Host have similar makespan time. Further, Min-min cloudlet scheduling algorithm has least makespan time as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.5. Energy Consumption: All three VM allocation policies i.e., Minimum Used Host, Watts Per MIPS and Dedicated Network Disk Host have similar energy consumptions. Further, Max-min cloudlet scheduling algorithm has least energy consumption as compared to Data Aware, FCFS, MCT, RR and Min-min cloudlet scheduling algorithms as evident from Figure Configuration 3: Energy aware with deadline and cost aware scheduling of cloudlets using Montage_100 workflow model, 5 hosts and 5 VMs (BW & MIPS = 1250, 1500, 1750, 2000, 2250) each of same configurations. Sampling rate=0.1, Host MIPS=3800. DVFS=ON. Figure 6.7: Configuration-3 Cost Graph 130

17 Figure 6.8: Configuration-3 Time Graph Figure 6.9: Configuration-3 Energy Graph Analysis of Configuration 3: Following observations are made regarding the processing cost, makespan time and energy consumption for Config. 3: 131

18 Processing Cost: Minimum Used Host and Watts Per MIPS VM allocation policies gives minimum processing cost as compared to Dedicated Network Disk Host VM allocation policy which incur higher processing cost. Further, Min-min cloudlet scheduling algorithm gives least processing cost as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.7. Makespan time: Minimum Used Host and Watts Per MIPS VM allocation policies gives minimum makespan time as compared to Dedicated Network Disk Host VM allocation policy which has higher makespan time. Further, Min-min cloudlet scheduling algorithm has the least makespan time as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure 6.8. Energy Consumption: Minimum Used Host and Watts Per MIPS VM allocation policies has minimum energy consumption as compared to Dedicated Network Disk Host VM allocation policy which has higher energy consumption. Further, Max-min cloudlet scheduling algorithm has the least energy consumption as compared to Data Aware, FCFS, MCT, RR and Min-min cloudlet scheduling algorithms as evident from Figure Configuration 4: Energy aware with deadline and cost aware scheduling of cloudlets using Montage_100 workflow model, 5 hosts and 5 VMs (BW & MIPS = 1250, 1500, 1750, 2000, 2250) each of same configurations. Sampling rate=0.1, Host MIPS=3800. DVFS=OFF. Figure 6.10: Configuration-4 Cost Graph 132

19 Figure 6.11: Configuration-4 Time Graph Figure 6.12: Configuration-4 Energy Graph Analysis of Configuration. 4: Following observations are made regarding the processing cost, makespan time and energy consumption for Config. 4: Processing Cost: Minimum Used Host VM allocation policy has minimum processing cost as compared to Dedicated Network Disk Host and Watts Per MIPS VM allocation policies, which have higher processing cost as compared to Minimum Used Host allocation policy. Further, Min-min cloudlet scheduling algorithm gives least processing cost as compared to 133

20 Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure Makespan time: Minimum Used Host VM allocation policy has minimum makespan time as compared to Dedicated Network Disk Host and Watts Per MIPS VM allocation policies, which have higher makespan time as compared to Minimum Used Host allocation policy. Further, Min-min cloudlet scheduling algorithm has the least makespan time as compared to Data Aware, FCFS, Max-min, MCT and RR cloudlet scheduling algorithms as evident from Figure Energy Consumption: Minimum Used Host VM allocation policy has least energy consumption as compared to Dedicated Network Disk Host and Watts Per MIPS VM allocation policies, which have more energy consumption as compared to Minimum Used Host allocation policy. Further, Max-min cloudlet scheduling algorithm has the least energy consumption as compared to Data Aware, FCFS, MCT, RR and Min-min cloudlet scheduling algorithms as evident from Figure Configuration 5: Energy aware with deadline and cost aware scheduling of cloudlets using Montage_100 workflow model, 5 hosts and 5 VMs (BW & MIPS=1000 each) each of same configurations. Sampling rate=0.1, Host MIPS=2500. DVFS=OFF. Figure 6.13: Configuration-5 Cost Graph 134

21 Figure 6.14: Configuration-5 Time Graph Figure 6.15: Configuration-5 Energy Graph Analysis of Configuration 5: Following observations are made regarding the processing cost, makespan time and energy consumption for Config. 5: 135

22 Processing Cost: Watts Per MIPS VM allocation policy has minimum processing cost as compared to Minimum Used Host and Dedicated Network Disk Host VM allocation policies, which have higher processing cost as compared to Watts Per MIPS allocation policy. Further, all cloudlet scheduling algorithm i.e., Data Aware, FCFS, Max-min, MCT, Min-min and RR algorithms incur similar processing costs as shown in Figure Makespan time: Watts Per MIPS VM allocation policy has minimum makespan time as compared to Minimum Used Host and Dedicated Network Disk Host VM allocation policies, which have higher makespan time as compared to Watts Per MIPS allocation policy. Further, all cloudlet scheduling algorithm i.e., Data Aware, FCFS, Max-min, MCT, Min-min and RR algorithms has similar makespan time as shown in Figure Energy Consumption: Minimum Used Host VM allocation policy has minimum amount of energy consumption as compared to Dedicated Network Disk Host and Watts Per MIPS VM allocation policies. Further, Max-min cloudlet scheduling algorithm has the least energy consumption as compared to Data Aware, FCFS, MCT, RR and Min-min cloudlet scheduling algorithms as evident from Figure RESULTS A combination of Max-Min scheduling algorithm for cloudlet or task scheduling with Minimum Used Host scheduling algorithm gives the most efficient environment in terms of Processing Cost, Makespan Time and Energy Consumption maintain the QoS. It is observed that adoption of modified, conscious and logical scheduling policy in Cloud environments may drastically improve the QoS and save the energy usage as well, which is extremely important for huge Data Centers used in Cloud Environments. Task or Cloudlet Scheduling Algorithm and VM Allocation Policy where we observed Minimum Processing Cost, Minimum Makespan Time and Minimum Energy Consumption in all five configurations are shown in the following table: 136

23 Table 6.2: Result Summary. Configuration ID Minimum Processing Cost Minimum Makespan Time Minimum Energy Consumption VM Cloudlet VM Allocation Cloudlet VM Cloudlet Allocation Scheduling Policy Scheduling Allocation Scheduling Policy Algorithm. Algorithm. Policy Algorithm. Config-1 Dedicated Min Min Dedicated Min Min Min Used Max Min Network Disk Host Network Disk Host Host &Watt Per MIPS Config-2 All Three Min Min All Three Min Min All Three Max Min Config-3 Min Used Min Min Min Used Host Min-Min Min Used Max Min Host &Watt &Watt Per MIPS Host &Watt Per MIPS Per MIPS Config-4 Min Used Min Min Min Used Host Min Min Min Used Max Min Host Host Config-5 Watt Per All Six Watt Per MIPS All Six Min Used Max Min MIPS Same Same Host 6.11 CONCLUSION By carefully analyzing all the cases, it is found that combination of Min-Min and Min Used Host is the most effective in terms of Cost and Makespan Time but combination of Max-Min and Min Used Host is most energy efficient. We also found that when Min-Min gives least cost and time then Max-Min was second most efficient with a difference of approximately 0.1% and when Max-Min gives most energy efficient environment, Min-Min consumes maximum energy with a difference of approximately 3% as observed from graphs. Therefore, if we use the combination of Max-Min scheduling algorithm for cloudlet or task and Minimum Used Host scheduling algorithm for virtual machine allocation, then we get the most efficient environment in terms of processing cost, makespan time and energy consumption. 137

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

CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE 143 CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE 6.1 INTRODUCTION This chapter mainly focuses on how to handle the inherent unreliability

More information

Virtual Machine Placement in Cloud Computing

Virtual Machine Placement in Cloud Computing Indian Journal of Science and Technology, Vol 9(29), DOI: 10.17485/ijst/2016/v9i29/79768, August 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Virtual Machine Placement in Cloud Computing Arunkumar

More information

8. CONCLUSION AND FUTURE WORK. To address the formulated research issues, this thesis has achieved each of the objectives delineated in Chapter 1.

8. CONCLUSION AND FUTURE WORK. To address the formulated research issues, this thesis has achieved each of the objectives delineated in Chapter 1. 134 8. CONCLUSION AND FUTURE WORK 8.1 CONCLUSION Virtualization and internet availability has increased virtualized server cluster or cloud computing environment deployments. With technological advances,

More information

Task Scheduling Algorithm in Cloud Computing based on Power Factor

Task Scheduling Algorithm in Cloud Computing based on Power Factor Task Scheduling Algorithm in Cloud Computing based on Power Factor Sunita Sharma 1, Nagendra Kumar 2 P.G. Student, Department of Computer Engineering, Shri Ram Institute of Science & Technology, JBP, M.P,

More information

OVERHEADS ENHANCEMENT IN MUTIPLE PROCESSING SYSTEMS BY ANURAG REDDY GANKAT KARTHIK REDDY AKKATI

OVERHEADS ENHANCEMENT IN MUTIPLE PROCESSING SYSTEMS BY ANURAG REDDY GANKAT KARTHIK REDDY AKKATI CMPE 655- MULTIPLE PROCESSOR SYSTEMS OVERHEADS ENHANCEMENT IN MUTIPLE PROCESSING SYSTEMS BY ANURAG REDDY GANKAT KARTHIK REDDY AKKATI What is MULTI PROCESSING?? Multiprocessing is the coordinated processing

More information

Operating Systems Unit 6. Memory Management

Operating Systems Unit 6. Memory Management Unit 6 Memory Management Structure 6.1 Introduction Objectives 6.2 Logical versus Physical Address Space 6.3 Swapping 6.4 Contiguous Allocation Single partition Allocation Multiple Partition Allocation

More information

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

Multi-Criteria Strategy for Job Scheduling and Resource Load Balancing in Cloud Computing Environment Indian Journal of Science and Technology, Vol 8(30), DOI: 0.7485/ijst/205/v8i30/85923, November 205 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Multi-Criteria Strategy for Job Scheduling and Resource

More information

ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT

ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT PhD Summary DOCTORATE OF PHILOSOPHY IN COMPUTER SCIENCE & ENGINEERING By Sandip Kumar Goyal (09-PhD-052) Under the Supervision

More information

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

Chapter 5. Minimization of Average Completion Time and Waiting Time in Cloud Computing Environment Chapter 5 Minimization of Average Completion Time and Waiting Time in Cloud Computing Cloud computing is the use of the Internet for the tasks the users performing on their computer. Cloud computing, also

More information

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

Dynamic Task Scheduling in Cloud Computing Based on the Availability Level of Resources Vol. 1, No. 8 (217), pp.21-36 http://dx.doi.org/1.14257/ijgdc.217.1.8.3 Dynamic Task Scheduling in Cloud Computing Based on the Availability Level of Resources Elhossiny Ibrahim 1, Nirmeen A. El-Bahnasawy

More information

Improved Task Scheduling Algorithm in Cloud Environment

Improved Task Scheduling Algorithm in Cloud Environment Improved Task Scheduling Algorithm in Cloud Environment Sumit Arora M.Tech Student Lovely Professional University Phagwara, India Sami Anand Assistant Professor Lovely Professional University Phagwara,

More information

A QoS Load Balancing Scheduling Algorithm in Cloud Environment

A QoS Load Balancing Scheduling Algorithm in Cloud Environment A QoS Load Balancing Scheduling Algorithm in Cloud Environment Sana J. Shaikh *1, Prof. S.B.Rathod #2 * Master in Computer Engineering, Computer Department, SAE, Pune University, Pune, India # Master in

More information

Nowadays data-intensive applications play a

Nowadays data-intensive applications play a Journal of Advances in Computer Engineering and Technology, 3(2) 2017 Data Replication-Based Scheduling in Cloud Computing Environment Bahareh Rahmati 1, Amir Masoud Rahmani 2 Received (2016-02-02) Accepted

More information

ABSTRACT I. INTRODUCTION

ABSTRACT I. INTRODUCTION 2018 IJSRSET Volume 4 Issue 2 Print ISSN: 2395-1990 Online ISSN : 2394-4099 National Conference on Advanced Research Trends in Information and Computing Technologies (NCARTICT-2018), Department of IT,

More information

ENERGY EFFICIENT VIRTUAL MACHINE INTEGRATION IN CLOUD COMPUTING

ENERGY EFFICIENT VIRTUAL MACHINE INTEGRATION IN CLOUD COMPUTING ENERGY EFFICIENT VIRTUAL MACHINE INTEGRATION IN CLOUD COMPUTING Mrs. Shweta Agarwal Assistant Professor, Dept. of MCA St. Aloysius Institute of Technology, Jabalpur(India) ABSTRACT In the present study,

More information

Chapter 3. Design of Grid Scheduler. 3.1 Introduction

Chapter 3. Design of Grid Scheduler. 3.1 Introduction Chapter 3 Design of Grid Scheduler The scheduler component of the grid is responsible to prepare the job ques for grid resources. The research in design of grid schedulers has given various topologies

More information

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

A Process Scheduling Algorithm Based on Threshold for the Cloud Computing Environment Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 4, April 2014,

More information

Storage Solutions for VMware: InfiniBox. White Paper

Storage Solutions for VMware: InfiniBox. White Paper Storage Solutions for VMware: InfiniBox White Paper Abstract The integration between infrastructure and applications can drive greater flexibility and speed in helping businesses to be competitive and

More information

Modeling and Optimization of Resource Allocation in Cloud

Modeling and Optimization of Resource Allocation in Cloud PhD Thesis Progress First Report Thesis Advisor: Asst. Prof. Dr. Tolga Ovatman Istanbul Technical University Department of Computer Engineering January 8, 2015 Outline 1 Introduction 2 Studies Time Plan

More information

Simulation of Cloud Computing Environments with CloudSim

Simulation of Cloud Computing Environments with CloudSim Simulation of Cloud Computing Environments with CloudSim Print ISSN: 1312-2622; Online ISSN: 2367-5357 DOI: 10.1515/itc-2016-0001 Key Words: Cloud computing; datacenter; simulation; resource management.

More information

Power-Aware Scheduling of Virtual Machines in DVFS-enabled Clusters

Power-Aware Scheduling of Virtual Machines in DVFS-enabled Clusters Power-Aware Scheduling of Virtual Machines in DVFS-enabled Clusters Gregor von Laszewski, Lizhe Wang, Andrew J. Younge, Xi He Service Oriented Cyberinfrastructure Lab Rochester Institute of Technology,

More information

Efficient Load Balancing Task Scheduling in Cloud Computing using Raven Roosting Optimization Algorithm

Efficient Load Balancing Task Scheduling in Cloud Computing using Raven Roosting Optimization Algorithm Volume 8, No. 5, May-June 2017 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info ISSN No. 0976-5697 Efficient Load Balancing Task Scheduling

More information

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

Performance evaluation of Load Balancing with Service Broker policies for various workloads in cloud computing Performance evaluation of Load Balancing with Service Broker policies for various workloads in cloud computing 1 Divyani, 2 Dr Ramesh Kumar, 3 Sudip Bhattacharya 1 Research Scholar, 2 Professor, 3 Assistant

More information

Energy efficient mapping of virtual machines

Energy efficient mapping of virtual machines GreenDays@Lille Energy efficient mapping of virtual machines Violaine Villebonnet Thursday 28th November 2013 Supervisor : Georges DA COSTA 2 Current approaches for energy savings in cloud Several actions

More information

In cloud computing, IaaS approach is to

In cloud computing, IaaS approach is to Journal of Advances in Computer Engineering and Technology, 1(3) 2015 Optimization Task Scheduling Algorithm in Cloud Computing Somayeh Taherian Dehkordi 1, Vahid Khatibi Bardsiri 2 Received (2015-06-27)

More information

Chapter 3 Virtualization Model for Cloud Computing Environment

Chapter 3 Virtualization Model for Cloud Computing Environment Chapter 3 Virtualization Model for Cloud Computing Environment This chapter introduces the concept of virtualization in Cloud Computing Environment along with need of virtualization, components and characteristics

More information

A SURVEY OF VARIOUS SCHEDULING ALGORITHM IN CLOUD COMPUTING ENVIRONMENT

A SURVEY OF VARIOUS SCHEDULING ALGORITHM IN CLOUD COMPUTING ENVIRONMENT A SURVEY OF VARIOUS SCHEDULING ALGORITHM IN CLOUD COMPUTING ENVIRONMENT Pinal Salot M.E, Computer Engineering, Alpha College of Engineering, Gujarat, India, pinal.salot@gmail.com Abstract computing is

More information

Survey on MapReduce Scheduling Algorithms

Survey on MapReduce Scheduling Algorithms Survey on MapReduce Scheduling Algorithms Liya Thomas, Mtech Student, Department of CSE, SCTCE,TVM Syama R, Assistant Professor Department of CSE, SCTCE,TVM ABSTRACT MapReduce is a programming model used

More information

An Optimized Virtual Machine Migration Algorithm for Energy Efficient Data Centers

An Optimized Virtual Machine Migration Algorithm for Energy Efficient Data Centers International Journal of Engineering Science Invention (IJESI) ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 8 Issue 01 Ver. II Jan 2019 PP 38-45 An Optimized Virtual Machine Migration Algorithm

More information

CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION

CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant

More information

Load Balancing Algorithms in Cloud Computing: A Comparative Study

Load Balancing Algorithms in Cloud Computing: A Comparative Study Load Balancing Algorithms in Cloud Computing: A Comparative Study T. Deepa Dr. Dhanaraj Cheelu Ravindra College of Engineering for Women G. Pullaiah College of Engineering and Technology Kurnool Kurnool

More information

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

A New Approach to Ant Colony to Load Balancing in Cloud Computing Environment A New Approach to Ant Colony to Load Balancing in Cloud Computing Environment Hamid Mehdi Department of Computer Engineering, Andimeshk Branch, Islamic Azad University, Andimeshk, Iran Hamidmehdi@gmail.com

More information

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

Double Threshold Based Load Balancing Approach by Using VM Migration for the Cloud Computing Environment www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 1 January 2015, Page No. 9966-9970 Double Threshold Based Load Balancing Approach by Using VM Migration

More information

PROFILING BASED REDUCE MEMORY PROVISIONING FOR IMPROVING THE PERFORMANCE IN HADOOP

PROFILING BASED REDUCE MEMORY PROVISIONING FOR IMPROVING THE PERFORMANCE IN HADOOP ISSN: 0976-2876 (Print) ISSN: 2250-0138 (Online) PROFILING BASED REDUCE MEMORY PROVISIONING FOR IMPROVING THE PERFORMANCE IN HADOOP T. S. NISHA a1 AND K. SATYANARAYAN REDDY b a Department of CSE, Cambridge

More information

RIAL: Resource Intensity Aware Load Balancing in Clouds

RIAL: Resource Intensity Aware Load Balancing in Clouds RIAL: Resource Intensity Aware Load Balancing in Clouds Liuhua Chen and Haiying Shen and Karan Sapra Dept. of Electrical and Computer Engineering Clemson University, SC, USA 1 Outline Introduction System

More information

Managing Performance Variance of Applications Using Storage I/O Control

Managing Performance Variance of Applications Using Storage I/O Control Performance Study Managing Performance Variance of Applications Using Storage I/O Control VMware vsphere 4.1 Application performance can be impacted when servers contend for I/O resources in a shared storage

More information

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

Bio-Inspired Techniques for the Efficient Migration of Virtual Machine for Load Balancing In Cloud Computing Volume 118 No. 24 2018 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ Bio-Inspired Techniques for the Efficient Migration of Virtual Machine for Load Balancing

More information

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

Load Balancing in Cloud Computing Priya Bag 1 Rakesh Patel 2 Vivek Yadav 3 IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 09, 2014 ISSN (online): 2321-0613 Load Balancing in Cloud Computing Priya Bag 1 Rakesh Patel 2 Vivek Yadav 3 1,3 B.E. Student

More information

TDDD82 Secure Mobile Systems Lecture 6: Quality of Service

TDDD82 Secure Mobile Systems Lecture 6: Quality of Service TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani

More information

Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen

Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen Presenter: Haiying Shen Associate professor *Department of Electrical and Computer Engineering, Clemson University,

More information

Consolidating Complementary VMs with Spatial/Temporalawareness

Consolidating Complementary VMs with Spatial/Temporalawareness Consolidating Complementary VMs with Spatial/Temporalawareness in Cloud Datacenters Liuhua Chen and Haiying Shen Dept. of Electrical and Computer Engineering Clemson University, SC, USA 1 Outline Introduction

More information

Energy-Aware Dynamic Load Balancing of Virtual Machines (VMs) in Cloud Data Center with Adaptive Threshold (AT) based Migration

Energy-Aware Dynamic Load Balancing of Virtual Machines (VMs) in Cloud Data Center with Adaptive Threshold (AT) based Migration Khushbu Maurya et al, International Journal of Computer Science and Mobile Computing, Vol.4 Issue.12, December- 215, pg. 1-7 Available Online at www.ijcsmc.com International Journal of Computer Science

More information

CHAPTER 7 CONCLUSION AND FUTURE SCOPE

CHAPTER 7 CONCLUSION AND FUTURE SCOPE 121 CHAPTER 7 CONCLUSION AND FUTURE SCOPE This research has addressed the issues of grid scheduling, load balancing and fault tolerance for large scale computational grids. To investigate the solution

More information

Energy Aware Scheduling in Cloud Datacenter

Energy Aware Scheduling in Cloud Datacenter Energy Aware Scheduling in Cloud Datacenter Jemal H. Abawajy, PhD, DSc., SMIEEE Director, Distributed Computing and Security Research Deakin University, Australia Introduction Cloud computing is the delivery

More information

Elastic Resource Provisioning for Cloud Data Center

Elastic Resource Provisioning for Cloud Data Center Elastic Resource Provisioning for Cloud Data Center Thant Zin Tun, and Thandar Thein Abstract Cloud data centers promises flexible, scalable, powerful and cost-effective executing environment to users.

More information

Grid Scheduler. Grid Information Service. Local Resource Manager L l Resource Manager. Single CPU (Time Shared Allocation) (Space Shared Allocation)

Grid Scheduler. Grid Information Service. Local Resource Manager L l Resource Manager. Single CPU (Time Shared Allocation) (Space Shared Allocation) Scheduling on the Grid 1 2 Grid Scheduling Architecture User Application Grid Scheduler Grid Information Service Local Resource Manager Local Resource Manager Local L l Resource Manager 2100 2100 2100

More information

QoS Guided Min-Mean Task Scheduling Algorithm for Scheduling Dr.G.K.Kamalam

QoS Guided Min-Mean Task Scheduling Algorithm for Scheduling Dr.G.K.Kamalam International Journal of Computer Communication and Information System(IJJCCIS) Vol 7. No.1 215 Pp. 1-7 gopalax Journals, Singapore available at : www.ijcns.com ISSN: 976 1349 ---------------------------------------------------------------------------------------------------------------------

More information

Energy Efficient in Cloud Computing

Energy Efficient in Cloud Computing Energy Efficient in Cloud Computing Christoph Aschberger Franziska Halbrainer May 24, 2013 1 of 25 Introduction Energy consumption by Google 2011: 2,675,898 MWh. We found that we use roughly as much electricity

More information

An Improved Heft Algorithm Using Multi- Criterian Resource Factors

An Improved Heft Algorithm Using Multi- Criterian Resource Factors An Improved Heft Algorithm Using Multi- Criterian Resource Factors Renu Bala M Tech Scholar, Dept. Of CSE, Chandigarh Engineering College, Landran, Mohali, Punajb Gagandeep Singh Assistant Professor, Dept.

More information

An Improved Task Scheduling Algorithm based on Max-min for Cloud Computing

An Improved Task Scheduling Algorithm based on Max-min for Cloud Computing An Improved Task Scheduling Algorithm based on Max-min for Cloud Computing Santhosh B 1, Dr. Manjaiah D.H 2 Research Scholar, Dept. of Computer Science, Mangalore University, Karnataka, India 1 Professor,

More information

Study of Load Balancing Schemes over a Video on Demand System

Study of Load Balancing Schemes over a Video on Demand System Study of Load Balancing Schemes over a Video on Demand System Priyank Singhal Ashish Chhabria Nupur Bansal Nataasha Raul Research Scholar, Computer Department Abstract: Load balancing algorithms on Video

More information

Efficient Task Scheduling Algorithms for Cloud Computing Environment

Efficient Task Scheduling Algorithms for Cloud Computing Environment Efficient Task Scheduling Algorithms for Cloud Computing Environment S. Sindhu 1 and Saswati Mukherjee 2 1 Research Scholar, Department of Information Science and Technology sindhu.nss@gmail.com 2 Professor

More information

A priority based dynamic bandwidth scheduling in SDN networks 1

A priority based dynamic bandwidth scheduling in SDN networks 1 Acta Technica 62 No. 2A/2017, 445 454 c 2017 Institute of Thermomechanics CAS, v.v.i. A priority based dynamic bandwidth scheduling in SDN networks 1 Zun Wang 2 Abstract. In order to solve the problems

More information

MediaTek CorePilot 2.0. Delivering extreme compute performance with maximum power efficiency

MediaTek CorePilot 2.0. Delivering extreme compute performance with maximum power efficiency MediaTek CorePilot 2.0 Heterogeneous Computing Technology Delivering extreme compute performance with maximum power efficiency In July 2013, MediaTek delivered the industry s first mobile system on a chip

More information

Workload Aware Load Balancing For Cloud Data Center

Workload Aware Load Balancing For Cloud Data Center 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

More information

DiffServ Architecture: Impact of scheduling on QoS

DiffServ Architecture: Impact of scheduling on QoS DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics

More information

Medical practice: diagnostics, treatment and surgery in supercomputing centers

Medical practice: diagnostics, treatment and surgery in supercomputing centers International Advanced Research Workshop on High Performance Computing from Clouds and Big Data to Exascale and Beyond Medical practice: diagnostics, treatment and surgery in supercomputing centers Prof.

More information

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

PriDynSim: A Simulator for Dynamic Priority Based I/O Scheduling for Cloud Applications : A Simulator for Dynamic Priority Based I/O Scheduling for Cloud Applications *Indian Institute of Science, Bangalore, India The University of Melbourne, Parkville, Australia November 26, 2015, Bangalore

More information

Task Scheduling Algorithms with Multiple Factor in Cloud Computing Environment

Task Scheduling Algorithms with Multiple Factor in Cloud Computing Environment Task Scheduling Algorithms with Multiple Factor in Cloud Computing Environment Nidhi Bansal, Amit Awasthi and Shruti Bansal Abstract Optimized task scheduling concepts can meet user requirements efficiently

More information

Star: Sla-Aware Autonomic Management of Cloud Resources

Star: Sla-Aware Autonomic Management of Cloud Resources Star: Sla-Aware Autonomic Management of Cloud Resources Sakshi Patil 1, Meghana N Rathod 2, S. A Madival 3, Vivekanand M Bonal 4 1, 2 Fourth Sem M. Tech Appa Institute of Engineering and Technology Karnataka,

More information

Experimental Model for Load Balancing in Cloud Computing Using Throttled Algorithm

Experimental Model for Load Balancing in Cloud Computing Using Throttled Algorithm Experimental Model for Load Balancing in Cloud Computing Using Throttled Algorithm Gema Ramadhan 1, Tito Waluyo Purboyo 2, Roswan Latuconsina 3 Research Scholar 1, Lecturer 2,3 1,2,3 Computer Engineering,

More information

Disclaimer This presentation may contain product features that are currently under development. This overview of new technology represents no commitme

Disclaimer This presentation may contain product features that are currently under development. This overview of new technology represents no commitme SER1815BU DRS Advancements: What's New and What Is Being Cooked Up in Resource Management Land VMworld 2017 Thomas Bryant, VMware, Inc - @kix1979 Maarten Wiggers, VMware, Inc Content: Not for publication

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

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

Analysis of Various Load Balancing Techniques in Cloud Computing: A Review Analysis of Various Load Balancing Techniques in Cloud Computing: A Review Jyoti Rathore Research Scholar Computer Science & Engineering, Suresh Gyan Vihar University, Jaipur Email: Jyoti.rathore131@gmail.com

More information

Efficient Technique for Allocation of Processing Elements to Virtual Machines in Cloud Environment

Efficient Technique for Allocation of Processing Elements to Virtual Machines in Cloud Environment IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.8, August 216 17 Efficient Technique for Allocation of Processing Elements to Virtual Machines in Cloud Environment Puneet

More information

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

Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process Liuhua Chen, Haiying Shen and Karan Sapra Department of Electrical and Computer Engineering Clemson

More information

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

Experimental Model for Load Balancing in Cloud Computing Using Equally Spread Current Execution Load Algorithm Experimental Model for Load Balancing in Cloud Computing Using Equally Spread Current Execution Load Algorithm Ivan Noviandrie Falisha 1, Tito Waluyo Purboyo 2 and Roswan Latuconsina 3 Research Scholar

More information

LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING

LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING LOAD BALANCING ALGORITHM TO IMPROVE RESPONSE TIME ON CLOUD COMPUTING Nguyen Xuan Phi 1 and Tran Cong Hung 2 1,2 Posts and Telecommunications Institute of Technology, Ho Chi Minh, Vietnam. ABSTRACT Load

More information

Figure 1: Virtualization

Figure 1: Virtualization Volume 6, Issue 9, September 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Profitable

More information

Traffic-aware Virtual Machine Placement without Power Consumption Increment in Cloud Data Center

Traffic-aware Virtual Machine Placement without Power Consumption Increment in Cloud Data Center , pp.350-355 http://dx.doi.org/10.14257/astl.2013.29.74 Traffic-aware Virtual Machine Placement without Power Consumption Increment in Cloud Data Center Hieu Trong Vu 1,2, Soonwook Hwang 1* 1 National

More information

Chapter 8 & Chapter 9 Main Memory & Virtual Memory

Chapter 8 & Chapter 9 Main Memory & Virtual Memory Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array

More information

CPU THREAD PRIORITIZATION USING A DYNAMIC QUANTUM TIME ROUND-ROBIN ALGORITHM

CPU THREAD PRIORITIZATION USING A DYNAMIC QUANTUM TIME ROUND-ROBIN ALGORITHM CPU THREAD PRIORITIZATION USING A DYNAMIC QUANTUM TIME ROUND-ROBIN ALGORITHM Maysoon A. Mohammed 1, 2, Mazlina Abdul Majid 1, Balsam A. Mustafa 1 and Rana Fareed Ghani 3 1 Faculty of Computer System &

More information

Towards Deadline Guaranteed Cloud Storage Services Guoxin Liu, Haiying Shen, and Lei Yu

Towards Deadline Guaranteed Cloud Storage Services Guoxin Liu, Haiying Shen, and Lei Yu Towards Deadline Guaranteed Cloud Storage Services Guoxin Liu, Haiying Shen, and Lei Yu Presenter: Guoxin Liu Ph.D. Department of Electrical and Computer Engineering, Clemson University, Clemson, USA Computer

More information

A Comparative Study of Various Scheduling Algorithms in Cloud Computing

A Comparative Study of Various Scheduling Algorithms in Cloud Computing American Journal of Intelligent Systems 2017, 7(3): 68-72 DOI: 10.5923/j.ajis.20170703.06 A Comparative Study of Various Algorithms in Computing Athokpam Bikramjit Singh 1, Sathyendra Bhat J. 1,*, Ragesh

More information

Survey on Dynamic Resource Allocation Scheduler in Cloud Computing

Survey on Dynamic Resource Allocation Scheduler in Cloud Computing Survey on Dynamic Resource Allocation Scheduler in Cloud Computing Ms. Pooja Rathod Computer Engineering, GTU ABSTRACT Cloud Computing is one of the area in the various fields related to computer science

More information

Assignment 5. Georgia Koloniari

Assignment 5. Georgia Koloniari Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last

More information

Process Scheduling Part 2

Process Scheduling Part 2 Operating Systems and Computer Networks Process Scheduling Part 2 pascal.klein@uni-due.de Alexander Maxeiner, M.Sc. Faculty of Engineering Agenda Process Management Time Sharing Synchronization of Processes

More information

White Paper Features and Benefits of Fujitsu All-Flash Arrays for Virtualization and Consolidation ETERNUS AF S2 series

White Paper Features and Benefits of Fujitsu All-Flash Arrays for Virtualization and Consolidation ETERNUS AF S2 series White Paper Features and Benefits of Fujitsu All-Flash Arrays for Virtualization and Consolidation Fujitsu All-Flash Arrays are extremely effective tools when virtualization is used for server consolidation.

More information

Distributed Scheduling for the Sombrero Single Address Space Distributed Operating System

Distributed Scheduling for the Sombrero Single Address Space Distributed Operating System Distributed Scheduling for the Sombrero Single Address Space Distributed Operating System Donald S. Miller Department of Computer Science and Engineering Arizona State University Tempe, AZ, USA Alan C.

More information

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

Keywords: Cloud, Load balancing, Servers, Nodes, Resources Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load s in Cloud

More information

IJSER. Gayake, Prof.R.L.Paikrao

IJSER. Gayake, Prof.R.L.Paikrao Volume 7, Issue 1, January-2016 1269 Integration of Databases with Cloud Enviornment Anuradha Gayake, Prof.R.L.Paikrao Abstract Cloud computing mainly concern, shared or distributed computing, networking,

More information

A Load Balancing Approach to Minimize the Resource Wastage in Cloud Computing

A Load Balancing Approach to Minimize the Resource Wastage in Cloud Computing A Load Balancing Approach to Minimize the Resource Wastage in Cloud Computing Sachin Soni 1, Praveen Yadav 2 Department of Computer Science, Oriental Institute of Science and Technology, Bhopal, India

More information

LOAD BALANCING IN CLOUD COMPUTING USING ANT COLONY OPTIMIZATION

LOAD BALANCING IN CLOUD COMPUTING USING ANT COLONY OPTIMIZATION International Journal of Computer Engineering & Technology (IJCET) Volume 8, Issue 6, Nov-Dec 2017, pp. 54 59, Article ID: IJCET_08_06_006 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=8&itype=6

More information

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

Improving QoS Parameters for Cloud Data Centers Using Dynamic Particle Swarm Optimization Load Balancing Algorithm Improving QoS Parameters for Cloud Data Centers Using Dynamic Particle Swarm Optimization Load Balancing Algorithm Bharti Sharma Master of Computer Engineering, LDRP Institute of Technology and Research,

More information

A Cool Scheduler for Multi-Core Systems Exploiting Program Phases

A Cool Scheduler for Multi-Core Systems Exploiting Program Phases IEEE TRANSACTIONS ON COMPUTERS, VOL. 63, NO. 5, MAY 2014 1061 A Cool Scheduler for Multi-Core Systems Exploiting Program Phases Zhiming Zhang and J. Morris Chang, Senior Member, IEEE Abstract Rapid growth

More information

GSJ: VOLUME 6, ISSUE 6, August ISSN

GSJ: VOLUME 6, ISSUE 6, August ISSN GSJ: VOLUME 6, ISSUE 6, August 2018 211 Cloud Computing Simulation Using CloudSim Toolkits Md. Nadimul Islam Rajshahi University Of Engineering Technology,RUET-6204 Email: nadimruet09@gmail.com Abstract

More information

An Integration and Load Balancing in Data Centers Using Virtualization

An Integration and Load Balancing in Data Centers Using Virtualization An Integration and Load Balancing in Data Centers Using Virtualization USHA BELLAD #1 and JALAJA G *2 # Student M.Tech, CSE, B N M Institute of Technology, Bengaluru, India * Associate Professor, CSE,

More information

Artificial Bee Colony Based Load Balancing in Cloud Computing

Artificial Bee Colony Based Load Balancing in Cloud Computing I J C T A, 9(17) 2016, pp. 8593-8598 International Science Press Artificial Bee Colony Based Load Balancing in Cloud Computing Jay Ghiya *, Mayur Date * and N. Jeyanthi * ABSTRACT Planning of jobs in cloud

More information

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

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

Energy-Aware Virtual Machine Allocation for Cloud with Resource Reservation

Energy-Aware Virtual Machine Allocation for Cloud with Resource Reservation Energy-Aware Virtual Machine Allocation for Cloud with Resource Reservation Xinqian Zhang 1, Tingming Wu 1, Mingsong Chen 1,, Tongquan Wei 1, Junlong Zhou 2, Shiyan Hu 3, Rajkumar Buyya 1 Shanghai Key

More information

CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION

CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION 5.1 INTRODUCTION Generally, deployment of Wireless Sensor Network (WSN) is based on a many

More information

Global Journal of Engineering Science and Research Management

Global Journal of Engineering Science and Research Management ENHANCED MULTI OBJECTIVE TASK SCHEDULING FOR CLOUD ENVIRONMENT USING TASK GROUPING Mohana. R. S *, Thangaraj. P, Kalaiselvi. S, Krishnakumar. B * Assistant Professor (SRG), Department of Computer Science,

More information

Enhancing Cloud Resource Utilisation using Statistical Analysis

Enhancing Cloud Resource Utilisation using Statistical Analysis Institute of Advanced Engineering and Science International Journal of Cloud Computing and Services Science (IJ-CLOSER) Vol.3, No.1, February 2014, pp. 1~25 ISSN: 2089-3337 1 Enhancing Cloud Resource Utilisation

More information

International Journal of Research In Science & Engineering e-issn: Special Issue: Techno-Xtreme 16 p-issn:

International Journal of Research In Science & Engineering e-issn: Special Issue: Techno-Xtreme 16 p-issn: Cloudlet Scheduling To Optimize Cloud Computing With Wireless Sensor Network Miss. P.P.Ingale, Prof. R. N. Khobragade, Dr. V. M. Thakare Dept. CS & IT, SGBAU, Amravati, India. ingalepragati@gmail.com Dept.

More information

Characterizing Energy per Job in Cloud Applications

Characterizing Energy per Job in Cloud Applications Article Characterizing Energy per Job in Cloud Applications Thi Thao Nguyen Ho, Marco Gribaudo and Barbara Pernici, * Department of Electronics, Information and Bioengineering, Politecnico di Milano, Milan

More information

for Power Energy and

for Power Energy and Engineered for Power Management: Dell PowerEdge Servers Are Designed to Help Save Energy and Reduce Costs ABSTRACT Keeping up with the rising cost of energy is one of the greatest challenges facing IT

More information

Mitigating Data Skew Using Map Reduce Application

Mitigating Data Skew Using Map Reduce Application Ms. Archana P.M Mitigating Data Skew Using Map Reduce Application Mr. Malathesh S.H 4 th sem, M.Tech (C.S.E) Associate Professor C.S.E Dept. M.S.E.C, V.T.U Bangalore, India archanaanil062@gmail.com M.S.E.C,

More information

Energy Efficient Power Management in Virtualized Data Center

Energy Efficient Power Management in Virtualized Data Center Energy Efficient Power Management in Virtualized Data Center Kopaniya Pintuben G 1, Prof. Krunal Vaghela 2 1M.Tech, Department of Computer Engineering, School of Engineering RK University, Rajkot, India

More information

Tasks Scheduling and Resource Allocation for High Data Management in Scientific Cloud Computing Environment

Tasks Scheduling and Resource Allocation for High Data Management in Scientific Cloud Computing Environment Tasks Scheduling and Resource Allocation for High Data Management in Scientific Cloud Computing Environment Esma Insaf Djebbar (&) and Ghalem Belalem Department of Computer Science, University of Oran1,

More information

Distributed Operating Systems

Distributed Operating Systems 2 Distributed Operating Systems System Models, Processor Allocation, Distributed Scheduling, and Fault Tolerance Steve Goddard goddard@cse.unl.edu http://www.cse.unl.edu/~goddard/courses/csce855 System

More information