Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing

  • Himani H
  • Singh Sidhu H
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Himani, H., & Singh Sidhu, H. (2014). Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing. International Journal of Computer Applications, 97(16), 29–33. https://doi.org/10.5120/17092-7629

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free