{"title":"节点故障双立方体容错循环嵌入","authors":"Yamin Li, S. Peng, Wanming Chu","doi":"10.1109/PDCAT.2003.1236261","DOIUrl":null,"url":null,"abstract":"A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fault-tolerant cycle embedding in dual-cube with node faulty\",\"authors\":\"Yamin Li, S. Peng, Wanming Chu\",\"doi\":\"10.1109/PDCAT.2003.1236261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.\",\"PeriodicalId\":145111,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2003.1236261\",\"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 the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fault-tolerant cycle embedding in dual-cube with node faulty
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.