Abstract

The Cloud is a computing platform that provides on-demand access to a shared pool of configurable resources such as networks, servers, storage that can be rapidly provisioned and released with minimal management effort from clients. At its core, Cloud computing focuses on manimizing the effectiveness of the shared resources. Therefore, workflow scheduling is one of the challenges that the Cloud must tackle especially if a large number of tasks are executed on geographically distributed servers. The Cloud is comprised of computational and storage servers that aim to provision efficient access to remote and geographically distributed resources. To that end, many challenges, specifically workflow scheduling, are yet to be solved such. Despite it has been the focus of many researchers, a handful efficient solutions have been proposed for Cloud computing. In this work, we propose a novel algorithm for workflow scheduling that is derived from the Opposition-based Differential Evolution method, MODE. This algorithm not only ensures fast convergence but also averts getting trapped in local extrema. Our simulation experiments Cloud Sim show that MODE is superior to its predecessors. Moreover, the deviation of its solution from the optimal one is negligible.

Highlights

  • The Cloud is a computing platform that provides convenient, on-demand access to a shared pool of configurable computing resources such as networks, servers, storage that can be rapidly provisioned and released with minimal management effort on clients

  • Our work described in this paper is a new attempt to introduce a more efficient scheduling algorithm

  • The design of Opposition-based Differential Evolution (ODE) entails calculating the opposite of individuals in the population, which can be carried out as follows: Let a = Max{P(Si)}; ∀i=1,2,..,N b = Min{P(Si)}; ∀i=1,2,..,N Assuming that the particle xi = (Siπ(1), Siπ(2),...,Siπ(M)); Siπ(j)

Read more

Summary

Introduction

The Cloud is a computing platform that provides convenient, on-demand access to a shared pool of configurable computing resources such as networks, servers, storage that can be rapidly provisioned and released with minimal management effort on clients. Workflow scheduling is one of the challenges that the Cloud must tackle especially if a large number of tasks are executed on geographically distributed servers. This requires a reasonable scheduling algorithm in order to minimize a task completion time (makespan). Our work described in this paper is a new attempt to introduce a more efficient scheduling algorithm.

Methods
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