Broadcast is one of the most important approach in distributed memory parallel computers that is used tofind a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communicationtask in which corresponds to one-to-all communication. Routing schema is the approach that used todetermine the road that is used to send a message from a source node to destination nodes. In this paper,we propose an efficient two algorithms for broadcasting on an all-port wormhole-routed 3D mesh witharbitrary size. In wormhole routing large network packets are broken into small pieces called FLITs (flowcontrol digits). The destination address is kept in the first flit which is called the header flit and sets up therouting behavior for all subsequent flits associated with the packet. If the packets of the message can’tdeliver to their destination and there is a cyclic dependence over the channels in the network, then thedeadlock even is occurred. In this paper we introduce an efficient two algorithms, Three-DimensionHamiltonian Broadcast (3-DHB) and Three-Dimension Six Ports Hamiltonian Broadcast (3-DSPHB)which used broadcast communication facility with deadlock-free wormhole routing in general threedimensionalnetworks. In this paper the behaviors of these algorithms were compared using simulation.The results presented in this paper indicate that the advantage of the proposed algorithms.
展开▼
