A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?

Related MCQs

• If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then
• In which scheduling certain amount of CPU time is allocated to each process?
• In which scheduling certain amount of CPU time is allocated to each process?
• The link between two processes P and Q to send and receive messages is called
• In indirect communication between processes P and Q                      
• Which of the following view shows that the system is composed of interacting processes at run time?
• To schedule the processes, they are considered                    
• In the token passing approach of distributed systems, processes are organized in a ring structure                          
• According to the ring algorithm, links between processes are                          
• Message passing system allows processes to