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: 2015-05-05
Authors : Kirandeep Kaur; Khushdeep Kaur;
Page : 1497-1502
Keywords : Planning; Workflow; Cloud Computing; LATE Algorithm; Improved LATE;
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.
Other Latest Articles
- Skein and Threefish Implementation on FPGA
- Assessment of Knowledge and Attitude on Male Circumcision towards Reduction of HIV/AIDS among Residents of Ishaka Town Council-Uganda
- Runoff Computation on River Omi Catchment Using Spatially Distributed Terrain
- Effects of Recruitment Practices on Employee Performance in the Cooperative Sector in Kenya; Case of Kenya Union of Savings and Credit Co-Operatives
- Performance Improvement In MANET By Using A Modified BEB Algorithm
Last modified: 2021-06-30 21:46:31