On Dynamic Communication Performance of a Hierarchical 3D-Mesh Network

  • M. M. Hafizur Rahman
  • Asadullah Shah
  • Yasushi Inoguchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7513)


A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a Hierarchical 3D-Mesh (H3DM) network using a deadlock-free routing algorithm with minimum number of virtual channels under the uniform and non-uniform traffic patterns; and compare it with other networks to show the superiority of the H3DM network over other networks. We have also evaluated the dynamic communication performance of the mesh and torus networks. It is shown that H3DM network yields low average transfer time than that of mesh and torus networks. The trade-off between throughput and latency of these networks shown that H3DM network provide better dynamic communication performance than that of mesh and torus networks before saturation.


Interconnection network H3DM network Deadlock-free routing algorithm Traffic patterns Dynamic communication performance 


  1. 1.
    Dally, W.J.: Performance Analysis of $k$-ary $n$-cube Interconnection Networks. IEEE Trans. on Computers 39(6), 775–785 (1990)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Abd-El-Barr, M., Al-Somani, T.F.: Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison. Journal of Electrical and Computer Engineering, 12 pages (2011)Google Scholar
  3. 3.
    Lai, P.L., Hsu, H.C., Tsai, C.H., Stewart, I.A.: A class of hierarchical graphs as topologies for interconnection networks. Theor. Comp. Science 411, 2912–2924 (2010)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Liu, Y., Li, C., Han, J.: RTTM: A New Hierarchical Interconnection Network for Massively Parallel Computing. In: Zhang, W., Chen, Z., Douglas, C.C., Tong, W. (eds.) HPCA 2009. LNCS, vol. 5938, pp. 264–271. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Horiguchi, S.: New Interconnection for massively Parallel and Distributed System. Research Report, 09044150, JAIST, pp. 47–57 (1999)Google Scholar
  6. 6.
    Ni, L.M., McKinley, P.K.: A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer 26(2), 62–76 (1993)CrossRefGoogle Scholar
  7. 7.
    Dally, W.J.: Virtual-Channel Flow Control. IEEE Trans. on Parallel and Distributed Systems 3(2), 194–205 (1992)CrossRefGoogle Scholar
  8. 8.
    Hafizur Rahman, M.M., Shah, A., Inoguchi, Y.: A Deadlock-Free Dimension Order Routing for Hierarchical 3D-Mesh Network. In: Proc. of the ICCIS 2012 (2012)Google Scholar
  9. 9.
    Najaf-abadi, H.H., Sarbazi-Azad, H.: The Effect of Adaptivity on the Performance of the OTIS-Hypercube Under Different Traffic Patterns. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds.) NPC 2004. LNCS, vol. 3222, pp. 390–398. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Holsmark, R., Kumar, S., Palesi, M., Mekia, A.: HiRA: A Methodology for Deadlock Free Routing in Hierarchical Networks on Chip. In: Proc. of the 3rd ACM/IEEE NOCS, pp. 2–11 (2009)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • M. M. Hafizur Rahman
    • 1
  • Asadullah Shah
    • 1
  • Yasushi Inoguchi
    • 2
  1. 1.Dept. of Computer ScienceKICT, IIUMGombakMalaysia
  2. 2.Center for Information ScienceJAISTIshikawaJapan

Personalised recommendations