{"title":"Software reliability and redundancy optimization","authors":"D.-H. Chi, H.-H. Lin, W. Kuo","doi":"10.1109/ARMS.1989.49570","DOIUrl":null,"url":null,"abstract":"A procedure for reliability-related quality programming is developed to fill existing gaps in software design and development so that a quality programming plan can be achieved. The authors investigate the tradeoff between system reliability improvement and resource consumption through the management phase. A software reliability-to-cost relation is developed from both a software reliability-related cost model and software redundancy models with common-cause failures. The software reliability optimization problem can be formulated into a mixed-integer programming problem and solved by a branch-and-bound technique.<<ETX>>","PeriodicalId":430861,"journal":{"name":"Proceedings., Annual Reliability and Maintainability Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Annual Reliability and Maintainability Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARMS.1989.49570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
A procedure for reliability-related quality programming is developed to fill existing gaps in software design and development so that a quality programming plan can be achieved. The authors investigate the tradeoff between system reliability improvement and resource consumption through the management phase. A software reliability-to-cost relation is developed from both a software reliability-related cost model and software redundancy models with common-cause failures. The software reliability optimization problem can be formulated into a mixed-integer programming problem and solved by a branch-and-bound technique.<>