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

Journal of Applied Sciences

Volumn 7, Issue 22, 2007, Pages 3410-3419

  Amnah, El Obaid ^a   Zuo, Wan Li ^a  

^a JILIN UNIVERSITY   (China)

Author keywords

3 D mesh; Deadlock free; Hamiltonian model; Multicasting communication; Wormhole routing

Indexed keywords

HAMILTONIANS; INFORMATION DISSEMINATION; INTEGRATED CIRCUIT DESIGN; MESH GENERATION; MESSAGE PASSING; ROUTING ALGORITHMS;

3-D MESH; COMPARATIVE ANALYSIS; DEADLOCK FREE; DISTRIBUTED-MEMORY PARALLEL COMPUTERS; HAMILTONIAN MODELING; MULTICAST ALGORITHMS; PERFORMANCE CHARACTERISTICS; WORMHOLE ROUTING;

MULTICASTING;

EID: 36849072319     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2007.3410.3419     Document Type: Article

References (28)

1. Al-Dubai, A.Y. and M. Ould-Khaoua, 2003. A new scalable broadcast algorithm for multiport meshes with minimum communication steps. Microprocess. Microsyst., 27: 101-113.
2. Al-Dubai, A.Y., M. Ould-Khaoua and L. Mackenzie, 2006. On balancing network traffic in path-based multicast communication. Future Gene. Comput. Syst., 22: 805-911.
3. Almasi, G.S. and A. Gottlieb, 1994. Highly Parallel Computing Benjamin/ Cummings.
4. Amnah El-Obaid and Wan Li-Zuo, 2007. Deadlock-free multicast wormhole algorithm in 3-D mesh multicomputers. Inf Technol. J., 6: 623-632.
5. Anonymous, 1990. A touchstone DELTA system description. Intel Corporation. Intel Supercomputing Systems Division.
6. Anonymous, 1995. CRAY T3E Scalable Parallel Processing System, Cray Research Inc., htGTDTPM://www.cray.com/products/systems/crayt3e/.
7. Athas, W.C. and C.L. Seitz, 1999. Multicomputers: Message passing concurrent computers. IEEE Comp., 21: 9-24.
8. Chin, T.S., C.Y. Chang and J.P. Sbeu, 2000. Efficient pathbased multicast in wormbole-routed mesh networks. J. Syst. Arch., 46: 919-930.
9. Dally, W.J. and C.L. Seitz, 1987. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Co., C-36 (5).
10. Darwish, M.G., A.A. Radwan, M. Abd El-Baky and K. Hamed, 2005. Gtgtdtpmm-an efficient deadlock-free multicast wormhole algorithm for communication in 2d torus multicomputers. IJICIS, Vol. 5, No. 1.
11. Duato, J., Y. Alamanchili and C.L. Ni, 2003. Interconnection Networks: An Engineering Approach, Elsevier Science.
12. Fan, J., 2002. Hamilton-connectivity and cycle-embedding of the Mobius; cubes. Inform. Process. Lett., 2: 113-117, 30.
13. Fleury, E. and P. Fraigniaud, 1998. Strategies for path-based multicasting in wormhole-routed meshes. J. Parallel Distrib. Comput., 60: 26-62.
14. Foschia, R., T. Rauber and G. Runger, 1997. Modeling the Communication Behavior of the Intel Paragon. In: Modeling, Analysis and Simulation of Computer and Telecommunication Systems. IEEE Comput. Soc. Press, pp: 117-124.
15. Hwang, K., 1993. Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, New York.
16. Kumar, D.R., Walid A. Najjar and Pradip K. Srimani, 2001 A New adaptive hardware tree-based multicast routing in K-Ary N-Cubes. IEEE Trans. Comput., 7: 647-659.
17. Lessler, R.E. and J.L. Schwazmeier, 1993. CRAY T3D: A New Dimension for Cray Research. In: COMPCON IEEE Comp. Soc. Press, pp: 176-182.
18. Lin, X., P.K. McKinley and L.M. Ni, 1994. Deadlock-free multicast wormhole routing in 2-D mesh multicomputers. IEEE Trans. Parallel Distrib. Syst. 5: 793-804.
19. Malumbres, M.P. and J. Duato, 2000. An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors. J. Syst Arch., 46: 1019-1032.
20. McKinley, P.K. and C. Trefftz, 1993. MultiSim: A tool for the study of large-scale multiprocessors. In: Proceeding of International Workshop on Modeling. Analysis and Simulation of Computer and Telecommunication Networks (MASCOTS 93), pp: 57-62.
21. McKinley, P.K., H. Gu, A. Esfahanian and L.M. Ni, 1994. Unicast-based multicast communication in wormhole-routed direct networks. IEEE GTDTPMDS, 5: 1254-1265.
22. McKinley, P., Y. Tsai and J.D. Robinson, 1995. Collective communication in wormhole-routed massively parallel computers. IEEE Comput., 28: 39-50.
23. Moharam, H., M.A. Abd El-Baky and S.M.M., 2000. Yomna-An efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers. J. Syst. Arch., 46: 1073-1091.
24. Nen-Chung Wang, Chih-Ping Chu and Tzung-Shi Chen, 2002. A dual hamiltonian-path-based multicasting strategy for wormhole routed star graph interconnection networks. J. Parallel Distrib. Comput., 62: 1747-1762.
25. Nuth, P.R. and W.J. Dally, 1992. The J-Machine Network. In: Proceeding IEEE International Conference on Computer Design: VLSI in Computer and Processors. IEEE Comput. Soc. Press, pp: 420-423.
26. Panda, D.K., S.L. Singa and R. Kesavan, 1999. Multidestination message-passing in wormhole k-ary n-cube networks with base routing conformed paths. IEEE GTDTPMDS, 10: 76-96.
27. Schwetman, H.D., 1985. CSIM: A C-based, process-oriented simulation language. Technical Report Microelectron. Comput. Technol. Corp, pp: 80-85.
28. Tseng, Y., D.K. Panda and T. Lai, 1996. A trip-based multicasting model in wormhole-routed networks with virtual channels. IEEE Trans. Parallel and Distrib. Syst., 7: 138-150.