An Improved Approach for Scheduling Tasks Based on Lottery Algorithm in Cloud Computing Environment

Cloud computing paradigm of distributed computing, applications are composed a large number of resources and services for the purpose of sharing resources and services on the internet. Task scheduling problems have paramount importance and are trying to determine an efficient scheduling to run tasks and optimal resource allocation. There are many different ways to schedule the tasks in cloud environment which one of the efficiency measures 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 mapping a set of requests to system's available resources which are classi fied with K-means algorithm according to condition of cloud systems and its implementation. Algorithm runs on requests and classified resources in parallel. Using the characteristic of min-min method tried to accelerate the process of finding the answer. The proposed algorithm was evaluated with a view to reducing make span time and compared with min-min, max