A REVIEW AND COMPARATIVE STUDY ON TASK SCHEDULING IN GROUP MUTUAL EXCLUSION ALGORITHMS TO SOLVE CRITICAL SECTION PROBLEM BASED ON CLOUD COMPUTING

In large distributed systems which are based on cloud computing, the resources are shared to the clients. There must be some effective task scheduling method which efficiently use the different resources in cloud computing. In most of the algorithms which are based on group mutual exclusion , First come First serve scheduling method is used. But some others scheduling method are also used. These are round robin , priority scheduling and Johnson sequencing task scheduling and priority based job scheduling. All these are having some advantaged and disadvantages considering the different factors such as SLA , QoS and fault tolerance. In this paper , we present a review and comparative study of different scheduling algorithms which best suits for cloud computing.