Optimization of tasks in cloud computing based on MAX-MIN, MIN-MIN and priority

According to the increasing usage of cloud computing and necessity of optimize usage of resources, and considering to users who pay for services by them usage (pay-as-you-go), there should be a quicker way for users to decrease the user s waiting time and task s Makespane. The main purpose of this paper is to provide an optimal algorithm using the advantages of two traditional algorithms: Min-Min and Max-Min. Other point that follow in TOMMP algorithm is the priority of the tasks. There are a lot of scheduling algorithms in the world today, but in most algorithms the priority given to the task has been neglected and overlooked. In this algorithm, priority is firstly selected for tasks based on a prioritization algorithm, and then using the median number to decide which one of the Min-Min or Max-Min algorithms is to be used. It should be noted that according to the TOMMP algorithms, its Makespane is lower than comparisons of the compared algorithms and it’s shown to be better than the comparable algorithms.