Question: Which statements must be executed before S6 is executed in the program in Example? (Use the precedence graph in Figure)
Example: Precedence Graphs and Concurrent Processing Computer programs can be executed more rapidly by executing certain statements concurrently. It is important not to execute a statement that requires results of statements not yet executed. The dependence of statements on previous statements can be represented by a directed graph. Each statement is represented by a vertex, and there is an edge from one statement to a second statement if the second statement cannot be executed before the first statement. This resulting graph is called a precedence graph. A computer program and its graph are displayed in Figure. For instance, the graph shows that statement S5 cannot be executed before statements S1, S2, and S4 are executed.
