Dynamic TWGH: Client-Server Optimization for Scalable Combinatorial Test Suite Generation

Abstract

To ensure that a software/hardware product is of sufficient quality and functionality, it is essential to conduct thorough testing and evaluations of the numerous individual software components that make up the application. Many different approaches exist for testing software, including combinatorial testing and covering arrays. Because of the difficulty of dealing with difficulties like a two-way combinatorial explosion, this brings up yet another problem: time. Using client-server architectures, this research introduces a parallel implementation of the TWGH algorithm. Many studies have been conducted to demonstrate the efficiency of this technique. The findings of this experiment were used to determine the increase in speed and compare it to the results obtained from the various methodologies. TWGH was shown to be a demonstration of scalability in studies involving speedups. When the recommended method was implemented, the rate of acceleration increased by eight.