International Journal of Science and Research (IJSR), India Online ISSN: 2319-7064Volume 2 Issue 6, June 2013www.ijsr.net
The middle layer is Platform as a Service (PaaS), a service platform that developers can use to deploy their ownapplications. It Provides network accessible access to a programming or runtime environment with scalablecompute and data structures embedded in It. Well-knownPaaS service providers include Amazon Web Services and Google App Engine.
The top layer is Software as a Service (SaaS), whichenables each user to access services according to his or her requirements. Provides network accessible access tosoftware application programs. Examples of SaaS service providers are Microsoft’s online update service, Trend Micro Internet Security and so on.The rest of the paper is organized as follows. In next sectionLiterature Survey about different scheduling algorithms of Virtual machine in cloud are discussed. Section 3 describesExisting Scheduling Algorithm in Cloud Computing. Section4 discusses The Proposed Scheduling Algorithm. Section 5discusses Experimental Setup and Result’s are analysed.Conclusions are discussed in section 6.
In  Dynamic Priority algorithm is discussed. Mainly thisscheduling a virtual machine in Eucalyptus platform and itwill work under various circumstances. But this algorithmdoes not handle certain cases because of failure of nodes.Also the uptime and downtime of nodes have not beenmeasured.In  Genetic Algorithm is discussed, in genetic algorithmthe problem is the load balancing. So, the strategy for scheduling the VM resources on load balancing is based onthe genetic algorithm. According to historical data and thecurrent state of the system through the genetic algorithm, thisscheduling strategy computes the needed VM resources after the deployment and chooses the least-affective solutionthrough which it achieves the best load balancing and avoidsor reduces the dynamic migration. In the genetic algorithm,the resources are deployed and are arranged to every physical node. By this way it solves the problems. Thegenetic algorithm introduces an average load distance inorder to measure the overall load balancing effect of thealgorithm. Virtual machine (VM) migration is used to avoid the conflicts on traditional systems like CPU and memory,micro-architectural resources such as shared caches, memorycontrollers, and non uniform memory access (NUMA).Theserelied on intra-system scheduling reduce contentions. InArchitectural Shared Resources  it shows the live VMmigration which is used to mitigate the contentions onmicro-architecture resources. This reduces conflicts. It showsthe evaluation of two-cluster level virtual machinescheduling techniques for cache sharing and it does notrequire any prior knowledge on the behaviours of VMs.In Broker Virtual Machine Communication Framework they have proposed an efficient algorithm to provide aneffective and fast execution of the task assigned by the user.So there is an effective communication framework between broker and virtual machine for assigning the task and fetching the results in optimum time and cost using Broker Virtual Machine Communication Framework (BVCF).Prioritizing the VM and cloudlet scheduling through FCFS,and Round Robin, this is implemented over the cloudsimunder the VM scheduling policies by the modification whichis based on virtual machine cost. The basic building block are scheduling over Virtual Machine as well as over Cloudlets and Retransmission of Cloudlets. Round Robinalgorithm helps in the Fast Execution due to Round RobinScheduling Policy applied on the equally sized cloudlets. Allcloudlets will execute as after each and every successfullyreceived cloudlet VM sends the acknowledgement and for the unsuccessful cloudlets sends the retransmit message. Italso results into Lower Cost as the VM’s are prioritized according to its Cost only. Execution of cloudlets is beinganalysed over Round Robin and FCFS scheduling policy.
Existing Scheduling Algorithm in CloudComputing
Scheduling in Eucalyptus determines the method by whichVirtual Machines are allocated to the nodes. This is done to balance the load on all the nodes effectively and to achieve atarget quality of service. The need for a good schedulingalgorithm arises from the requirement for it to performmultitasking and multiplexing. The scheduling algorithm inEucalyptus is concerned mainly with:
- number of VMs that are successfullyallocated per time unit.
- amount of time it takes from when arequest was submitted until the first response is produced.
Fairness / Waiting Time
– All the requests for anallocation of a node should be treated in the same manner without any bias.
The Greedy algorithm is the defaultalgorithm used for scheduling of Virtual Machines inEucalyptus. The Greedy algorithm  is very simple and straight forward. As a matter of fact, it was the onlyscheduling policy which was in use for a long time. Onlyafter the cloud started evolving, more complex scheduling policies came into effect. The greedy algorithm uses the firstnode that it finds with suitable resources for running the VMthat is to be allocated. The first node that is identified isallocated the VM. This means that the greedy algorithmexhausts a node before it goes on to the next node.
The main advantage of the Greedy algorithm is itssimplicity.
It is both simple to implement and also the allocation of VMs do not require any complex processing.
The major drawback would be the low utilization of theavailable resources.The drawback of the Greedy algorithm is overcome by theRound Robin algorithm.
Round Robin Algorithm:
The Round Robin algorithm mainly focuses on distributing the load equally to all thenodes. Using this algorithm, the scheduler allocates one VMto a node in a cyclic manner. The round robin scheduling inthe cloud is very similar to the round robin scheduling used in the process scheduling. The scheduler starts with a node