Balancing heuristic for independent task scheduling in cloud computing

Distributed computing environment has become a new technology to execute large-scale applications and Cloud computing is one of these technologies. Resource allocation is one of the most important challenges in the Cloud Computing. The optimally assigning of the available resources to the needed cloud applications is known to be a NP complete problem. In this paper, we propose a new task scheduling strategy based on the total order for resource allocation to improve the Min-Min algorithm. We focus on minimizing the total executing time (makespan) of task scheduling and maximizing the use of resources. Experimental results demonstrate that the proposed approach permits more adaptive resources allocation for independent jobs scheduling in the cloud computing environment.