Professional Documents
Culture Documents
Abstract
Cloud computing is known as a provider of dynamic services using very large scalable and virtualized resources over the Internet. Due to novelty of cloud computing field, there is no many standard task scheduling algorithm used in cloud environment. Especially that in cloud, there is a high communication cost that prevents well known task schedulers to be applied in large scale distributed environment. Today, researchers attempt to build job scheduling algorithms that are compatible and applicable in Cloud Computing environment Job scheduling is most important task in cloud computing environment because user have to pay for resources used based upon time. Hence efficient utilization of resources must be important and for that scheduling plays a vital role to get maximum benefit from the resources. In this paper we are studying various scheduling algorithm and issues related to them in cloud computing.
2. SCHEDULING
There has been various types of scheduling algorithm exist in distributed computing system. Most of them can be applied in the cloud environment with suitable verifications. The main advantage of job scheduling algorithm is to achieve a high performance computing and the best system throughput. Traditional job scheduling algorithms are not able to provide scheduling in the cloud environments. According to a simple classification, job scheduling algorithms in cloud computing can be categorized into two main groups; Batch mode heuristic scheduling algorithms (BMHA) and online mode heuristic algorithms. In BMHA, Jobs are queued and collected into a set when they arrive in the system. The scheduling algorithm will start after a fixed period of time. The main examples of BMHA based algorithms are; First Come First Served scheduling algorithm (FCFS), Round Robin scheduling algorithm (RR), MinMin algorithm and MaxMin algorithm.
4. COMPARISON
Scheduling Algorithm
Findings 1. It is used to reduce makespan 1. It is used to reduce processing time. 2. It is efficient for load balancing. 1. High QoS 2.High throughput
Resource-AwareScheduling algorithm (RASA) RSDC (RELIABLE SCHEDULING DISTRIBUTED IN CLOUD COMPUTING) An Optimal Model for Priority based Service Scheduling Policy for Cloud Computing
Batch Mode
processing time
Quality of Service, Service request time
Grouped task
Batch Mode
Cloud environment
Batch Mode
Grouped Task
Dependency mode
Batch mode
Cost, Performance
Performance and Cost evaluation of Gang Scheduling in a Cloud Computing System with Job Migrations and Starvation Handling
Batch mode
Performance, Cost,
1.It is used for efficient load balancing. 2. Petrin net is used to remove limitation of maxmin algorithm. 1The Qos requirements of the cloud computing user and the maximum profits of the cloud computing service provider are achieved. 1.Measures both resource cost and computation performance 2. Improves the computation /communication ratio 1. The application of migrations and starvation handling had a significant effect on the model. 2. It improves performance.
Cloud environment
Cloud environment
Cloud environment
Cloud environment
CONCLUSION
Scheduling is one of the most important task in cloud computing environment. In this paper we have analyze various scheduling algorithm and tabulated various parameter. We have noticed that disk space management is critical issue in virtual environment. Existing scheduling algorithm gives high throughput and cost effective but they do not consider reliability and availability. So we need algorithm that improve availability and reliability in cloud computing environment. 2.
REFERENCES:
1. Arash Ghorbannia Delavar,Mahdi Javanmard , Mehrdad Barzegar Shabestari and Marjan Khosravi Talebi RSDC (RELIABLE SCHEDULING
3.
DISTRIBUTED IN CLOUD COMPUTING) in International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.2, No.3, June 2012 Saeed Parsa and Reza Entezari-Maleki, RASA: A New Task Scheduling Algorithm in Grid Environment in World Applied Sciences Journal 7 (Special Issue of Computer & IT): 152-160, 2009.Berry M. W., Dumais S. T., OBrien G. W. Using linear algebra for intelligent information retrieval, SIAM Review, 1995, 37, pp. 573595. Dr. M. Dakshayini, Dr. H. S. Guruprasad An Optimal Model for Priority based Service Scheduling Policy for Cloud Computing Environment International Journal of Computer Applications (0975 8887) Volume 32 No.9, October 2011
5.
6.
7.
BIOGRAPHIES:
Pinal Salot (M.E), Alpha College of Engineering and Technology, Khatraj, Kalol