Improved Variable Round Robin Scheduling Algorithm

Simple item page
dc.contributor.authorMangukia, A.
dc.contributor.authorIbrahim, M.
dc.contributor.authorGolamudi, S.
dc.contributor.authorKumar, N.
dc.contributor.authorAnand Kumar, M.
dc.date.accessioned2026-02-06T06:36:06Z
dc.date.issued2021
dc.description.abstractThe scheduling strategy used has an impact on system efficiency. It assigns processes in a specified order in order to improve those functions. The Round Robin method is one of several types of scheduling algorithms. In Round Robin, each process is allotted a time quantum (TQ), which indicates that each process consumes the same amount of time as the other processes. There is no precedence among the functions, and the CPU has a relatively short response time. The Time Quantum value cannot be too small because the number of context shifts will increase and hamper performance, while a Time Quantum value that is too large will harm the ART. The suggested study focuses on making the Round Robin approach more practical and efficient. © 2021 IEEE.
dc.identifier.citation2021 12th International Conference on Computing Communication and Networking Technologies, ICCCNT 2021, 2021, Vol., , p. -
dc.identifier.urihttps://doi.org/10.1109/ICCCNT51525.2021.9579716
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/30244
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectAverage response time
dc.subjectAverage turnaround time
dc.subjectAverage waiting time
dc.subjectContext switches
dc.subjectCPU scheduling
dc.subjectProcess scheduling
dc.subjectRound robin scheduling
dc.subjectScheduling algorithms
dc.subjectVariable quantum
dc.titleImproved Variable Round Robin Scheduling Algorithm

Files

Collections

Conference Papers