A hybrid AvgTask-Min and Max-Min algorithm for scheduling tasks in cloud computing

Cloud computing is a new, promising technology for future computing platforms and is expected to provide easier access to remote computational resources. Task scheduling is one of the active research area in cloud computing. Task scheduling algorithms play an important role to reduce the turnaround time and to improve the resource utilization. This paper presents a new task scheduling algorithm which takes the advantages of MaxMin and Enhanced MaxMin algorithms. Here the tasks are selected based on the availability of resource´s. Resources are divided into two groups based on their Mips speed and when the selected resource belongs the first first set, a job just greater then the average length else a job with maximum length is selected. Workflowsim toolkit is used for experimentation. The experimental results shows that the proposed algorithm shows good performance.