Social based algorithm for cloud computing scheduling

In recent years regarding to the growing use of cloud services, the way of servicing the users in the platform of cloud environments has been very important. One of the raised issues in this field of study is how to schedule services. Services should be scheduled in a way that exploit the services more effectively and also provide great satisfaction of presented services among users. In this paper, we have provided an Algorithm consisting of an evolutionary nonrelated algorithm and Imperialist competition for scheduling in the cloud computing environment after evaluating some examples of scheduling algorithms based on evolutionary ideas and computational clusters, and also probing other scheduling algorithms in other distributed environments. This algorithm clusters the resources in a multi-level clustering method in which tasks are divided based on the merits of each cluster. We could reduce the average execution time of computing after implementation of this algorithm and its comparison to other similar algorithms.

کلیدواژه ها:

Cloud computing ، scheduling algorithms ، evolutionary algorithm ، Social-Based Algorithm ، Imperialist competitive algorithm ، genetic algorithm