in Operating System edited by
1,861 views
6 votes
6 votes

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.

in Operating System edited by
1.9k views

1 Answer

4 votes
4 votes
$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}$
edited by

4 Comments

edited by

@Pranavpurkar

the above link is of hotstar dude.☺

0
0

@Pranavpurkar   kya baat h bhai...wah

0
0

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

0
0

Related questions