一类基于VLSI/WSI的多计算机分层网络

Chienhua Chen, D. Agrawal, J. R. Burke
{"title":"一类基于VLSI/WSI的多计算机分层网络","authors":"Chienhua Chen, D. Agrawal, J. R. Burke","doi":"10.1109/ISVD.1991.185128","DOIUrl":null,"url":null,"abstract":"A class of hierarchical networks is proposed for multicomputer implementation using VLSI and wafer scale integration (VLSI/WSI). These networks, called DBCube, connect clusters of cube topology based nodes with a De Bruijn graph. The nodes are identical and can be easily extended to a larger size. The cube topology for local communication allows easy embedding of parallel algorithms and the De Bruijn graph provides shortest distance among different clusters. The authors compare the DBCube with other networks in terms of topological properties. They compute the silicon area requirement of DBCube. The DBCube topology is such that testing of the network before metallization make it easily configurable to DBCube of smaller size. Potential extension of the DBCube is also addressed.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A class of hierarchical networks for VLSI/WSI based multicomputers\",\"authors\":\"Chienhua Chen, D. Agrawal, J. R. Burke\",\"doi\":\"10.1109/ISVD.1991.185128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A class of hierarchical networks is proposed for multicomputer implementation using VLSI and wafer scale integration (VLSI/WSI). These networks, called DBCube, connect clusters of cube topology based nodes with a De Bruijn graph. The nodes are identical and can be easily extended to a larger size. The cube topology for local communication allows easy embedding of parallel algorithms and the De Bruijn graph provides shortest distance among different clusters. The authors compare the DBCube with other networks in terms of topological properties. They compute the silicon area requirement of DBCube. The DBCube topology is such that testing of the network before metallization make it easily configurable to DBCube of smaller size. Potential extension of the DBCube is also addressed.<<ETX>>\",\"PeriodicalId\":183602,\"journal\":{\"name\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.1991.185128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种基于VLSI和晶圆规模集成(VLSI/WSI)的多计算机分层网络。这些网络被称为DBCube,用德布鲁因图连接基于立方体拓扑的节点簇。节点是相同的,可以很容易地扩展到更大的尺寸。局部通信的立方体拓扑结构可以方便地嵌入并行算法,而De Bruijn图提供了不同簇之间的最短距离。作者将DBCube与其他网络在拓扑特性方面进行了比较。他们计算了DBCube的硅面积需求。DBCube拓扑是这样的,在金属化之前对网络进行测试,可以很容易地将其配置为较小尺寸的DBCube。还讨论了DBCube的潜在扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A class of hierarchical networks for VLSI/WSI based multicomputers
A class of hierarchical networks is proposed for multicomputer implementation using VLSI and wafer scale integration (VLSI/WSI). These networks, called DBCube, connect clusters of cube topology based nodes with a De Bruijn graph. The nodes are identical and can be easily extended to a larger size. The cube topology for local communication allows easy embedding of parallel algorithms and the De Bruijn graph provides shortest distance among different clusters. The authors compare the DBCube with other networks in terms of topological properties. They compute the silicon area requirement of DBCube. The DBCube topology is such that testing of the network before metallization make it easily configurable to DBCube of smaller size. Potential extension of the DBCube is also addressed.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信