{"title":"n版本编程方案的调度算法","authors":"O. Abulnaja, S. Hosseini, K. Vairavan","doi":"10.1109/CMPSAC.1996.544161","DOIUrl":null,"url":null,"abstract":"For critical computer applications, N-version Programming (NVP) is used for software fault tolerance. However, software redundancy which is employed in NVP results in system performance degradation. We propose software fault-tolerant scheduling policies based on both fully N-version programming and semi N-version programming models of computation. Further we study the performance of the system under the proposed scheduling policies.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Scheduling algorithms for N-version programming scheme\",\"authors\":\"O. Abulnaja, S. Hosseini, K. Vairavan\",\"doi\":\"10.1109/CMPSAC.1996.544161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For critical computer applications, N-version Programming (NVP) is used for software fault tolerance. However, software redundancy which is employed in NVP results in system performance degradation. We propose software fault-tolerant scheduling policies based on both fully N-version programming and semi N-version programming models of computation. Further we study the performance of the system under the proposed scheduling policies.\",\"PeriodicalId\":306601,\"journal\":{\"name\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1996.544161\",\"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 20th International Computer Software and Applications Conference: COMPSAC '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1996.544161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling algorithms for N-version programming scheme
For critical computer applications, N-version Programming (NVP) is used for software fault tolerance. However, software redundancy which is employed in NVP results in system performance degradation. We propose software fault-tolerant scheduling policies based on both fully N-version programming and semi N-version programming models of computation. Further we study the performance of the system under the proposed scheduling policies.