A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network

A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple Basic Modules (BM), in which the BM are 3D-torus networks that are hierarchically interconnected for higher level networks. In this paper, we present a deadlock-free dimension-order routing using minimum number of Virtual Channels...

Full description

Bibliographic Details
Main Authors:	Rahman, M.M. Hafizur, Horiguchi, Susumu
Format:	Article
Language:	English
Published:	Inderscience Publishers 2006
Subjects:	TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
Online Access:	http://irep.iium.edu.my/7990/ http://irep.iium.edu.my/7990/ http://irep.iium.edu.my/7990/1/IJHPCN_2006.pdf

id	iium-7990
recordtype	eprints
spelling	iium-79902016-08-15T05:46:04Z http://irep.iium.edu.my/7990/ A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network Rahman, M.M. Hafizur Horiguchi, Susumu TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple Basic Modules (BM), in which the BM are 3D-torus networks that are hierarchically interconnected for higher level networks. In this paper, we present a deadlock-free dimension-order routing using minimum number of Virtual Channels and evaluate the network's dynamic communication performance under the uniform traffic pattern by computer simulation and compare it with other contemporary conventional and hierarchical networks. We find that the dynamic communication performance of the HTN is better than that of the H3D-mesh, TESH, mesh, and torus networks. We also present the mapping of some primitive applications on the HTN. It is shown that the number of communication steps for various advanced applications mapping on the HTN is lower than that of those networks. Inderscience Publishers 2006 Article PeerReviewed application/pdf en http://irep.iium.edu.my/7990/1/IJHPCN_2006.pdf Rahman, M.M. Hafizur and Horiguchi, Susumu (2006) A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network. International Journal of High Performance Computing and Networking (IJHPCN), 4 (3/4). pp. 174-187. ISSN 1740-0570 (O), 1740-0562 (P) http://inderscience.metapress.com/content/1yv89n32p142myme/
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 Horiguchi, Susumu A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
description	A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple Basic Modules (BM), in which the BM are 3D-torus networks that are hierarchically interconnected for higher level networks. In this paper, we present a deadlock-free dimension-order routing using minimum number of Virtual Channels and evaluate the network's dynamic communication performance under the uniform traffic pattern by computer simulation and compare it with other contemporary conventional and hierarchical networks. We find that the dynamic communication performance of the HTN is better than that of the H3D-mesh, TESH, mesh, and torus networks. We also present the mapping of some primitive applications on the HTN. It is shown that the number of communication steps for various advanced applications mapping on the HTN is lower than that of those networks.
format	Article
author	Rahman, M.M. Hafizur Horiguchi, Susumu
author_facet	Rahman, M.M. Hafizur Horiguchi, Susumu
author_sort	Rahman, M.M. Hafizur
title	A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
title_short	A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
title_full	A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
title_fullStr	A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
title_full_unstemmed	A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network
title_sort	deadlock-free routing algorithm using minimum number of virtual channels and application mappings for hierarchical torus network
publisher	Inderscience Publishers
publishDate	2006
url	http://irep.iium.edu.my/7990/ http://irep.iium.edu.my/7990/ http://irep.iium.edu.my/7990/1/IJHPCN_2006.pdf
first_indexed	2023-09-18T20:17:34Z
last_indexed	2023-09-18T20:17:34Z
_version_	1777407889810391040

A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network

Similar Items