Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2007 | Volume: 7 | Issue: 22 | Page No.: 3410-3419
DOI: 10.3923/jas.2007.3410.3419
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

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

El-Obaid Amnah and Wan-Li Zuo

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.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

El-Obaid Amnah and Wan-Li Zuo, 2007. Hamiltonian Paths for Designing Deadlock-Free Multicasting Wormhole-Routing Algorithms in 3-D Meshes. Journal of Applied Sciences, 7: 3410-3419.

DOI: 10.3923/jas.2007.3410.3419

URL: https://scialert.net/abstract/?doi=jas.2007.3410.3419

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom