Hierarchical Tori Connected Mesh Network

Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Hierarchical Tori connected Mesh Network (HTM) is a 2D-torus network of multiple basic modules, in which the basic modules...

Full description

Bibliographic Details
Main Authors: Rahman, M.M. Hafizur, Shah, Asadullah, Fukushi, Masaru, Inoguchi, Yasushi
Format: Book Chapter
Language:English
Published: Springer-Verlag Berlin Heidelberg 2013
Subjects:
Online Access:http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/1/ICCSA_2013.pdf
id iium-30569
recordtype eprints
spelling iium-305692013-07-12T02:50:24Z http://irep.iium.edu.my/30569/ Hierarchical Tori Connected Mesh Network Rahman, M.M. Hafizur Shah, Asadullah Fukushi, Masaru Inoguchi, Yasushi TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Hierarchical Tori connected Mesh Network (HTM) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-mesh networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the HTM and explores aspects such as degree, diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the HTM using two virtual channels and evaluate the network’s dynamic communication performance using the proposed routing algorithm under uniform traffic and bit-flip traffic patterns. We evaluate the dynamic communication performance of HTM, H3DM, mesh, and torus networks by computer simulation. It is shown that the HTM possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, small wiring complexity, and high throughput per link and very low zero load latency, which provide better dynamic communication performance than that of H3DM, mesh, and torus networks. Springer-Verlag Berlin Heidelberg 2013-06-24 Book Chapter PeerReviewed application/pdf en http://irep.iium.edu.my/30569/1/ICCSA_2013.pdf Rahman, M.M. Hafizur and Shah, Asadullah and Fukushi, Masaru and Inoguchi, Yasushi (2013) Hierarchical Tori Connected Mesh Network. In: Computational Science and Its Applications – ICCSA 2013 : 13th International Conference, Ho Chi Minh City, Vietnam, June 24-27, 2013, Proceedings, Part V. Lecture Notes in Computer Science (7975). Springer-Verlag Berlin Heidelberg, Berlin, pp. 197-210. ISBN 978-3-642-39640-3 (O), 978-3-642-39639-7 (P) http://link.springer.com/chapter/10.1007%2F978-3-642-39640-3_14 10.1007/978-3-642-39640-3_14
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
spellingShingle TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
Rahman, M.M. Hafizur
Shah, Asadullah
Fukushi, Masaru
Inoguchi, Yasushi
Hierarchical Tori Connected Mesh Network
description Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Hierarchical Tori connected Mesh Network (HTM) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-mesh networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the HTM and explores aspects such as degree, diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the HTM using two virtual channels and evaluate the network’s dynamic communication performance using the proposed routing algorithm under uniform traffic and bit-flip traffic patterns. We evaluate the dynamic communication performance of HTM, H3DM, mesh, and torus networks by computer simulation. It is shown that the HTM possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, small wiring complexity, and high throughput per link and very low zero load latency, which provide better dynamic communication performance than that of H3DM, mesh, and torus networks.
format Book Chapter
author Rahman, M.M. Hafizur
Shah, Asadullah
Fukushi, Masaru
Inoguchi, Yasushi
author_facet Rahman, M.M. Hafizur
Shah, Asadullah
Fukushi, Masaru
Inoguchi, Yasushi
author_sort Rahman, M.M. Hafizur
title Hierarchical Tori Connected Mesh Network
title_short Hierarchical Tori Connected Mesh Network
title_full Hierarchical Tori Connected Mesh Network
title_fullStr Hierarchical Tori Connected Mesh Network
title_full_unstemmed Hierarchical Tori Connected Mesh Network
title_sort hierarchical tori connected mesh network
publisher Springer-Verlag Berlin Heidelberg
publishDate 2013
url http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/
http://irep.iium.edu.my/30569/1/ICCSA_2013.pdf
first_indexed 2023-09-18T20:44:45Z
last_indexed 2023-09-18T20:44:45Z
_version_ 1777409600245465088