{"title":"双模态计算环境中容错阵列的双层重构","authors":"R. Melhem","doi":"10.1109/FTCS.1989.105624","DOIUrl":null,"url":null,"abstract":"Fault-tolerant architectures and algorithms are studied for processor arrays which are subject to computational loads that alternate between two phases-a strict phase, characterized by a heavy load and strict constraints on response time, and a relaxed phase, characterized by a light load and relatively relaxed constraints on response time. Under this type of load, a bilevel algorithm may be applied to reconfigure the system after faults. Specifically, at one level, called the fast response level, a local distributed fault-tolerant algorithm is used during the strict phase to achieve fast fault recovery at the expense of possible rapid degradation in the potential to tolerate future faults. In order to minimize the effect of this degradation, a second level, called the optimization level, is added. At that level, a global, relatively slow reorganization algorithm is applied during the relaxed phase to restore the system into a shape that ensures adequate fault-tolerance capability in the remaining part of the system's mission. Three examples are given for bilevel reconfiguration algorithms that emphasize three different restoration criteria.<<ETX>>","PeriodicalId":230363,"journal":{"name":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"510 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Bi-level reconfigurations of fault tolerant arrays in bi-modal computational environments\",\"authors\":\"R. Melhem\",\"doi\":\"10.1109/FTCS.1989.105624\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fault-tolerant architectures and algorithms are studied for processor arrays which are subject to computational loads that alternate between two phases-a strict phase, characterized by a heavy load and strict constraints on response time, and a relaxed phase, characterized by a light load and relatively relaxed constraints on response time. Under this type of load, a bilevel algorithm may be applied to reconfigure the system after faults. Specifically, at one level, called the fast response level, a local distributed fault-tolerant algorithm is used during the strict phase to achieve fast fault recovery at the expense of possible rapid degradation in the potential to tolerate future faults. In order to minimize the effect of this degradation, a second level, called the optimization level, is added. At that level, a global, relatively slow reorganization algorithm is applied during the relaxed phase to restore the system into a shape that ensures adequate fault-tolerance capability in the remaining part of the system's mission. Three examples are given for bilevel reconfiguration algorithms that emphasize three different restoration criteria.<<ETX>>\",\"PeriodicalId\":230363,\"journal\":{\"name\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"510 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1989.105624\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1989.105624","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bi-level reconfigurations of fault tolerant arrays in bi-modal computational environments
Fault-tolerant architectures and algorithms are studied for processor arrays which are subject to computational loads that alternate between two phases-a strict phase, characterized by a heavy load and strict constraints on response time, and a relaxed phase, characterized by a light load and relatively relaxed constraints on response time. Under this type of load, a bilevel algorithm may be applied to reconfigure the system after faults. Specifically, at one level, called the fast response level, a local distributed fault-tolerant algorithm is used during the strict phase to achieve fast fault recovery at the expense of possible rapid degradation in the potential to tolerate future faults. In order to minimize the effect of this degradation, a second level, called the optimization level, is added. At that level, a global, relatively slow reorganization algorithm is applied during the relaxed phase to restore the system into a shape that ensures adequate fault-tolerance capability in the remaining part of the system's mission. Three examples are given for bilevel reconfiguration algorithms that emphasize three different restoration criteria.<>