Fault Tolerance Based Comparative Analysis of Scheduling Algorithms in Cloud Computing
Archana Pandita, Prabhat Kumar Upadhyay, Nisheeth Joshi · 2018
Cloud computing is being paid a lot of consideration both in scholastics and ventures, from exploring researchers to clients. Cloud computing is a membership-based administration which gives arranged storage and PC assets. With the beginning of this pay-per-use innovation, the application facilitating, capacity, conveyance and cost of computing are diminished considerably. With all the advantages of cloud computing there are certain flaws like fault tolerance associated with them. There are many models of fault tolerance given by different researchers which have their own benefits and limitations. In this paper, we aim to study and compare various scheduling algorithms in cloud computing with respect to fault tolerance. The pros and cons of these algorithms are also briefly discussed for comparison. There are a lot of findings going on in the area of fault tolerance in cloud computing and this study will definitely help the researchers to build an efficient fault tolerance framework. This analysis can also be employed for evaluating appropriate framework.