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.

Highlights

  • Cloud computing appears as a new computer model of the company whether private, public or hybrid

  • We implemented in Java our approach based on the branchand-bound applied to the task scheduling, in cloud computing and considering Quality of service (QoS) constraints

  • We studied an algorithm for task scheduling in a cloud computing environment using an exact approach

Read more

Summary

Abdellah IDRISSI and 2 Faouzia ZEGRARI

Computer Sciences Laboratory (LRI), Computer Sciences Department, Faculty of Sciences, University Mohammed V – Rabat. 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. 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.

INTRODUCTION
Concept of Cloud Computing
Deployment models
Advantages and disadvantages
Problem
Analysis of the problem
Presentation
Branch And Bound algorithm
EXPERIMENTATION AND RESULTS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call