Q21

The concurrent programming constructs fork and join are as below: Fork <label> which creates a new process executing from the specified label Join <variable> which decrements the specified synchronization variable (by $1$) and terminates the process if the new value is not $0$. Show the precedence graph for $S1$, $S2$, $S3$, $S4$, and $S5$ of the concurrent program below. N=2 M=2 Fork L3 Fork L4 S1 L1 : join N S3 L2 : join M S5 L3:S2 Goto L1 L4:S4 Goto L2 Next: