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. Operating System gate1989 descriptive operating-system precedence-graph process-synchronization + – makhdoom ghaya asked Dec 9, 2016 • edited Apr 16, 2021 by Lakshman Bhaiya makhdoom ghaya 2.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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}$ pankaj borah answered Apr 6, 2017 • edited Jan 14, 2022 by pankaj borah pankaj borah comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments 22gate commented Nov 4, 2022 reply Follow Share @Pranavpurkar kya baat h bhai...wah 0 votes 0 votes Pranavpurkar commented Nov 4, 2022 reply Follow Share Lol, @22gate @GateOverflow04 Sorry brother, i think by mistake it happened😂 0 votes 0 votes biswajitbora commented Aug 7, 2023 reply Follow Share ganimat hai k kisi aur website ka nehi dal dya🔞 0 votes 0 votes Please log in or register to add a comment.