4 votes 4 votes Consider a system having n CPUs, k processes, and k > n. Calculate the upper bound for the number of processes in the READY, RUNNING and BLOCKED states 1 k, k, k. 2 n, n, n 3 k, k, n 4 k, n, k Operating System process-scheduling + – Rahul Chouhan asked Aug 22, 2017 Rahul Chouhan 4.1k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply stblue commented Aug 22, 2017 reply Follow Share Upper bound of process in 1) Ready state : k 2) Running state : n 3) Blocked state : k Option 4 is correct here 3 votes 3 votes Sireesha baggu commented Dec 9, 2017 reply Follow Share Can any one tell the Lower bound too 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes 1) All the k processes could be in ready state. 2) Only n of them could be in running state as there are n processors. 3) It may be possible that all of k processes go to blocked state. So 4. k,n,k is correct. Vivek Jain answered Aug 22, 2017 Vivek Jain comment Share Follow See 1 comment See all 1 1 comment reply rucchuu commented Jun 21, 2018 reply Follow Share In Second, only 'n' process in running state when each cpu(n) will execute only one process in worst case. 0 votes 0 votes Please log in or register to add a comment.