As part of the initialising function, a process gets a random numer of clock ticks that specifies how many ticks after the previous process it joins the ready queue. Processes join the ready queue in array-index order: 0, 1. The time is randomly generated using a die.There are 10 processes in all and the they have bascially 4 states :init, ready, running.The program initializes all the processes by putting them in the init state. CPU goes around the ready queue allocating the CPU to each process for a time interval up to 1 time quantum. ![]() In this technique each process is provided a fix time execute which is called time quantum (or time slice). The fcfs program is a very very very simple program since i am not as experienced as you guys - does not have any IOinterrupts or anything. What is round robin scheduling :- In this technique ready queue is treated as circular queue. ![]() I am trying to write a round robin scheduler and so i decided that if i got a fcfs scheduler, then all i would have to do is change the process from completing in the processor to it just going into the processor for a variable time and then being put on the ready queue until its completed.
0 Comments
Leave a Reply. |