{"title":"FTN，一种全N容错网络架构，理论与应用","authors":"R. R. Seban","doi":"10.1109/AERO.1989.82413","DOIUrl":null,"url":null,"abstract":"The author has developed a network architecture called FTN which is highly fault tolerant and can be designed for any number of processors N. The network possesses many other desirable properties, cumulatively not possessed by any other network. An FTN-network-based parallel/distributed system can tolerate up to (log/sub 2/N)-1 failed processors. In a fault configuration it is easy to generate secondary paths; the corresponding algorithms are developed and proven correct. The network can be constructed using simple rules for an arbitrary N>or=2. To increase the number of processors in the system by one is possible and easy. It is shown that in general the connectivity (log/sub 2/N)<or=k<or=(log/sub 2/N). The total number of edges grows much slower with N in the FTN then in the generalized hypercube.<<ETX>>","PeriodicalId":414116,"journal":{"name":"IEEE Aerospace Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"FTN, a fault tolerant network architecture for all N, theory and applications\",\"authors\":\"R. R. Seban\",\"doi\":\"10.1109/AERO.1989.82413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author has developed a network architecture called FTN which is highly fault tolerant and can be designed for any number of processors N. The network possesses many other desirable properties, cumulatively not possessed by any other network. An FTN-network-based parallel/distributed system can tolerate up to (log/sub 2/N)-1 failed processors. In a fault configuration it is easy to generate secondary paths; the corresponding algorithms are developed and proven correct. The network can be constructed using simple rules for an arbitrary N>or=2. To increase the number of processors in the system by one is possible and easy. It is shown that in general the connectivity (log/sub 2/N)<or=k<or=(log/sub 2/N). The total number of edges grows much slower with N in the FTN then in the generalized hypercube.<<ETX>>\",\"PeriodicalId\":414116,\"journal\":{\"name\":\"IEEE Aerospace Applications Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-02-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Aerospace Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AERO.1989.82413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Aerospace Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AERO.1989.82413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
FTN, a fault tolerant network architecture for all N, theory and applications
The author has developed a network architecture called FTN which is highly fault tolerant and can be designed for any number of processors N. The network possesses many other desirable properties, cumulatively not possessed by any other network. An FTN-network-based parallel/distributed system can tolerate up to (log/sub 2/N)-1 failed processors. In a fault configuration it is easy to generate secondary paths; the corresponding algorithms are developed and proven correct. The network can be constructed using simple rules for an arbitrary N>or=2. To increase the number of processors in the system by one is possible and easy. It is shown that in general the connectivity (log/sub 2/N)>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
