{"title":"广义层次全连通网络的容错特性","authors":"T. Takabatake, M. Kitakami, Hideo Ito","doi":"10.1109/PRDC.2002.1185630","DOIUrl":null,"url":null,"abstract":"As a network topology for a massively parallel computer system, generalized hierarchical completely-connected networks (HCC), which include conventional hierarchical networks, have been proposed. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in the HCC must be revealed. However, the properties have not been clarified enough. In this paper, the properties, such as node-connectivity, node-disjoint paths or container, and wide/fault diameter, are verified for the HCC. The concept of the block-connectivity related to the node-connectivity of HCC is introduced, and the fault-tolerance of HCC is discussed. Furthermore, to clear those properties of HCC the unknown properties of other hierarchical networks are also cleared. As a result, the HCC has a fault-diameter that is about 1.5 times as long as the diameter of HCC.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fault-tolerant properties of generalized hierarchical completely-connected networks\",\"authors\":\"T. Takabatake, M. Kitakami, Hideo Ito\",\"doi\":\"10.1109/PRDC.2002.1185630\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a network topology for a massively parallel computer system, generalized hierarchical completely-connected networks (HCC), which include conventional hierarchical networks, have been proposed. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in the HCC must be revealed. However, the properties have not been clarified enough. In this paper, the properties, such as node-connectivity, node-disjoint paths or container, and wide/fault diameter, are verified for the HCC. The concept of the block-connectivity related to the node-connectivity of HCC is introduced, and the fault-tolerance of HCC is discussed. Furthermore, to clear those properties of HCC the unknown properties of other hierarchical networks are also cleared. As a result, the HCC has a fault-diameter that is about 1.5 times as long as the diameter of HCC.\",\"PeriodicalId\":362330,\"journal\":{\"name\":\"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2002.1185630\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2002.1185630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fault-tolerant properties of generalized hierarchical completely-connected networks
As a network topology for a massively parallel computer system, generalized hierarchical completely-connected networks (HCC), which include conventional hierarchical networks, have been proposed. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in the HCC must be revealed. However, the properties have not been clarified enough. In this paper, the properties, such as node-connectivity, node-disjoint paths or container, and wide/fault diameter, are verified for the HCC. The concept of the block-connectivity related to the node-connectivity of HCC is introduced, and the fault-tolerance of HCC is discussed. Furthermore, to clear those properties of HCC the unknown properties of other hierarchical networks are also cleared. As a result, the HCC has a fault-diameter that is about 1.5 times as long as the diameter of HCC.