40 Algorithms Every Programmer Should Know

Conducting sequential process analysis

The time to run P is represented by T_seq(P). The times to run P1 and P2 are represented by T_seq(P1) and T_seq(P2). It is obvious that, when running on a single node, we can observe two things:

• P2 cannot start running before P1 is complete. This is represented by P1 -- > P2

• T_seq(P) = T_seq(P1) + T_seq(P2)

Let's assume that P overall takes 10 minutes to run on a single node. Out of these 10 minutes, P1 takes 2 minutes to run and P2 takes 8 minutes to run on a single node. This is shown in the following diagram:

Now the important thing to note is that P1 is sequential in nature. We cannot make it faster by ...