Task Scheduling algorithm in cloud computing: A Dynamic Variable Quantum Round robin

Abstract

In recent years a Cloud computing became an attentional topic in IT. In cloud computing a Task allocation is a well-known problem. in the heterogeneous environments like CC task scheduling could be either static or dynamic manner to make the cloud computing more efficient and thus it rallies the users satisfaction. Round-robin fashion is most task scheduling algorithm suitable because it is fair but it had a static time slice problem, so in this paper we proposed dynamic quantum to allocate tasks to appropriate resource which will reduce turnaround time, waiting time, responds time and increase throughput attending to achieve high system performance.