This paper introduce the statistical definitions of an algorithm in Parallel Random Access Machine Model (PRAM). We present a concept of statistical analysis of 2 × 2 matrix multiplication and its summation will be executed in 2n processors. It shows conceptually how a communication delays taking an important role in parallel time complexity. We compare communications delay with networks topology such as ring, mesh and hypercube. The result of processor utilization curve and timeline chart shows that which networks and how many processors are req1uired for the problem.