Consider the following precedence graph (Fig.6) of processes where a node…

PYQ GATE 1989

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

Source figure

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…