Abstract: Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, to send a same message to a subset of processors. This study presents a new efficient multicast path-based algorithm Two-Path-Pipelined (TPP for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. Furthermore, its performance is insensitive to the network size, i.e., only two message-passing steps are required to implement a multicast operation irrespective of the network size. TPP algorithm is compared with the GTDMPM algorithm; TPP algorithm has proved to be deadlock free. Results from extensive simulations under a variety of working conditions confirm that the TPP algorithm exhibits superior performance characteristics over GTDMPM algorithm.