Abstract
The Test Suite Minimization Problem (TSMP) is a \(\mathcal {NP}\)-hard real-world problem that arises in the field of software engineering. It lies in selecting the minimal set of test cases from a large test suite, ensuring that the test cases selected cover a given set of elements of a computer program under test. In this paper, we propose a Systolic Genetic Search (SGS) algorithm for solving the TSMP. We use the global concept of SGS to derive a particular algorithm to explicitly exploit the high degree of parallelism available in modern GPU architectures. The experimental evaluation on seven real-world programs shows that SGS is highly effective for the TSMP, as it obtains the optimal solution in almost every single run for all the tested software. It also outperforms two competitive Genetic Algorithms. The GPU-based implementation of SGS has achieved a high performance, obtaining runtime reductions of up to 40\(\times \) compared to its sequential implementation, and solving all the instances considered in less than nine seconds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., (ed.): Parallel Metaheuristics: A New Class of Algorithms. Wiley (2005)
Arito, F., Chicano, F., Alba, E.: On the application of sat solvers to the test suite minimization problem. In: Fraser, G., Teixeira de Souza, J. (eds.) SSBSE 2012. LNCS, vol. 7515, pp. 45–59. Springer, Heidelberg (2012)
Chen, T.Y., Lau, M.F.: Heuristics towards the optimization of the size of a test suite. In: Procs. of the 3rd Int. Conf. on Software Quality Management, pp. 415–424 (1995)
Chen, T.Y., Lau, M.F.: A simulation study on some heuristics for test suite reduction. Information and Software Technology 40(13), 777–787 (1998)
Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact. Empirical Softw. Engg. 10(4), 405–435 (2005)
Harman, M., Mansouri, S.A., Zhang, Y.: Search-based software engineering: Trends, techniques and applications. ACM Comput. Surv. 45(1), 11 (2012)
Harrold, M.J., Gupta, R., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Trans. Softw. Eng. Methodol. 2(3), 270–285 (1993)
Hutchins, M., Foster, H., Goradia, T., Ostrand, T.: Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria. In: Proc. of the 16th Int. Conf. on Software Engineering, pp. 191–200 (1994)
Kung, H.T.: Why systolic architectures? Computer 15(1), 37–46 (1982)
Kung, H.T., Leiserson, C.E.: Systolic arrays (for VLSI). In: Sparse Matrix Proceedings, pp. 256–282 (1978)
Offutt, J., Pan, J., Voas, J.: Procedures for reducing the size of coverage-based test sets. In: Procs. of the Twelfth Int. Conf. on Testing Computer Software (1995)
Pedemonte, M., Alba, E., Luna, F.: Towards the design of systolic genetic search. In: IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp. 1778–1786 IEEE Computer Society (2012)
Pedemonte, M., Luna, F., Alba, E.: New ideas in parallel metaheuristics on gpu: Systolic genetic search. In: Tsutsui, S., Collet, P.: Massively Parallel Evolutionary Computation on GPGPUs. Natural Computing Series, pp. 203–225, Springer (2013)
Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, Fifth edition, Chapman and Hall/CRC (2011)
Yoo, S., Harman, M.: Pareto efficient multi-objective test case selection. In: Proceedings of the 2007 Int. Symposium on Software Testing and Analysis, pp. 140–150 (2007)
Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Softw. Test. Verif. Reliab. 22(2), 67–120 (2012)
Yoo, S., Harman, M., Ur, S.: Highly scalable multi objective test suite minimisation using graphics cards. In: Proceedings of the Third International Conference on Search Based Software Engineering, pp. 219–236 (2011)
Yoo, S., Harman, M., Ur, S.: Gpgpu test suite minimisation: search based software engineering performance improvement using graphics cards. Empirical Software Engineering 18(3), 550–593 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedemonte, M., Luna, F., Alba, E. (2014). Systolic Genetic Search for Software Engineering: The Test Suite Minimization Case. In: Esparcia-Alcázar, A., Mora, A. (eds) Applications of Evolutionary Computation. EvoApplications 2014. Lecture Notes in Computer Science(), vol 8602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_55
Download citation
DOI: https://doi.org/10.1007/978-3-662-45523-4_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45522-7
Online ISBN: 978-3-662-45523-4
eBook Packages: Computer ScienceComputer Science (R0)