ABL-tree: a constant diameter interconnection network for reconfigurable processor arrays capable of distributed communication

N. Tsuda
{"title":"ABL-tree: a constant diameter interconnection network for reconfigurable processor arrays capable of distributed communication","authors":"N. Tsuda","doi":"10.1109/DFTVS.2001.966763","DOIUrl":null,"url":null,"abstract":"An advanced interconnection network called \"ABL-tree\" is proposed for constructing reconfigurable processing-node arrays with a constant network diameter of t(/spl ges/3) for expanding the size of the array. An ABL-tree can be constructed by using small subarrays of processing nodes interconnected as ring, 2-D toroidal mesh, or the complete connection scheme, whose size is determined by the minimal repetition pitch of a node-coloring pattern with an inter-node distance of t (/spl ges/3) for the base array. The processing nodes of the subarrays are connected to a tree-structured switching network with a height of two according to the node-coloring pattern. Inter-node communication is achieved in a distributed manner by selectively using a node adjacent to the source node in the subarray as a relay node whose color is the same as that of the destination node. The proposed scheme allows reconfiguration of large rings or toroidal meshes with various aspect ratios by selectively arranging the subarrays in a free order. It is advantageous in routing, fault tolerance, and the number of switching elements.","PeriodicalId":187031,"journal":{"name":"Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.2001.966763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

An advanced interconnection network called "ABL-tree" is proposed for constructing reconfigurable processing-node arrays with a constant network diameter of t(/spl ges/3) for expanding the size of the array. An ABL-tree can be constructed by using small subarrays of processing nodes interconnected as ring, 2-D toroidal mesh, or the complete connection scheme, whose size is determined by the minimal repetition pitch of a node-coloring pattern with an inter-node distance of t (/spl ges/3) for the base array. The processing nodes of the subarrays are connected to a tree-structured switching network with a height of two according to the node-coloring pattern. Inter-node communication is achieved in a distributed manner by selectively using a node adjacent to the source node in the subarray as a relay node whose color is the same as that of the destination node. The proposed scheme allows reconfiguration of large rings or toroidal meshes with various aspect ratios by selectively arranging the subarrays in a free order. It is advantageous in routing, fault tolerance, and the number of switching elements.
ABL-tree:用于可重构处理器阵列的恒直径互连网络,能够进行分布式通信
提出了一种称为“abl树”的先进互连网络,用于构建可重构的处理节点阵列,其网络直径恒定为t(/spl ges/3),以扩大阵列的大小。abl树可以通过将处理节点的小子阵列互连为环形网格、二维环面网格或完整连接方案来构建,其大小由基阵列节点间距离为t (/spl ges/3)的节点着色模式的最小重复间距决定。子阵列的处理节点按照节点着色模式连接到高度为2的树状交换网络中。节点间通信采用分布式方式,选择子阵列中与源节点相邻的节点作为中继节点,中继节点的颜色与目的节点的颜色相同。提出的方案允许通过有选择地以自由顺序排列子阵列来重新配置具有不同纵横比的大环或环形网格。它在路由、容错和交换元件数量方面具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信