Guan Xin-Li, T. Hameenanttila, J. Carothers, Chen Jian-xin
{"title":"灵活的超立方体多处理器系统","authors":"Guan Xin-Li, T. Hameenanttila, J. Carothers, Chen Jian-xin","doi":"10.1109/PCCC.1994.504126","DOIUrl":null,"url":null,"abstract":"A new interconnection network known as the Flexible Hypercube is introduced. The Flexible Hypercube is a fault-tolerant architecture that can be constructed for an arbitrary number of nodes and is incrementally expandable. This network architecture maintains the strong features of the Hypercube while overcoming deficiencies in expandability and flexibility. It is shown to have strong node connectivity, a small diameter, and a high degree of fault tolerance. The Flexible Hypercube network is suitable for the design of both parallel computer systems and distributed computer networks. Efficient fault-free and fault-tolerant message-routing algorithms for this network are presented.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Flexible Hypercube Multiprocessor System\",\"authors\":\"Guan Xin-Li, T. Hameenanttila, J. Carothers, Chen Jian-xin\",\"doi\":\"10.1109/PCCC.1994.504126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new interconnection network known as the Flexible Hypercube is introduced. The Flexible Hypercube is a fault-tolerant architecture that can be constructed for an arbitrary number of nodes and is incrementally expandable. This network architecture maintains the strong features of the Hypercube while overcoming deficiencies in expandability and flexibility. It is shown to have strong node connectivity, a small diameter, and a high degree of fault tolerance. The Flexible Hypercube network is suitable for the design of both parallel computer systems and distributed computer networks. Efficient fault-free and fault-tolerant message-routing algorithms for this network are presented.\",\"PeriodicalId\":203232,\"journal\":{\"name\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1994.504126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1994.504126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new interconnection network known as the Flexible Hypercube is introduced. The Flexible Hypercube is a fault-tolerant architecture that can be constructed for an arbitrary number of nodes and is incrementally expandable. This network architecture maintains the strong features of the Hypercube while overcoming deficiencies in expandability and flexibility. It is shown to have strong node connectivity, a small diameter, and a high degree of fault tolerance. The Flexible Hypercube network is suitable for the design of both parallel computer systems and distributed computer networks. Efficient fault-free and fault-tolerant message-routing algorithms for this network are presented.