Performance Optimized Expectation Conditional Maximization Algorithms for Nonhomogeneous Poisson Process Software Reliability Models

被引:16
|
作者
Nagaraju, Vidhyashree [1 ]
Fiondella, Lance [1 ]
Zeephongsekul, Panlop [2 ]
Jayasinghe, Chathuri L. [3 ]
Wandji, Thierry [4 ]
机构
[1] Univ Massachusetts, Dept Elect & Comp Engn, Dartmouth, MA 02747 USA
[2] RMIT Univ, Sch Math & Geospatial Sci, Melbourne, Vic 3000, Australia
[3] Univ Sri Jayewardenepura, Fac Appl Sci, Dept Stat, Nugegoda 10250, Sri Lanka
[4] Naval Air Syst Command, Patuxent River, MD 20670 USA
基金
美国国家科学基金会;
关键词
Expectation conditional maximization (ECM) algorithm; nonhomogeneous Poisson process (NHPP); software reliability; software reliability growth model; two-stage algorithm; MAXIMUM-LIKELIHOOD-ESTIMATION; ERROR-DETECTION; GROWTH-MODELS;
D O I
10.1109/TR.2017.2716419
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nonhomogeneous Poisson process (NHPP) and software reliability growth models (SRGM) are a popular approach to estimate useful metrics such as the number of faults remaining, failure rate, and reliability, which is defined as the probability of failure free operation in a specified environment for a specified period of time. We propose performance-optimized expectation conditional maximization (ECM) algorithms for NHPP SRGM. In contrast to the expectation maximization (EM) algorithm, the ECM algorithm reduces the maximum-likelihood estimation process to multiple simpler conditional maximization (CM)-steps. The advantage of these CM-steps is that they only need to consider one variable at a time, enabling implicit solutions to update rules when a closed form equation is not available for a model parameter. We compare the performance of our ECM algorithms to previous EM and ECM algorithms on many datasets from the research literature. Our results indicate that our ECM algorithms achieve two orders of magnitude speed up over the EM and ECM algorithms of [1] when their experimental methodology is considered and three orders of magnitude when knowledge of the maximum-likelihood estimation is removed, whereas our approach is as much as 60 times faster than the EM algorithms of [2]. We subsequently propose a two-stage algorithm to further accelerate performance.
引用
收藏
页码:722 / 734
页数:13
相关论文
共 50 条