Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing

Cloud computing has emerged as a popular computing model to support on demand services and is rapidly becoming an important platform for scintific applications. It provide users with infrastructure, platform and software as amenity which is effortlessly accessible via Internet. It has a huge user group and has to deal with large number of task, so schedulling in cloud plays a vital role for task execution. In this paper, scheduling polices space-shared and time-shared are compared on the bases of some parametrs which are Task Profit, Task Penalty, Throughput and Net Gain. In our simulation results we shown that space-shared outperforms than time-shared policy