Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
| Hi-index | 0.00 |
Generally, systematic testing is the only way to assess the occurrence of failures in systems consisting in a set of components, however given the size of real-world systems, it would be very expensive to construct and test all the possible combinations of the states of components. Combinatorial interaction testing is an existing technique that appropriately reduces the number of test cases by choosing either pairs, triplets, etc., i.e. t-tuples, of input values. Of course, the effectiveness of a test suite is higher when choosing e.g. triplets of inputs rather than pairs. Since high values of t are preferable, a large number of test cases could still be generated. This paper proposes a technique for building the smallest possible test suite of size t. This technique consists in reducing the number of test cases by carefully choosing non redundant t-tuples. The paper shows that for obtaining the smallest possible set of tests, it is best to generate a large 'flexible' set of t-tuples and then reduce such a set until the smallest one is obtained. Reduction is a computationally expensive operation and therefore it is worth performing it by parallelizing its execution. This paper proposes a solution for executing the reduction algorithm over a set of Grid resources.