GPU and Multiprocessing Parallel Implementations for the Elimination of Finite State Machine Mutants

Given a test suite TS and a set of mutants that can be derived from the specification FSM S with respect to an assumed type of faults. Mutants' elimination deals with killing each mutant of the fault domain that has an output behavior different than that of S in respect to some test case of TS. This process is time consuming, especially when the number of mutants is in the order of millions. Thus, we present and assess two parallel implementations for the considered problem based on the OpenMP and GPU with CUDA technologies. Experiments are conducted to assess the speedup (and execution time) of proposed implementations using both random and real machines. CUDA implementation is shown to be scalable. Experiments also conducted to determine the experimental setup attributes such as TS length, number of - test cases, threads in OpenMP, and inputs of a test case that will be applied to the mutants in each GPU invocation.