Load Balancing in Cloud Computing using Shortest Job First and Round Robin Approach

Shreya Saini, Amninder Kaur

Abstract: Cloud computing depends on sharing of assets to accomplish intelligibility and economies of scale, like a utility (like the power matrix) over a network In cloud computing various users sends request for the transmission of data for different demands. The access to different no. of user increases load on the cloud servers. Due to these cloud server does not provides best efficiency. To provide best efficiency load has to be balanced main problem in the paper is that different jobs can be divides in tasks. This paper the job dependency checking is done on the basis of directed a cyclic graph. The dependency checking the make span has to be created on the basis of shortest job first and pound robin approach. The minimization can be done on the basis of using min-min algorithm.

Keywords: Cloud computing, round robin, shortest job first scheduling

How to Cite?: Shreya Saini, Amninder Kaur, "Load Balancing in Cloud Computing using Shortest Job First and Round Robin Approach ", Volume 4 Issue 9, September 2015, International Journal of Science and Research (IJSR), Pages: 1577-1580, https://www.ijsr.net/getabstract.php?paperid=SUB158222, DOI: https://dx.doi.org/10.21275/SUB158222

Download Citation: APA | MLA | BibTeX | EndNote | RefMan