Downloads: 104
Research Paper | Computer Science & Engineering | India | Volume 4 Issue 5, May 2015
An Improved Longest Approximate Time to End Algorithm using Dynamic Cloud Sim
Kirandeep Kaur [4] | Khushdeep Kaur [5]
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.
Keywords: Planning, Workflow, Cloud Computing, LATE Algorithm, Improved LATE
Edition: Volume 4 Issue 5, May 2015,
Pages: 1497 - 1502
Similar Articles with Keyword 'Planning'
Downloads: 159 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Computer Science & Engineering, India, Volume 6 Issue 11, November 2017
Pages: 338 - 384Managing Uncertainty in Supply Chain Operating Cost Using Genetic Algorithm
Dr. Niju P. Joseph | Dr. Priyanka Surendran
Downloads: 0
Research Paper, Computer Science & Engineering, Singapore, Volume 13 Issue 5, May 2024
Pages: 711 - 722General Multi-Objective Performance Expression for Population-Based Search and Optimization
Eik Fun Khor