聚类星图:大型互连网络的一种新拓扑

[1993] Proceedings Seventh International Parallel Processing Symposium Pub Date : 1993-04-13 DOI:10.1109/IPPS.1993.262824

S. Latifi, N. Bagherzadeh

{"title":"聚类星图:大型互连网络的一种新拓扑","authors":"S. Latifi, N. Bagherzadeh","doi":"10.1109/IPPS.1993.262824","DOIUrl":null,"url":null,"abstract":"The authors propose a flexible network called the clustered-star (CS) network. An (n-1)-dimensional CS of order m, denoted by CS/sub n-1//sup m/ is an n-dimensional star with (n-m) of its (n-1)-stars missing. The advantage of CS/sub n-1//sup m/ is that from the network size viewpoint, it is scalable by a factor of 1<m<n, as opposed to the (n-1)-star which is scalable only by a factor of n. Furthermore, the complete star graph with some faulty components or with some already allocated substars may result in a clustered-star network which renders the study of this new network important. Basic topological properties of CS/sub n-1//sup m/ are derived and optimal routing and broadcasting algorithms for this network are presented. It is shown that CS/sub n-1//sup m/ is hamiltonian for m=4, and m=3k, k not=2.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The clustered-star graph: a new topology for large interconnection networks\",\"authors\":\"S. Latifi, N. Bagherzadeh\",\"doi\":\"10.1109/IPPS.1993.262824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors propose a flexible network called the clustered-star (CS) network. An (n-1)-dimensional CS of order m, denoted by CS/sub n-1//sup m/ is an n-dimensional star with (n-m) of its (n-1)-stars missing. The advantage of CS/sub n-1//sup m/ is that from the network size viewpoint, it is scalable by a factor of 1<m<n, as opposed to the (n-1)-star which is scalable only by a factor of n. Furthermore, the complete star graph with some faulty components or with some already allocated substars may result in a clustered-star network which renders the study of this new network important. Basic topological properties of CS/sub n-1//sup m/ are derived and optimal routing and broadcasting algorithms for this network are presented. It is shown that CS/sub n-1//sup m/ is hamiltonian for m=4, and m=3k, k not=2.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262824\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

作者提出了一种称为簇星(CS)网络的柔性网络。一个m阶(n-1)维CS，用CS/sub n-1//sup m/表示，是一个n维星，缺少(n-1)颗星中的(n-m)颗。CS/sub n-1//sup m/的优点是，从网络规模的角度来看，它的可扩展性为1倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The clustered-star graph: a new topology for large interconnection networks

The authors propose a flexible network called the clustered-star (CS) network. An (n-1)-dimensional CS of order m, denoted by CS/sub n-1//sup m/ is an n-dimensional star with (n-m) of its (n-1)-stars missing. The advantage of CS/sub n-1//sup m/ is that from the network size viewpoint, it is scalable by a factor of 1>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量

期刊最新文献

Mapping realistic data sets on parallel computers A cluster-M based mapping methodology Supporting insertions and deletions in striped parallel filesystems An efficient atomic multicast protocol for client-server models Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems