{"title":"斐波那契循环——一种新的互连拓扑","authors":"Yong-Seok Kim","doi":"10.1109/TENCON.1999.818449","DOIUrl":null,"url":null,"abstract":"The paper proposes a novel interconnection network called Fibonacci circulants for large scale parallel processing systems. The FC(f/sub 3m+2/,3) is a regular and vertex transitive (not edge transitive), and has a Hamiltonian cycle. It connects the (3m+2)-th Fibonacci number, f/sub 3m+2/, m/spl ges/0 nodes with 2m links per node. It is an improvement over a comparable hypercube or multiply-twisted cube that the number of nodes with the same diameter and node degree is (2/sup 2m/)/(f/sub 3m+2/)/spl cong/0.85(0.94)/sup m/. And its diameter and maximum node degree are both 2m, that is two-thirds of a comparable Fibonacci cube with f/sub 3m+2/ processing nodes. The FC(f/sub 3m+2/,3) has a simple routing algorithm, and a Fibonacci tree as a spanning tree.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fibonacci circulants-a new interconnection topology\",\"authors\":\"Yong-Seok Kim\",\"doi\":\"10.1109/TENCON.1999.818449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a novel interconnection network called Fibonacci circulants for large scale parallel processing systems. The FC(f/sub 3m+2/,3) is a regular and vertex transitive (not edge transitive), and has a Hamiltonian cycle. It connects the (3m+2)-th Fibonacci number, f/sub 3m+2/, m/spl ges/0 nodes with 2m links per node. It is an improvement over a comparable hypercube or multiply-twisted cube that the number of nodes with the same diameter and node degree is (2/sup 2m/)/(f/sub 3m+2/)/spl cong/0.85(0.94)/sup m/. And its diameter and maximum node degree are both 2m, that is two-thirds of a comparable Fibonacci cube with f/sub 3m+2/ processing nodes. The FC(f/sub 3m+2/,3) has a simple routing algorithm, and a Fibonacci tree as a spanning tree.\",\"PeriodicalId\":121142,\"journal\":{\"name\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1999.818449\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fibonacci circulants-a new interconnection topology
The paper proposes a novel interconnection network called Fibonacci circulants for large scale parallel processing systems. The FC(f/sub 3m+2/,3) is a regular and vertex transitive (not edge transitive), and has a Hamiltonian cycle. It connects the (3m+2)-th Fibonacci number, f/sub 3m+2/, m/spl ges/0 nodes with 2m links per node. It is an improvement over a comparable hypercube or multiply-twisted cube that the number of nodes with the same diameter and node degree is (2/sup 2m/)/(f/sub 3m+2/)/spl cong/0.85(0.94)/sup m/. And its diameter and maximum node degree are both 2m, that is two-thirds of a comparable Fibonacci cube with f/sub 3m+2/ processing nodes. The FC(f/sub 3m+2/,3) has a simple routing algorithm, and a Fibonacci tree as a spanning tree.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
