Dynamic Time Quantum Approach to Improve Round Robin Scheduling Algorithm in Cloud Environment

Authors

  • Bhavin Fataniya  M.E(I.T) Student, I.T Department, L.D College Of Engineering, Ahmedabad, Gujarat, India
  • Manoj Patel  Assistant Prof., I.T Department, L.D College Of Engineering, Ahmedabad, Gujarat, India

Keywords:

Round Robin,Dynamic Time Quantum,FCFS, Cloud Environment.

Abstract

Resource allocation or process scheduling in cloud environment is one of the main task of system.Round Robin (RR) scheduling algorithm is the widely used scheduling algorithm in multitasking and real time environment for that purpose. Its performance highly depends on a Time Quantum, which is a predefined amount of time assigned by system to every task to be executed. If we chose the less time quantum then context switch is high and if we chose the high time quantum then its leads to First-Come-First-Serve (FCFS). So, the performance of the system totally depends upon the choice of optimal time quantum. In this Paper,We will proposed a New approach of RR scheduling algorithm using dynamic time quantum, which will reduce waiting time, turnaround time and the number of context switches in order to improve the system overall performance.

References

  1. Pandaba Pradhan, Prafulla Ku. Behera and B N B Ray, "Modified Round Robin Algorithm for Resource Allocation in Cloud Computing ", Science Direct, Procedia Computer Science 85 ( 2016 ) 878 – 890,2016.
  2. Rami J. Matarneh,"Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes", American J. of Applied Sciences 6(10): 1831 -1837,2009.
  3. Salman Arif,Naveed Ghaffar,Ali Javed "Implementation of Alternating Median Based Round Robin Scheduling Algorithm",IEEE, International Conference on Computer and Information Technology,2016.
  4. Salman Arif, Saad Rehman and Farhan Riaz "Design of A Modulus Based Round Robin Scheduling Algorithm",IEEE, 9th Malaysian Software Engineering Conference, Dec. 2015
  5. Alsheikhy, R. Ammar, and R. Elfouly, "An improved dynamic Round Robin scheduling algorithm based on a variant quantum time",IEEE, 2015 11th International Computer Engineering Conference (ICENCO), 2015, pp. 98-104.
  6. Debashree Nayak, Sanjeev Kumar Malla and Debashree Debadarshini "Improved Round Robin Scheduling using Dynamic Time Quantum", International Journal of Computer Applications (0975 – 8887) Volume 38– No.5, January 2012
  7. Noon,A. Kalakech and S. Kadry,"A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average", International Journal of Computer Science Issues (T.TSI),Vol.3,Issue 3,No. 1,pp. 224-229,May 2011.
  8. Amar Ranjan Dash, Sandipta kumar Sahu and Sanjay Kumar Samantra"AN OPTIMIZED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM" International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 5,No.1, February 2015.
  9. H.S.Behera R. Mohanty and Debashree Nayak "A New Proposed Dynamic Quant with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis"International Journal of Computer Applications (0975 – 8887) Volume 5– No.5 August 2010.
  10. Sonia Zauaoui,lotfi Boussaid and Abdellatif Mtibaa, "CPU scheduling algorithms case and comparative study",17th international conference on sciences and techniques of automatic control & computer engineering=STA 2016,sousse,Tunisia,Decmber,2016.
  11. Ishwari Singh Rajput. "A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems", International Journal of Innovations in Engineering and Technology (IJIET), ISSN: 2319 – 1058, Vol. 1 Issue 3 Oct 2012.
  12. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
Bhavin Fataniya, Manoj Patel, " Dynamic Time Quantum Approach to Improve Round Robin Scheduling Algorithm in Cloud Environment, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 4, pp.963-969, March-April-2018.