Determining the optimal allocation of testing resource for modular software system using dynamic programming

被引:5
作者
Khan, M. G. M. [1 ]
Ahmad, N. [2 ]
Rafi, L. S. [3 ]
机构
[1] Univ S Pacific, Sch Comp Informat & Math Sci, Suva, Fiji
[2] TM Bhagalpur Univ, Univ Dept Stat & Comp Applicat, Bhagalpur, Bihar, India
[3] Univ S Pacific, Coll Fdn, Suva, Fiji
关键词
Dynamic programming technique; Inflection S-shaped models; Non linear programming problem; Resource allocation problem; Software reliability growth model; RELIABILITY GROWTH; MODELS; POINTS;
D O I
10.1080/03610926.2013.834455
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Reliability is a major concern in the process of software development because unreliable software can cause failure in the computer system that can be hazardous. A way to enhance the reliability of software is to detect and remove the faults during the testing phase, which begins with module testing wherein modules are tested independently to remove a substantial number of faults within a limited resource. Therefore, the available resource must be allocated among the modules in such a way that the number of faults is removed as much as possible from each of the modules to achieve higher software reliability. In this article, we discuss the problem of optimal resource allocation of the testing resource for a modular software system, which maximizes the number of faults removed subject to the conditions that the amount of testing-effort is fixed, a certain percentage of faults is to be removed and a desired level of reliability is to be achieved. The problem is formulated as a non linear programming problem (NLPP), which is modeled by the inflection S-shaped software reliability growth models (SRGM) based on a non homogeneous Poisson process (NHPP) which incorporates the exponentiated Weibull (EW) testing-effort functions. A solution procedure is then developed using a dynamic programming technique to solve the NLPP. Furthermore, three special cases of optimum resource allocations are also discussed. Finally, numerical examples using three sets of software failure data are presented to illustrate the procedure developed and to validate the performance of the strategies proposed in this article. Experimental results indicate that the proposed strategies may be helpful to software project managers for making the best decisions in allocating the testing resource. In addition, the results are compared with those of Kapur etal. (2004), Huang and Lyu (2005), and Jha etal. (2010) that are available in the literature to deal the similar problems addressed in this article. It reveals that the proposed dynamic programming method for the testing-resource allocation problem yields a gain in efficiency over other methods.
引用
收藏
页码:670 / 694
页数:25
相关论文
共 48 条
  • [1] Ahmad N, 2011, INT J COMPUT SCI NET, V11, P161
  • [2] A study of testing-effort dependent inflection S-shaped software reliability growth models with imperfect debugging
    Ahmad, N.
    Khan, M.
    Rafi, L.
    [J]. INTERNATIONAL JOURNAL OF QUALITY & RELIABILITY MANAGEMENT, 2010, 27 (01) : 89 - +
  • [3] Modelling and analysis of software reliability with Burr type X testing-effort and release-time determination
    Ahmad, N.
    Khan, M. G. M.
    Quadri, S. M. K.
    Kumar, M.
    [J]. JOURNAL OF MODELLING IN MANAGEMENT, 2009, 4 (01) : 28 - 54
  • [4] Ahmad N., 2008, P 6 INT S OPT STAT A, P151
  • [5] Ahmad N., 2006, RAU J RES, V16, P159
  • [6] The exponentiated Weibull software reliability growth model with various testing-efforts and optimal release policy A performance analysis
    Ahmad, Nesar
    Bokhari, M.
    Quadri, S.
    Khan, M.
    [J]. INTERNATIONAL JOURNAL OF QUALITY & RELIABILITY MANAGEMENT, 2008, 25 (02) : 211 - +
  • [7] USING DYNAMIC-PROGRAMMING FOR SOLVING VARIATIONAL-PROBLEMS IN VISION
    AMINI, AA
    WEYMOUTH, TE
    JAIN, RC
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1990, 12 (09) : 855 - 867
  • [8] [Anonymous], 1996, HDB SOFTWARE RELIABI
  • [9] Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
  • [10] Bokhari MU, 2007, ADV COMPUTER SCI ENG, V2, P390, DOI DOI 10.1142/9781860948534_0062