Mapping parallel programs to heterogeneous CPU/GPU architectures using a Monte Carlo Tree Search


The single core processor, which has dominated for over 30 years, is now obsolete with recent trends increasing towards parallel systems, demanding a huge shift in programming techniques and practices. Moreover, we are rapidly moving towards an age where almost all programming will be targeting parallel systems. Parallel hardware is rapidly evolving, with large heterogeneous systems, typically comprising a mixture of CPUs and GPUs, becoming the mainstream. Additionally, with this increasing heterogeneity comes increasing complexity: not only does the programmer have to worry about where and how to express the parallelism, they must also express an efficient mapping of resources to the available system. This generally requires in-depth expert knowledge that most application programmers do not have. In this paper we describe a new technique that derives, automatically, optimal mappings for an application onto a heterogeneous architecture, using a Monte Carlo Tree Search algorithm. Our technique exploits high-level design patterns, targeting a set of well-specified parallel skeletons. We demonstrate that our MCTS on a convolution example obtained speedups that are within 5% of the speedups achieved by a hand-tuned version of the same application.

DOI: 10.1109/CEC.2013.6557926

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@inproceedings{Goli2013MappingPP, title={Mapping parallel programs to heterogeneous CPU/GPU architectures using a Monte Carlo Tree Search}, author={Mehdi Goli and John A. W. McCall and Christopher D Brown and Vladimir Janjic and Kevin Hammond}, booktitle={IEEE Congress on Evolutionary Computation}, year={2013} }