A process residing in main memory and ready and waiting for execution, is kept on
Ready Queue
The ready queue holds processes that are ready to run and are waiting for CPU allocation. A blocked or wait queue instead holds processes awaiting an event such as I/O completion. The described process therefore belongs to the ready queue.
Important Questions from Process Scheduling - Teaching
Consider the following 3 processes with the length of the CPU burst time given in milliseconds :
Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 What is the average waiting time for these processes if they are scheduled using preemptive shortest job first scheduling algorithm?
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :
Process Arrival Time Burst Time P 1 0 8 P 2 1 4 P 3 2 9 P 4 3 5 The average waiting time for preemptive SJF scheduling algorithm is
Which of the following is not a CPU scheduling Algorithm?
Which of the following statement(s) is/are true about CPU scheduling algorithm?
I. Shortest remaining time first scheduling may cause starvation
II. Round Robin is better than First Come First Serve in terms of response time
Processes P1, P2, P3 and P4 have CPU burst times 5, 7, 6 and 4 ms, respectively. All arrive at time 0, and the initial ready-queue order is P1, P2, P3, P4. Using Round-Robin scheduling with a 4 ms time quantum and no context-switch overhead, what is P4’s total waiting time in milliseconds?
