RSDC (Reliable Scheduling Distributed in Cloud Computing)

  • Delavar A
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper we will present a reliable scheduling algorithm in cloud computing environment. In this algorithm we create a new algorithm by means of a new technique and with classification and considering request and acknowledge time of jobs in a qualification function. By evaluating the previous algorithms, we understand that the scheduling jobs have been performed by parameters that are associated with a failure rate. Therefore in the proposed algorithm, in addition to previous parameters, some other important parameters are used so we can gain the jobs with different scheduling based on these parameters. This work is associated with a mechanism. The major job is divided to sub jobs. In order to balance the jobs we should calculate the request and acknowledge time separately. Then we create the scheduling of each job by calculating the request and acknowledge time in the form of a shared job. Finally efficiency of the system is increased. So the real time of this algorithm will be improved in comparison with the other algorithms. Finally by the mechanism presented, the total time of processing in cloud computing is improved in comparison with the other algorithms.

Cite

CITATION STYLE

APA

Delavar, A. G. (2012). RSDC (Reliable Scheduling Distributed in Cloud Computing). International Journal of Computer Science, Engineering and Applications, 2(3), 1–16. https://doi.org/10.5121/ijcsea.2012.2301

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