Suppose that the threads of Fig. 2-28(a) are run in the order: one from A, one from B, one from A, one from B, etc.

Question

22 users unlocked this solution today!

Suppose that the threads of Fig. 2-28(a) are run in the order: one from A, one from B, one from A, one from B, etc. How many possible thread sequences are there for the first four times scheduling is done?

Order in which threads run 2. Runtime system picks a thread Process A Process B 1. Kernel picks a process Possible: A1, A2, A3, A1, A2, A3 Not possible: A1, B1, A2, B2, A3, B3 (a)