Broadcast is one of the most important approach in distributed memory parallel computers that is used to find a routing approach from a one source to all nodes in the mesh. The approach of this case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Routing schema is the approach that used to determine the road that is used to send a message from a source node to destination nodes. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. In wormhole routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t deliver to their destination and there is a cyclic dependence over the channels in the network, then the deadlock even is occurred. In this paper, we consider an efficient algorithm for broadcasting on Multi-Port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Three-Dimension Tow Phase Multi-Port (3-DTPMP) algorithm which used broadcast communication facility with deadlock-free wormhole routing in general three-dimensional networks. In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our simulation results show the average of our proposed algorithm over the other algorithms that presented