No Detail Found!

Hamiltonian paths for designing deadlock-free multicasting wormhole-routing algorithms in 3-D meshes.

Author(s)
El-Obaid Amnah College of Computer Science and Technology, Jilin University, Changchun, China
Wan-Li Zuo College of Computer Science and Technology, Jilin University, Changchun, China
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. In this study, we propose two new multicast algorithms for a mesh network using wormhole routing with the path-based facility. The main feature of the proposed algorithms is its ability to handle multicast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithms exhibit superior performance characteristics over the well-known GTDMPM algorithm.
Publication Details
Page(s) 3410-3419
DOI DOI not available
Published Journal: Journal of Applied Sciences, Volume: 7, Issue: 22, Year: 2007

Request the full text from PASTIC

0

Citations

0

Downloads

42

Views