Fork and Join Constructs in Concurrency
Prerequisite – Process Synchronization
The fork instruction is the that instruction in the process execution that produces two concurrent executions in a program. One of the concurrent executions starts at statement labeled and other execution is the continuation of the execution at the statement following the fork instruction. The fork systems call assignment has one parameter i.e. Label (L).
The join instruction is the that instruction in the process execution that provides the medium to recombine two concurrent computations into a single one. The join instruction has one parameter integer count that specifies the number of computations which are to be joined. It decrements the integer by one. If the value of the integer after decrement is non-zero then the process terminates otherwise the process continues execution with the next statement.
Construct the precedence graph for the following fork/join program.
S1; count1: = 2; fork L1; S2; S4; count2: = 2; fork L2; S5; Go to L3; L1: S3; L2: join count1; S6; L3: join count2; S7;
Write a fork/join program for the following precedence graph.
After S1 fork statement is required to create a child.
After S4 fork statement is required to create a child.
All processes need to join before S7.
S1; count: = 3; fork L1; S2; S4; fork L2; S5; Go to L3; L2: S6; GOTO L3; L1: S3; L3: join count; S7;
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.