![]() The algorithm is best suited for time sharing system. The objective of the algorithm is to maximize the CPU utilization. Context switching is used to save states of preempted processes. Once a process is executed for a given time period, it is preempted and other process executes for a given time period. ![]() The fixed time is called the time quantum or time slot or time stamp or time slice. Each process is provided a fix time to execute in cyclic way. Round Robin scheduling is the preemptive process scheduling algorithm. In this section, we will discuss the round robin scheduling algorithm and its implementation in a Java program. ![]() It is closely similar to FCFS scheduling. It is also known as time slicing scheduling algorithm. It is especially designed for time sharing system. Round Robin (RR) algorithm is a CPU scheduling algorithm. Next → ← prev Round Robin Scheduling Program in Java
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |