ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

An Improved Longest Approximate Time to End Algorithm using Dynamic Cloud Sim

Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 5)

Publication Date:

Authors : ; ;

Page : 1497-1502

Keywords : Planning; Workflow; Cloud Computing; LATE Algorithm; Improved LATE;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Longest approximate time to end scheduling algorithm sorts all the cloud jobs in queue according to their time taken in execution and other time base performance parameters. However, in many ways for scheduling analysis, planning makes a lot of difference in performance and in removing bottlenecks before final execution. But for these additional parameters are needed to consider. Therefore, in this research work parameters like inter node bandwidth, traffic, congestion have been used for building a plan for scheduling, simulated results show significant improvements in performance is concerning of time performance parameters.

Last modified: 2021-06-30 21:46:31