表紙画像

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...

詳細記述

保存先:
書誌詳細
主要な著者: Rahman, M.M. Hafizur, Horiguchi, Susumu
フォーマット: 論文
言語:English
出版事項: Inderscience Publishers 2006
主題:
TK7800 Electronics. Computer engineering. Computer hardware. Photoelectronic devices
オンライン･アクセス:http://irep.iium.edu.my/7990/1/IJHPCN_2006.pdf
http://irep.iium.edu.my/7990/
http://inderscience.metapress.com/content/1yv89n32p142myme/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.iium.irep.7990
record_format dspace
spelling my.iium.irep.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 REM 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/
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
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/1/IJHPCN_2006.pdf
http://irep.iium.edu.my/7990/
http://inderscience.metapress.com/content/1yv89n32p142myme/
_version_ 1643606046966546432
score 13.250246

類似資料