A New Approach for a Better Load Balancing and a Better Distribution of Resources in Cloud Computing

TL;DR

This paper introduces a Branch and Bound based method for task scheduling in cloud computing that optimizes load balancing and resource distribution while respecting QoS constraints, showing promising experimental results.

Contribution

It presents a novel task scheduling approach using Branch and Bound to improve load balancing and resource allocation in cloud environments.

Findings

Effective task assignment to virtual machines

Enhanced load balancing and resource distribution

Promising experimental performance results

Abstract

Cloud computing is a new paradigm where data and services of Information Technology are provided via the Internet by using remote servers. It represents a new way of delivering computing resources allowing access to the network on demand. Cloud computing consists of several services, each of which can hold several tasks. As the problem of scheduling tasks is an NP-complete problem, the task management can be an important element in the technology of cloud computing. To optimize the performance of virtual machines hosted in cloud computing, several algorithms of scheduling tasks have been proposed. In this paper, we present an approach allowing to solve the problem optimally and to take into account the QoS constraints based on the different user requests. This technique, based on the Branch and Bound algorithm, allows to assign tasks to different virtual machines while ensuring load balance and a better distribution of resources. The experimental results show that our approach gives very promising results for an effective tasks planning. - See more at: http://thesai.org/Publications/ViewPaper?Volume=6&Issue=10&Code=IJACSA&SerialNo=36#sthash.aV1fxMaQ.dpuf