On Uniform Traffic Pattern of Symmetric Midimew Connected Mesh Network

被引:5
作者
Hag, Ala Ahmed Yahya [1 ]
Rahman, M. M. Hafizur [1 ]
Nor, Rizal Mohd [1 ]
Sembok, Tengku Mohd Tengku [2 ]
机构
[1] IIUM, KICT, Dept Comp Sci, Kuala Lumpur 50728, Malaysia
[2] Natl Def Univ Malaysia, Cyber Secur Ctr, Kuala Lumpur 57000, Malaysia
来源
BIG DATA, CLOUD AND COMPUTING CHALLENGES | 2015年 / 50卷
关键词
Massively Parallel Computer; Interconnection Network; SMMN; TOPAZ Simulator; Virtual Cut Through; Dynamic Communication Performance;
D O I
10.1016/j.procs.2015.04.017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A Symmetric Midimew Mesh connected network (SMMN) is a hierarchical interconnection networks (HIN) that capable to interconnect vast number of nodes that could reach up to millions of nodes in the network. SMMN has multiple basic modules of 2D-mesh networks that are recursively interconnected by Midimew network to create higher-level networks. In this paper, we explain the architectural details of SMMN, we also present the a deadlock-free routing algorithm for SMMN using four virtual channels and evaluate the performance of dynamic communication of SMMN network using proposed routing algorithm under uniform traffic pattern. We also evaluate the performance of dynamic communication of TESH network using topaz simulator. It is shown that the SMMN network has high throughput and low latency, which yield higher performance of dynamic communication compare to other Hierarchical networks. (C) 2015 The Authors. Published by Elsevier B.V.
引用
收藏
页码:476 / 481
页数:6
相关论文
共 9 条
[1]   Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison [J].
Abd-El-Barr, Mostafa ;
Al-Somani, Turki F. .
JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2011, 2011
[2]  
[Anonymous], 2013, P 16 INT C COMP INF
[3]  
Beckman P., 2008, INT C PAR DISTR COMP
[4]  
Miura Y, 2002, THESIS SCH INFORM SC
[5]  
Puente V., 2000, Conference Proceedings of the 2000 International Conference on Supercomputing, P44, DOI 10.1145/335231.335236
[6]  
Puente V., 2000, P 17 IEEE ACM INT PA
[7]  
Rahman M. M. Hafizur, 2009, Journal of Networks, V4, P941, DOI 10.4304/jnw.4.10.941-951
[8]  
Wu R.-Y., 2006, 20 INT PAR DISTR PRO, P25
[9]   Recursive Diagonal Torus: An interconnection network for massively parallel computers [J].
Yang, YL ;
Funahashi, A ;
Jouraku, A ;
Nishi, H ;
Amano, H ;
Sueyoshi, T .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (07) :701-715