Abstract
The process scheduling, is one of the most important tasks of the operating system. We present in this paper some types of scheduling algorithms of CPU. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. But the most important issue in RR algorithm, which highly affects its efficiency. It determines the amount of the time quantum. Assigning very small and very large values for this parameter, will lead to performance decrease due to increasing context switching overhead, and degradation of the RR method to FCFS algorithm consequently. We will suggest a solution of allocated time quantum.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
