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