AN ENHANCED DYNAMIC TIME QUANTUM MEAN ROUND ROBIN ALGORITHM FOR EFFICIENT RESOURCE ALLOCATION IN CLOUD COMPUTING

Subject Area: Scheduling Algorithm

This study presents an impartial scheduling algorithm that allocates the same time quantum to all processes. The selection of time quantum and preemptive strategies significantly impacts the algorithm's performance. This research introduces an enhanced version of the Revamped Mean Round Robin (RMRR) CPU scheduling algorithm, titled 'An Enhanced Dynamic Time Quantum Mean Round Robin Algorithm for Efficient Resource Allocation in Cloud Computing.' Through empirical evaluation, the new algorithm demonstrated improved performance metrics compared to existing scheduling approaches. Benchmarking against other algorithms in the literature, other new algorithm yields minimal average waiting time (AWT), average turnaround time (ATAT), and number of context switches (NCS). These findings underscore the efficacy of the newly developed algorithm, suggesting its preference for systems employing Round Robin (RR) CPU scheduling.