{"title":"n版本编程的新条件","authors":"K. Bridgewater, J. Gersting, D. Roberts","doi":"10.1109/HICSS.1988.11858","DOIUrl":null,"url":null,"abstract":"An experiment in which relatively low-quality programs were run in an N-version mode on a microcomputer-based network specifically developed to support N-version programming is described. A 20% reduction in average failure probability over individual versions was noted, but at a substantial overhead in execution time. Heuristics for calculating failure rates and for voting in an N-version mode were developed to deal with the iterative nature of the applications problem.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New conditions for N-version programming\",\"authors\":\"K. Bridgewater, J. Gersting, D. Roberts\",\"doi\":\"10.1109/HICSS.1988.11858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An experiment in which relatively low-quality programs were run in an N-version mode on a microcomputer-based network specifically developed to support N-version programming is described. A 20% reduction in average failure probability over individual versions was noted, but at a substantial overhead in execution time. Heuristics for calculating failure rates and for voting in an N-version mode were developed to deal with the iterative nature of the applications problem.<<ETX>>\",\"PeriodicalId\":148246,\"journal\":{\"name\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1988.11858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1988.11858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An experiment in which relatively low-quality programs were run in an N-version mode on a microcomputer-based network specifically developed to support N-version programming is described. A 20% reduction in average failure probability over individual versions was noted, but at a substantial overhead in execution time. Heuristics for calculating failure rates and for voting in an N-version mode were developed to deal with the iterative nature of the applications problem.<>