Design and Implementation of Scheduling Algorithm for High Performance Cloud Computing

Cloud computing is technology that provides access to the services anywhere, anytime and paying for the services that are being used. This allows cloud users to use the data and application, if needed anywhere but must have access to the internet. The main task to be handled is the services arriving at the server for service. It is necessary to handle all services by doing proper scheduling mechanism so as to provide them service in well maintained manner. Better Quality of Service has to be provided to all clients. This strategy is used to schedule multiple user’s services which start at any time and the QoS requirements are main consideration. Two scheduling algorithms i.e. First Come First Serve and Round Robin have been executed. Experiments have been done to schedule services of fixed length as well as variable length. In both the cases this has been proved that First Come First Serve shows less average waiting time as compared to Round Robin Scheduling.