Files in this item
Programming heterogeneous parallel machines using refactoring and Monte-Carlo tree search
Item metadata
dc.contributor.author | Brown, Christopher Mark | |
dc.contributor.author | Janjic, Vladimir | |
dc.contributor.author | Goli, M. | |
dc.contributor.author | McCall, John | |
dc.date.accessioned | 2020-06-18T16:30:02Z | |
dc.date.available | 2020-06-18T16:30:02Z | |
dc.date.issued | 2020-08 | |
dc.identifier | 267665708 | |
dc.identifier | 1d472917-f527-49cf-8f35-0e3939539525 | |
dc.identifier | 000539498600001 | |
dc.identifier | 85086328897 | |
dc.identifier.citation | Brown , C M , Janjic , V , Goli , M & McCall , J 2020 , ' Programming heterogeneous parallel machines using refactoring and Monte-Carlo tree search ' , International Journal of Parallel Programming , vol. 48 , no. 4 , pp. 583–602 . https://doi.org/10.1007/s10766-020-00665-z | en |
dc.identifier.issn | 0885-7458 | |
dc.identifier.other | ORCID: /0000-0001-6030-2885/work/75610582 | |
dc.identifier.uri | https://hdl.handle.net/10023/20104 | |
dc.description | Funding: This work was supported by the EU Horizon 2020 project, TeamPlay, Grant Number 779882, and UK EPSRC Discovery, Grant Number EP/P020631/1. | en |
dc.description.abstract | This paper presents a new technique for introducing and tuning parallelism for heterogeneous shared-memory systems (comprising a mixture of CPUs and GPUs), using a combination of algorithmic skeletons (such as farms and pipelines), Monte–Carlo tree search for deriving mappings of tasks to available hardware resources, and refactoring tool support for applying the patterns and mappings in an easy and effective way. Using our approach, we demonstrate easily obtainable, significant and scalable speedups on a number of case studies showing speedups of up to 41 over the sequential code on a 24-core machine with one GPU. We also demonstrate that the speedups obtained by mappings derived by the MCTS algorithm are within 5–15% of the best-obtained manual parallelisation. | |
dc.format.extent | 20 | |
dc.format.extent | 1399128 | |
dc.language.iso | eng | |
dc.relation.ispartof | International Journal of Parallel Programming | en |
dc.subject | Heterogenous parallel computing | en |
dc.subject | Monte-Carlo tree search | en |
dc.subject | Optimisations | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject | BDC | en |
dc.subject.lcc | QA75 | en |
dc.title | Programming heterogeneous parallel machines using refactoring and Monte-Carlo tree search | en |
dc.type | Journal article | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1007/s10766-020-00665-z | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | 779882 | en |
dc.identifier.grantnumber | EP/P020631/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.