RT Conference Proceedings
T1 EMINENT: Embarrassingly parallel mutation testing
A1 Cerro Cañizares, Pablo
A1 Núñez Covarrubias, Alberto
A1 García Merayo, María De Las Mercedes
AB During the last decade, the fast evolution in communication networks has facilitated the development of complex applications that manage vast amounts of data, like Big Data applications. Unfortunately, the high complexity of these applications hampers the testing process. Moreover, generating adequate test suites to properly check these applications is a challenging task due to the elevated number of potential test cases. Mutation testing is a valuable technique to measure the quality of the selected test suite that can be used to overcome this difficulty. However, one of the main drawbacks of mutation testing lies on the high computational cost associated to this process. In this paper we propose a dynamic distributed algorithm focused on HPC systems, called EMINENT, which has been designed to face the performance problems in mutation testing techniques. EMINENT alleviates the computational cost associated with this technique since it exploits parallelism in cluster systems to reduce the final execution time. In addition, several experiments have been carried out on three applications in order to analyse the scalability and performance of EMINENT. The results show that EMINENT provides an increase in the speed-up in most scenarios.
YR 2016
FD 2016-06-06
LK https://hdl.handle.net/20.500.14352/116959
UL https://hdl.handle.net/20.500.14352/116959
LA eng
NO Spanish MINECO
NO Comunidad de Madrid
DS Docta Complutense
RD 5 abr 2025