High performance hierarchical torus network under matrix transpose traffic patterns

Interconnection networks play a crucial role in the performance of massively parallel computers. 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 Torus Netwo...

Full description

Bibliographic Details
Main Authors:	Rahman, M.M. Hafizur, Susumu, Horiguchi
Format:	Conference or Workshop Item
Language:	English
Published:	2004
Subjects:	TK Electrical engineering. Electronics Nuclear engineering
Online Access:	http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/1/ISPAN_2004.pdf

id	iium-7976
recordtype	eprints
spelling	iium-79762011-11-30T00:43:59Z http://irep.iium.edu.my/7976/ High performance hierarchical torus network under matrix transpose traffic patterns Rahman, M.M. Hafizur Susumu, Horiguchi TK Electrical engineering. Electronics Nuclear engineering Interconnection networks play a crucial role in the performance of massively parallel computers. 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 Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3Dtorus networks that are hierarchically interconnected for higher level networks. The static network performance of the HTN has already been studied and has been shown to be good. Dynamic communication performance has been evaluated under uniform trafﬁc patterns but not under a nonuniform trafﬁc, such as matrix transpose trafﬁc patterns. In this paper, we present a deadlock-free routing algorithm for the HTN using virtual channels and evaluate the network’s dynamic communication performance under matrix transpose trafﬁc, using the proposed routing algorithm. We evaluate the dynamic communication performance of HTN, H3D-mesh, TESH, and mesh networks by computer simulation. We ﬁnd that the dynamic communication performance of HTN is better than that of the H3D-mesh, TESH, and mesh networks. 2004-05 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/7976/1/ISPAN_2004.pdf Rahman, M.M. Hafizur and Susumu, Horiguchi (2004) High performance hierarchical torus network under matrix transpose traffic patterns. In: 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 04), 10-12 May 2004 , Hong Kong. http://dx.doi.org/10.1109/ISPAN.2004.1300467 doi:10.1109/ISPAN.2004.1300467
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	TK Electrical engineering. Electronics Nuclear engineering
spellingShingle	TK Electrical engineering. Electronics Nuclear engineering Rahman, M.M. Hafizur Susumu, Horiguchi High performance hierarchical torus network under matrix transpose traffic patterns
description	Interconnection networks play a crucial role in the performance of massively parallel computers. 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 Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3Dtorus networks that are hierarchically interconnected for higher level networks. The static network performance of the HTN has already been studied and has been shown to be good. Dynamic communication performance has been evaluated under uniform trafﬁc patterns but not under a nonuniform trafﬁc, such as matrix transpose trafﬁc patterns. In this paper, we present a deadlock-free routing algorithm for the HTN using virtual channels and evaluate the network’s dynamic communication performance under matrix transpose trafﬁc, using the proposed routing algorithm. We evaluate the dynamic communication performance of HTN, H3D-mesh, TESH, and mesh networks by computer simulation. We ﬁnd that the dynamic communication performance of HTN is better than that of the H3D-mesh, TESH, and mesh networks.
format	Conference or Workshop Item
author	Rahman, M.M. Hafizur Susumu, Horiguchi
author_facet	Rahman, M.M. Hafizur Susumu, Horiguchi
author_sort	Rahman, M.M. Hafizur
title	High performance hierarchical torus network under matrix transpose traffic patterns
title_short	High performance hierarchical torus network under matrix transpose traffic patterns
title_full	High performance hierarchical torus network under matrix transpose traffic patterns
title_fullStr	High performance hierarchical torus network under matrix transpose traffic patterns
title_full_unstemmed	High performance hierarchical torus network under matrix transpose traffic patterns
title_sort	high performance hierarchical torus network under matrix transpose traffic patterns
publishDate	2004
url	http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/ http://irep.iium.edu.my/7976/1/ISPAN_2004.pdf
first_indexed	2023-09-18T20:17:32Z
last_indexed	2023-09-18T20:17:32Z
_version_	1777407887914565632

High performance hierarchical torus network under matrix transpose traffic patterns

Similar Items