Enhanced Load Balanced Min-min Algorithm for Static Meta Task Scheduling in Cloud Computing

https://doi.org/10.1016/j.procs.2015.07.385Get rights and content
Under a Creative Commons license
open access

Abstract

For today's most demanding service of cloud computing, there are many tasks required to be executed by the available resources to achieve best performance, reduce response time and utilize resources. There is a need of designing a new task scheduling algorithm that outperform appropriate allocation map of task. to achieve these challenges. As Load Balanced Min-Min Algorithm selects the task with minimum completion time and assigns it to appropriate resource, it sometimes does not produce better makespan and does not utilize resources effectively. This paper represents study of variety of task scheduling algorithms and modification of Load balanced Min-Min (ELBMM) algorithm for Static Meta-Task Scheduling. The modified algorithm is built based on comprehensive study of the impact of Load balanced Min-Min algorithm for Static Meta-Task Scheduling in grid computing. Enhanced Load balanced Min-Min algorithm (ELBMM) is based on Min-Min strategy and tasks rescheduling to use the unutilized resources effectively. It selects the task with maximum completion time and assigns it to appropriate resource to produce better makespan and utilize resource effectively.

Keywords

Cloud Computing
Meta Task Scheduling
ELBMM
Min-Min algorithm.

Cited by (0)

Peer-review under responsibility of organizing committee of the 3rd International Conference on Recent Trends in Computing 2015 (ICRTC-2015).