An efficient Tri Queue job Scheduling using dynamic quantum time for cloud environment

Abstract

Cloud Computing is one of the recent emerging trends in Computer Science and Communication Engineering. Time Complexity and Space Complexity are the two general constraints that determine the efficient program. Based on the above mentioned constraints, a Tri Queue Scheduling (TQS) algorithm proposed for cloud environment. Resource sharing is one of the most challenging task in cloud computing. Efficiency of resource sharing depends upon the metascheduler. In the existing scheduling algorithm like FCFS, SJF, EASY and CBF the performance of these algorithm leads to fragmentation at the time of scheduling. To avoid this fragmentation with in the process an efficient tri queue job scheduling algorithm is essential for cloud computing. The proposed methodology grouping the small, medium and long jobs in the queue, based on the processor needed and time for allocate the resources to the computers. This paper proposed a system which gives importance to all the jobs using dynamic quantum time based Round Robin Fashion. To make the efficient use of the resources, the proposed scheduling algorithm achieves the optimization for cloud scheduling problems.