If the number of cycles spent busy – waiting is not excessive, then                          

Related MCQs

• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• If a process needs I/O to or from a disk, and if the drive or controller is busy then
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• The number of clock cycles per second is referred as                  
• The number of clock cycles per second is referred as              
• The operation that does not involves clock cycles is                    
• The operation that does not involves clock cycles is                          
• What is Waiting time?
• Which of the following scheduling algorithms gives minimum average waiting time?
• Computer has a built-in system clock that emits millions of regularly spaced electric pulses per            called clock cycles.