Hamiltonian Paths for Designing Deadlock-Free Multicasting Wormhole-Routing Algorithms in 3-D Meshes

El-Obaid, Amnah; Zuo, Wanli

doi:10.3923/jas.2007.3410.3419

Cited by 9 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hamiltonian-path routing is considered as one of the most efficient important approach for designing a deadlock-free algorithm of wormhole-routed network [37] and [38]. In this paper the routing algorithm is the Hamiltonian-path, at first, a Hamiltonian path is embedded onto target 3-D mesh network topology, and then messages are routed on the basis of the Hamiltonian path.…”

Section: Hamiltonian Models To the 3-d Mesh Network As Set Of Surfacesmentioning

confidence: 99%

X-Hamiltonian Surface Broadcast Algorithm

El-Obaid¹

2016

IJCNS

View full text Add to dashboard Cite

Broadcast is one of the most important approach in distributed memory parallel computers that is used to find a routing approach from one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds to one-to-all communication. Routing schema is the approach used to determine the road that is used to send a message from a source node to destination nodes. In this paper, we propose an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. 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. In this paper, we introduce an efficient algorithm, X-Hamiltonian Surface Broadcast (X-HSB) which uses broadcast communication facility with deadlock-free wormhole routing in general three dimensional networks. In this paper, the behaviors of this algorithm are compared to the previous results using simulation; our paradigm reduces broadcast latency and is simpler. The results presented in this paper indicate the advantage of our proposed algorithm.

show abstract

Section: Hamiltonian Models To the 3-d Mesh Network As Set Of Surfacesmentioning

confidence: 99%

X-Hamiltonian Surface Broadcast Algorithm

El-Obaid¹

2016

IJCNS

View full text Add to dashboard Cite

show abstract

“…The all upper diagonal channels of the source with addresses [(x, y, z), (x, y, z + 1)] is located at Subnetwork N +z , and all lower diagonal channels of source with addresses [(x, y, z), (x, y, z -1)] is located at subnetwork N -z contains[35] …”

mentioning

confidence: 99%

Y-Hamiltonian Layers Broadcast Algorithm

El-Obaid¹,

AL-Madi²

2016

IJNSA

View full text Add to dashboard Cite

Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most important process in communication and parallel computer is broadcast approach.. 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. 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. Wormhole routing is divided the packets into set of FLITS (flow control digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). 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.

show abstract