An Improved Round Robin CPU Scheduling

@article{1700273,
      author = {Neha, Ankita Jiyani},
      title = {An Improved Round Robin CPU Scheduling },
      journal = {Iconic Research And Engineering Journals},
      year = {2018},
      volume = {1},
      number = {9},
      pages = {82-86},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1700273.pdf},
      abstract = {CPU is one of the most important component of the computer which is used for scheduling the process known as CPU Scheduling. It is the process of scheduling the process one after another while one is on hold and other is in ready state. Many types of scheduling algorithms are there like First-Come-First-Served(FCFS), Shortest Job First(SJF), Priority Scheduling and Round Robin which basically focus on maximizing throughput and CPU utilization and minimizing response time, turnaround time, number of context switching and waiting time. In this paper we proposed an improved round robin CPU scheduling algorithm. The result shows that improved round robin Scheduling is always giving better result than the conventional Round Robin Scheduling Algorithm.},
      keywords = {Round Robin Scheduling, Response Time, Time Quantum, Burst Time, Waiting Time, Turnaround Time.},
      month = {March},
  }