Highly Scalable Multi Objective Test Suite Minimisation Using Graphics Cards
University College London
Search Based Software Engineering, Lecture Notes in Computer Science, Volume 6956/2011, 219-236, 2011
@incollection{springerlink:10.1007/978-3-642-23716-4_20,
author={Yoo, Shin and Harman, Mark and Ur, Shmuel},
affiliation={University College, London, UK},
title={Highly Scalable Multi Objective Test Suite Minimisation Using Graphics Cards},
booktitle={Search Based Software Engineering},
series={Lecture Notes in Computer Science},
editor={Cohen, Myra and Cinneide, Mel},
publisher={Springer Berlin / Heidelberg},
isbn={978-3-642-23715-7},
keyword={Computer Science},
pages={219-236},
volume={6956},
url={http://dx.doi.org/10.1007/978-3-642-23716-4_20},
note={10.1007/978-3-642-23716-4_20},
year={2011}
}
Despite claims of "embarrassing parallelism" for many optimisation algorithms, there has been very little work on exploiting parallelism as a route for SBSE scalability. This is an important oversight because scalability is so often a critical success factor for Software Engineering work. This paper shows how relatively inexpensive General Purpose computing on Graphical Processing Units (GPGPU) can be used to run suitably adapted optimisation algorithms, opening up the possibility of cheap scalability. The paper develops a search based optimisation approach for multi objective regression test optimisation, evaluating it on benchmark problems as well as larger real world problems. The results indicate that speed-ups of over 25x are possible using widely available standard GPUs. It is also encouraging that the results reveal a statistically strong correlation between larger problem instances and the degree of speed up achieved. This is the first time that GPGPU has been used for SBSE scalability.
September 28, 2011 by hgpu
