Deadlock-free multicast wormhole algorithms in 3-D mesh multicomputers

Information Technology Journal

Volumn 6, Issue 5, 2007, Pages 623-632

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

^a JILIN UNIVERSITY   (China)

Author keywords

3 D mesh topology; Deadlock free algorithm; Multicasting communication; Multicomputer; Wormhole routing

Indexed keywords

BINARY TREES; COMMUNICATION SYSTEMS; COMPUTER SYSTEM RECOVERY; INTERCONNECTION NETWORKS; NETWORK ARCHITECTURE; ROUTING ALGORITHMS;

3-D MESH TOPOLOGY; DEADLOCK FREE ALGORITHM; MULTICASTING COMMUNICATION; MULTICOMPUTERS; WORMHOLE ROUTING;

MULTICASTING;

EID: 34748892519     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2007.623.632     Document Type: Article

References (21)

1. Agrawal, A., 1991. Limits on interconnection network performance. IEEE Trans. Parallel Dist. Syst., 2: 398-412.
2. Ahmed Al-Dubai, Mohamed Ould-Khaoua and Lewis Mackenzie, 2006. On balancing network traffic in path-based multicast communication. Fut. Gen. Comput. Syst., 22: 805-811.
3. Almasi, G.S. and A. Gottlieb, 1994. Highly Parallel Computing Benjamin/Cummings.
4. Anonymous, 1990. A Touchstone DELTA system description. Intel Corporation. Intel Supercomputing Systems Division.
5. Anonymous, 1995. CRAY T3E scalable parallel processing system. Cray Research Inc., http://www.cray.com/products/systems/crayt3e/.
6. Athas, W.C. and C.L. Seitz, 1988. Multicomputers: Message passing concurrent computers. IEEE Comput., 21: 9-24.
7. Dally, W.J. and C.L. Seitz, 1986. The tours routingchip. Dist. Comput., 1: 187-196.
8. Dally, W.J., 1989. The J-machine: System Support for Actors. Actors: Knowledge-Based Concurrent Computing. Hewitt and Agha (Eds.) MIT Press.
9. Dally, W.J., 1990. Performance Analysis of K-ary N-cube Interconnection Networks. IEEE Trans. Comput., 39: 775-785.
10. Foschia Rauber, R.T. 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.
11. Hwang, K., 1993. Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, New York.
12. Jianxi, F., 2002. Hamilton-connectivity and cycle-embedding of the Mobius cubes. Inform. Processing Lett., 82: 113-117.
13. Koeninger, R.K., M. Furtney and M. Walker, 1994. A shared memory MPP from Cray research. Digital Tech. J., 6: 8-21.
14. Kumar, D.R., W.A. Najjar and P.K. Srimani, 2001. A new adaptive hardware tree-based multicast routing in K-ary N-cubes. IEEE Trans. Comput., 50: 647-659.
15. Lessler, R.E. and J.L. Schwazmeier, 1993. CRAY T3D: A new dimension for Cray Research. In: COMPCON. IEEE Comput. Soc. Press, pp: 176-182.
16. Libeskind-Hadas, R., T. Hehre, A. Hutchings, M. Reyes and K. Watkins, 1997. Adaptive multicast routing in wormhole networks. In: Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Systems. Washington DC, 13-16, pp: 513-522.
17. 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.
18. McKinley, P.K. and C. Trefftz, 1993, MultiSim: A tool for the study of large-scale multiprocessors. In: Proceeding 1993 International Workshop on Modeling, Analysis and Simulation of Computer and Telecommun. Nehvorks (MASCOTS 93), pp: 57-62.
19. Moharam, H., M.A. Abd El-Bakay and S.M.M. Nasssar, 2000. Yomana-an efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers. J. Syst. Architect., 46: 1073-1091.
20. Nuth, P.R. and W.J. Dally, 1992. The J-Machine Network. In: Proc. IEEE Int. Conf. on Computer Design: VLSI in Computer and Processors. IEEE Computer Society Press, pp: 420-423.
21. Schwetman, H.D., 1985, CSIM: A C-based, process-oriented simulation language. Technical Report, Microelectronics and Computer Technology Corp, pp: 80-85.