Abstract

Cloud computing is a new technology and Due to its economical and operational benefits it is the most popular concept in IT today. Clouds consist of a collection of virtualized resources that can be provisioned on demand, depending on the clients' needs. In this technology almost everything like hardware, software and platform are provided as a service. In cloud computing one Host is a component that represents a physical computing and a Datacenter is composed by a set of hosts, which are responsible for managing Virtual Machines during their life cycles. An important issue in cloud computing is the scheduling of virtual machines requests, so that the requested tasks can be completed in a minimum time according to the user defined time. This paper presents and evaluate a new scheduling algorithm that is an efficient technique for scheduling virtual machines between datacenters. The simulation results show the effectiveness of our algorithm by comparing it with the two scheduling techniques First Fit (FCFS) and Round Robin (RR). The results depict that the proposed scheduling algorithm can be effectively deployed on Clouds. General Terms Soft Computing, Distributed Systems, Algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call