Selecting linear algebra kernel composition using response time prediction. (18th December 2014)

• Record Type: Journal Article
• Authors: Hurault, Aurélie; Baek, Kyungim; Casanova, Henri
• Is Part Of: Software, practice & experience. Volume 45:Number 12(2015)
• Page Start: 1659
• Page End: 1676
• Publication Date: 2014-12-18
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2307
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2307-abs-0001"> <title>Summary</title> <p id="spe2307-para-0001">Numerical linear algebra libraries provide many kernels that can be composed to perform complex computations. For a given computation, there is typically a large number of functionally equivalent kernel compositions. Some of these compositions achieve better response times than others for particular data and when executed on a particular computer architecture. Previous research provides methods to enumerate (a subset of) these kernel compositions. In this work, we study the problem of determining the composition that yields the lowest response time. Our approach is based on a response time prediction for each candidate combination. While this prediction could in principle be obtained using analytical and/or empirical performance models, developing accurate such models is known to be challenging. Instead, we define a feature space that captures salient properties of kernel combinations and predict response time using supervised machine learning. We experiment with a standard set of machine learning algorithms and identify an effective algorithm for our kernel composition selection problem. Using this algorithm, our approach widely outperforms the strategy that would consist in always using the simplest kernel composition and is often close to the fastest kernel compositions among those evaluated. We quantify the potential benefit of our approach if it were to be implemented as part of an interactive computational tool. We find that although the potential benefit is substantial, a limiting factor is the kernel composition enumeration overhead. Copyright © 2014 John Wiley & Sons, Ltd.</p> </abstract>