A parallelization strategies of test suite generation for t-way combinatorial interaction testing

Abstract

This paper proposed a few parallelization strategies for test suite generation for the combinatorial interaction testing using IBM's TSpaces implementation. Much existing work in this field makes use of sequential algorithms for generating interaction test suites for software testing, such as by AETG, IPO, TConfig, IPOG, DDA, simulated annealing and other heuristic search. The TSpaces implementation using Java language provide more powerful programming and deployment environment in term of portability and also greatly simplifies the parallelization using master-worker pattern as described here.