Performance Evaluation of Scheduling Algorithms for Real Time Cloud Computing

Cloud computing shares data and offers services transparently among users. With the increase in number of users of cloud the tasks to be scheduled increases. The performance of cloud depends on the task scheduling algorithms used in the components or brokering components. Scheduling of tasks on cloud computing systems is one of the research problems, where the matching of machines and completion time of the tasks are considered. Fault-tolerance becomes an important key to establish dependability in cloud computing system. In task scheduling, if task not completed in its deadline, then it is one type of fault in scheduling of tasks. In this thesis this type of faults are taken and try to overcome it.