X-Hamiltonian Surface Broadcast AlgorithmReportar como inadecuado

X-Hamiltonian Surface Broadcast Algorithm - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Broadcast is one of the most importantapproach in distributed memory parallel computers that is used to find arouting approach from one source to all nodes in the mesh. Broadcasting is adata communication task in which corresponds to one-to-all communication.Routing schema is the approach used to determine the road that is used to senda message from a source node to destination nodes. In this paper, we propose anefficient algorithm for broadcasting on an all-port wormhole-routed 3D meshwith arbitrary size. Wormhole routing is a fundamental routing mechanism inmodern parallel computers which is characterized with low communicationlatency. We show how to apply this approach to 3-D meshes. In wormhole, routinglarge network packets are broken into small pieces called FLITs flow controldigits. The destination address is kept in the first flit which is called theheader flit and sets up the routing behavior for all subsequent flitsassociated with the packet. In this paper, we introduce an efficient algorithm,X-Hamiltonian Surface Broadcast X-HSB which uses broadcast communicationfacility with deadlock-free wormhole routing in general three dimensionalnetworks. In this paper, the behaviors of this algorithm are compared to theprevious results using simulation; our paradigm reduces broadcast latency andis simpler. The results presented in this paper indicate the advantage of ourproposed algorithm.


Broadcasting Communication, Wormhole Routing, Hamiltonian Model, 3-D Mesh, Deadlock-Free

Cite this paper

El-Obaid, A. 2016 X-Hamiltonian Surface Broadcast Algorithm. International Journal of Communications, Network and System Sciences, 9, 269-279. doi: 10.4236-ijcns.2016.96024.

Autor: Amnah El-Obaid

Fuente: http://www.scirp.org/


Documentos relacionados