GATE CSE 1989 | Question: 11b

Question

Consider the following precedence graph $(\text{Fig}.6)$ of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.

Answer 1

$P_{1}$

        fork $L_{1}$                                      $L_{1}$: Join $C_{1}$

        fork $L_{2}$                                              $P_{4}$

        $P_{2}$                                                      goto $L_{4}$

        fork $L_{1}$

$L_{3}$: Join $C_{2}$                                    $L_{2}$: $P_{3}$

        $P_{5}$                                                     goto $L_{3}$

$L_{4}$: Join $C_{3}$

        $P_{6}$

Comments

@Pranavpurkar   kya baat h bhai...wah

---

Lol, @22gate @GateOverflow04 Sorry brother, i think by mistake it happened😂

---

ganimat hai k kisi aur website ka nehi dal dya🔞