Current Proceedings on Technology

Yazarlar: Elahe Doostsadigh, Reza Asemi, Hadis Barari

Konular:-

Anahtar Kelimeler:Task scheduling,Cloud computing,Lottery algorithm,Makespan.

Özet: Cloud computing paradigm of distributed computing, applications are composed a large number of resourcesand services for the purpose of sharing resources and services on the internet. Task scheduling problems haveparamount importance and are trying to determine an efficient scheduling to run tasks and optimal resourceallocation. There are many different ways to schedule the tasks in cloud environment which one of the efficiencymeasures method is makespan. Makespan is the completion time of all tasks and the purpose is its reduction.This paper introduces a new method for task scheduling based on lottery in order to find a solution for mappinga set of requests to system's available resources which are classi fied with K-means algorithm according tocondition of cloud systems and its implementation. Algorithm runs on requests and classified resources inparallel. Using the characteristic of min-min method tried to accelerate the process of finding the answer. Theproposed algorithm was evaluated with a view to reducing make span time and compared with min -min, maxminand suffrage algorithm.

---