Block-switch networks: A cost-effective class of interconnection network
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
185 | en_US |
dc.citation.spage |
175 | en_US |
dc.citation.volume |
12 | en_US |
dc.citation.woscount |
5 | en_US |
dc.contributor.author |
Chiang, WK | en_US |
dc.contributor.author |
Chen, RJ | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2019-04-02T05:59:54Z | |
dc.date.available |
2019-04-02T05:59:54Z | |
dc.date.issued |
1997-05-01 | en_US |
dc.description.abstract |
A new interconnection scheme is proposed for hierarchically constructing massively parallel systems, called the Block-Switch Network (BSN). Presented here is method of connecting together a number of identical basic atoms level by level, a basic atom being an arbitrary connected graph. A BSN is characterized by (G, m), where G represents the basic atom and m denotes the number of levels in hierarchical expansion. A particular choice for G yields a family of hierarchical networks. The topological properties of the BSN for the general case are investigated, and then the results gained from applying BSN to different basic atoms are also discussed. The BSN enables us to construct new families of graphs more feasible and cost-effective. It also deserves mentioning that a shortest-path routing algorithm for the BSN is derived by reducing the routing problem to the K-best perfect matching problem. In particular, we implement fundamental parallel algorithms (descend/ascend) on the BSN(Q(n), m) where Q(n) denotes an n-cube, and demonstrate that the performance on the BSN(Q(n),m) is very close to that of the comparable hypercube. | en_US |
dc.identifier.issn |
0267-6192 | en_US |
dc.identifier.journal |
COMPUTER SYSTEMS SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/149561 | |
dc.identifier.wosnumber |
WOS:A1997XH17200001 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
hierarchical interconnection network | en_US |
dc.subject |
diameter | en_US |
dc.subject |
node disjoint paths | en_US |
dc.subject |
fault tolerance | en_US |
dc.subject |
routing | en_US |
dc.subject |
the assignment problem | en_US |
dc.subject |
parallel algorithms | en_US |
dc.title |
Block-switch networks: A cost-effective class of interconnection network | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Chiang, W., & Chen, R. (1997). Block-switch networks: A cost-effective class of interconnection network. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 12, 175–185. https://ir.lib.nycu.edu.tw/handle/11536/149561
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149561